Abstract
In recent years, Cml, G12 and Simpl, have achieved significant progress in automating the generation of hybrid solvers from high-level model specifications. This paper pushes this research direction one step further and introduces the concept of model combinators to provide principled model compositions. These model combinators rely on runnables capturing executable models, runnable signatures that capture what runnables can produce and consume, and model hierarchies, which track relationships among models. These concepts make it possible to enforce the soundness of model compositions and to determine the best model compositions automatically. A prototype of the framework on top of the Objective-CP optimization system is presented.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Akgun, O., Miguel, I., Jefferson, C., Frisch, A., Hnich, B.: Extensible automated constraint modelling (2011)
De Moura, L., Bjørner, N.: Satisfiability modulo theories: introduction and applications. Commun. ACM 54(9), 69–77 (2011)
Duck, G.J., De Koninck, L., Stuckey, P.J.: Cadmium: An implementation of ACD term rewriting. In: Garcia de la Banda, M., Pontelli, E. (eds.) ICLP 2008. LNCS, vol. 5366, pp. 531–545. Springer, Heidelberg (2008)
Duck, G., Stuckey, P., Brand, S.: Acd term rewriting. In: Etalle, S., Truszczyński, M. (eds.) ICLP 2006. LNCS, vol. 4079, pp. 117–131. Springer, Heidelberg (2006)
Fazel-Zarandi, M.M., Beck, J.C.: Solving a Location-Allocation Problem with Logic-Based Benders’ Decomposition. In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, pp. 344–351. Springer, Heidelberg (2009)
Fontaine, D., Michel, L.: A high level language for solver independent model manipulation and generation of hybrid solvers. In: Beldiceanu, N., Jussien, N., Pinson, É. (eds.) CPAIOR 2012. LNCS, vol. 7298, pp. 180–194. Springer, Heidelberg (2012)
Frisch, A., Harvey, W., Jefferson, C., Martínez-Hernández, B., Miguel, I.: Essence: A constraint language for specifying combinatorial problems. Constraints 13, 268–306 (2008)
Seldin, J.P., Roger Hindley, J.: Lambda-Calculus and Combinators An Introduction, 2nd edn. Cambridge University Press (2008)
Puchinger, J., Stuckey, P.J., Wallace, M., Brand, S.: From high-level model to branch-and-price solution in g12 (2008)
Puchinger, J., Stuckey, P.J., Wallace, M.G., Brand, S.: Dantzig-wolfe decomposition and branch-and-price solving in g12. Constraints 16(1), 77–99 (2011)
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)
Schrijvers, T., Tack, G., Wuille, P., Samulowitz, H., Stuckey, P.J.: Search combinators. In: Lee, J. (ed.) CP 2011. LNCS, vol. 6876, pp. 774–788. Springer, Heidelberg (2011)
Van Hentenryck, P., Michel, L.: Search = continuations + controllers. In: Proceedings of the 19th International Conference on Principles and Practice of Constraint Programming (submitted, September 2013)
Yunes, T., Aron, I.D., Hooker, J.N.: An integrated solver for optimization problems. Oper. Res. 58(2), 342–356 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fontaine, D., Michel, L., Van Hentenryck, P. (2013). Model Combinators for Hybrid Optimization. In: Schulte, C. (eds) Principles and Practice of Constraint Programming. CP 2013. Lecture Notes in Computer Science, vol 8124. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40627-0_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-40627-0_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40626-3
Online ISBN: 978-3-642-40627-0
eBook Packages: Computer ScienceComputer Science (R0)