A High Level Language for Solver Independent Model Manipulation and Generation of Hybrid Solvers
This paper introduces a high level language that allows for the specification and manipulation of solver independent models and allows for easily generating complex solvers in the Comet language. As Constraint Programming (CP) techniques have increased in complexity, it has become more difficult and time consuming to implement models that take advantage of state-of-the-art modeling techniques and search heuristics. This is particularly problematic for problems that have not been well studied as it is often unclear a priori which modeling technologies and search strategies will be effective.
This work builds on previous solver independent languages by introducing a more general framework based on abstract models and model operators. Model operators represent complex model transformations that can be applied in various combinations to yield a wide array of concrete solvers, including hybrid solvers. Furthermore, Local Search (LS) is fully supported allowing for sequential and parallel bounds-passing hybrids that have not been possible in previous solver independent languages. Large Neighborhood Search (LNS) and column generation based models are also demonstrated.
Unable to display preview. Download preview PDF.
- 1.Akgun, O., Miguel, I., Jefferson, C., Frisch, A., Hnich, B.: Extensible automated constraint modelling (2011)Google Scholar
- 3.Daniel Fontaine, L.M.: A large-scale neighborhood search approach to matrix decomposition into consecutive-ones matrices. In: 8th Workshop on Local Search Techniques in Constraint Satisfaction, vol. 9 (2011)Google Scholar
- 7.Moura, L.D., Passmore, G.O.: The strategy challenge in smt solvingGoogle Scholar
- 14.Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems, pp. 417–431. Springer, Heidelberg (1998)Google Scholar
- 15.Stuckey, P.J., de la Banda, M.G., Maher, M., Marriott, K., Slaney, J., Somogyi, Z., Wallace, M., Walsh, T.: The G12 Project: Mapping Solver Independent Models to Efficient Solutions. In: Gabbrielli, M., Gupta, G. (eds.) ICLP 2005. LNCS, vol. 3668, pp. 9–13. Springer, Heidelberg (2005)CrossRefGoogle Scholar
- 16.Van Hentenryck, L., Michel, P.: Synthesis of constraint-based local search algorithms from high-level models. In: Proceedings of the National Conference on Artificial Intelligence, vol. 1(CONF 22), pp. 273–279 (2007)Google Scholar