Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems
CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
Linear Formulation of Constraint Programming Models and Hybrid Solvers
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Minimum Cardinality Matrix Decomposition into Consecutive-Ones Matrices: CP and IP Approaches
CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Cadmium: An Implementation of ACD Term Rewriting
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Synthesis of constraint-based local search algorithms from high-level models
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
From high-level model to branch-and-price solution in G12
CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
The g12 project: mapping solver independent models to efficient solutions
ICLP'05 Proceedings of the 21st international conference on Logic Programming
ICLP'06 Proceedings of the 22nd international conference on Logic Programming
| Hi-index | 0.00 |
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.