Skip to main content

A Stochastic Continuous Optimization Backend for MiniZinc with Applications to Geometrical Placement Problems

  • Conference paper
  • First Online:
Integration of AI and OR Techniques in Constraint Programming (CPAIOR 2016)

Abstract

MiniZinc is a solver-independent constraint modeling language which is increasingly used in the constraint programming community. It can be used to compare different solvers which are currently based on either Constraint Programming, Boolean satisfiability, Mixed Integer Linear Programming, and recently Local Search. In this paper we present a stochastic continuous optimization backend for MiniZinc models over real numbers. More specifically, we describe the translation of FlatZinc models into objective functions over the reals, and their use as fitness functions for the Covariance Matrix Adaptation Evolution Strategy (CMA-ES) solver. We illustrate this approach with the declarative modeling and solving of hard geometrical placement problems, motivated by packing applications in logistics involving mixed square-curved shapes and complex shapes defined by Bézier curves.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    https://code.google.com/p/or-tools/.

  2. 2.

    https://github.com/chocoteam/choco-parsers.

  3. 3.

    http://eclipseclp.org/doc/bips/lib_public/flatzinc/.

  4. 4.

    http://www.gecode.org/flatzinc.html.

  5. 5.

    http://www.opturion.com/cpx.

  6. 6.

    http://www.minizinc.org/challenge2014/descriptionizplus.txt.

  7. 7.

    http://www.ibex-lib.org.

  8. 8.

    https://www.lri.fr/~hansen/cmaesintro.html.

References

  1. Björdal, G., Monette, J.-N., Flener, P., Pearson, J.: A constraint-based local search backend for minizinc. Constraints 20(3), 325–345 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  2. Cameron, S., Culley, R.: Determining the minimum translational distance between two convex polyhedra. In: Proceedings of the IEEE International Conference on Robotics and Automation, vol. 3, pp. 591–596, April 1986

    Google Scholar 

  3. Castillo, I., Kampas, F.J., Pintér, J.D.: Solving circle packing problems by global optimization: numerical results and industrial applications. Eur. J. Oper. Res. 191(3), 786–802 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  4. Chernov, N., Stoyan, Y., Romanova, T.: Mathematical model and efficient algorithms for object packing problems. Comput. Geom. 43, 535–553 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  5. Dobkin, D., Hershberger, J., Kirkpatrick, D., Suri, S.: Computing the intersection-depth of polyhedra. Algorithmica 9, 518–533 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  6. Hansen, N., Ostermeier, A.: Completely derandomized self-adaptation in evolution strategies. Evol. Comput. 9(2), 159–195 (2001)

    Article  Google Scholar 

  7. Hentenryck, P.V., Michel, L.: Synthesis of constraint-based local search algorithms from high-level models. In: Proceeding of the AAAI, pp. 273–278 (2007)

    Google Scholar 

  8. Martinez, T., Fages, F.: On translating minizinc constraint models into fitness function for evolutionary algorithms: application to continuous placement problems. In: Proceedings of the Sixth Workshop on Bin Packing and Placement Constraints, BPPC 2015, Associated to CP 2015, September 2015

    Google Scholar 

  9. Martinez, T., Vitorino, L., Fages, F., Aggoun, A.: On solving mixed shapes packing problems by continuous optimization with the cma evolution strategy. In: Proceedings of the First Computational Intelligence BRICS Congress, BRICS-CCI 2013, pp. 515–521. IEEE Press, September 2013

    Google Scholar 

  10. Michel, L., Van Hentenryck, P.: The comet programming language and system. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, p. 881. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  11. Nethercote, N., Stuckey, P.J., Becket, R., Brand, S., Duck, G.J., Tack, G.R.: MiniZinc: towards a standard CP modelling language. In: Bessière, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 529–543. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  12. Salas, I., Chabert, G.: Packing curved objects. In: Proceedings of the 24th International Joint Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina (2015)

    Google Scholar 

  13. Sederberg, T.W.: Chapter 7, planar curve intersection. Technical report, Computer Aided Geometric Design Course Notes (2011)

    Google Scholar 

Download references

Acknowledgements

This work has been funded by the ANR Blanc Simi2 Net-WMS-2 grant ANR-11-BS02-0005. We would like to thank all the partners of this project for fruitful discussions.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Thierry Martinez .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Martinez, T., Fages, F., Aggoun, A. (2016). A Stochastic Continuous Optimization Backend for MiniZinc with Applications to Geometrical Placement Problems. In: Quimper, CG. (eds) Integration of AI and OR Techniques in Constraint Programming. CPAIOR 2016. Lecture Notes in Computer Science(), vol 9676. Springer, Cham. https://doi.org/10.1007/978-3-319-33954-2_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-33954-2_19

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-33953-5

  • Online ISBN: 978-3-319-33954-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics