From Zinc to Design Model

  • Reza Rafeh
  • Maria Garcia de la Banda
  • Kim Marriott
  • Mark Wallace
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4354)

Abstract

We describe a preliminary implementation of the high-level modelling language Zinc. This language supports a modelling methodology in which the same Zinc model can be automatically mapped into different design models, thus allowing modellers to easily “plug and play” with different solving techniques and so choose the most appropriate for that problem. Currently, mappings to three very different design models based on constraint programming (CP), mixed integer programming (MIP) and local search are provided. Zinc is the first modelling language that we know of that supports such solver and technique-independent modelling. It does this by using an intermediate language called Flattened Zinc, and rewrite rules for transforming the Flattened Zinc model into one that is tailored to a particular solving technique.

Keywords

Local Search Design Model Mixed Integer Programming Constraint Programming Element Constraint 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Apt, K., Wallace, M.: Constraint Logic Programming Using ECLiPSe. Cambridge University Press, Cambridge (2006)Google Scholar
  2. 2.
    Duck, G., Stuckey, P.J., Brand, S.: ACD term rewriting. In: Etalle, S., Truszczyński, M. (eds.) ICLP 2006. LNCS, vol. 4079, pp. 117–131. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  3. 3.
    Flener, P., Pearson, J., Ågren, M.: Introducing ESRA, a relational language for modelling combinatorial problems. In: Bruynooghe, M. (ed.) LOPSTR 2004. LNCS, vol. 3018, pp. 214–232. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  4. 4.
    Fourer, R., Gay, D.M., Kernighan, B.W.: AMPL: A Modeling Language for Mathematical Programming. Duxbury Press (2002)Google Scholar
  5. 5.
    Frisch, A.M., Grum, M., Jefferson, C., Martinez-Hernandez, B., Miguel, I.: The essence of ESSENCE: A constraint language for specifying combinatorial problems. In: Fourth International Workshop on Modelling and Reformulating Constraint Satisfaction Problems, pp. 73–88 (2005)Google Scholar
  6. 6.
    Frisch, A.M., Jefferson, C., Martinez-Hernandez, B., Miguel, I.: The rules of constraint modelling. In: Proc. 19th IJCAI, pp. 109–116 (2005)Google Scholar
  7. 7.
    Garcia de la Banda, M., Marriott, K., Rafeh, R., Wallace, M.: The modelling language Zinc. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 700–705. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  8. 8.
    Gervet, C.: Large scale combinatorial optimization: A methodological viewpoint. In: Discrete Mathematics and Theoretical Computer Science, DIMACS 2001, vol. 57, p. 151 (2001)Google Scholar
  9. 9.
    Jayaraman, B., Tambay, P.: Modeling engineering structures with constrained objects. In: PADL, pp. 28–46 (2002)Google Scholar
  10. 10.
    Michel, L., Van Hentenryck, P.: Localizer: A modeling language for local search. In: Smolka, G. (ed.) CP 1997. LNCS, vol. 1330, pp. 237–251. Springer, Heidelberg (1997)CrossRefGoogle Scholar
  11. 11.
    Refalo, P.: Linear formulation of constraint programming models and hybrid solvers. In: Dechter, R. (ed.) CP 2000. LNCS, vol. 1894, pp. 369–383. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  12. 12.
    Stuckey, P.J., García de la Banda, M.J., Maher, M.J., Marriott, K., Slaney, J.K., Somogyi, Z., Wallace, M., Walsh, T.: The G12 project: Mapping solver independent models to efficient solutions. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 13–16. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  13. 13.
    Van Hentenryck, P., Lustig, I., Michel, L.A., Puget, J.F.: The OPL Optimization Programming Language. MIT Press, Cambridge (1999)Google Scholar
  14. 14.
    Williams, H.P.: Model Building in Mathematical Programming. John Wiley and Sons, Chichester (1999)Google Scholar
  15. 15.
    Yuen, B.J., Richardson, K.V.: Establishing the optimality of sequencing heuristics for cutting stock problems. European Journal of Operational Research 84, 590–598 (1995)MATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Reza Rafeh
    • 1
  • Maria Garcia de la Banda
    • 1
  • Kim Marriott
    • 1
  • Mark Wallace
    • 1
  1. 1.Clayton School of ITMonash UniversityAustralia

Personalised recommendations