Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Constraint-Based Local Search
LS(graph & tree): a local search framework for constraint optimization on graphs and trees
Proceedings of the 2009 ACM symposium on Applied Computing
Proceedings of the 2010 Symposium on Information and Communication Technology
Kangaroo: an efficient constraint-based local search system using lazy propagation
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Solving the longest simple path problem with constraint-based techniques
CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Resource constrained shortest paths with a super additive objective function
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
| Hi-index | 0.00 |
Constrained Optimum Path (COP) problems arise in many real-life applications and are ubiquitous in communication networks. They have been traditionally approached by dedicated algorithms, which are often hard to extend with side constraints and to apply widely. This paper proposes a constraint-based local search (CBLS) framework for COP applications, bringing the compositionality, reuse, and extensibility at the core of CBLS and CP systems. The modeling contribution is the ability to express compositional models for various COP applications at a high level of abstraction, while cleanly separating the model and the search procedure. The main technical contribution is a connected neighborhood based on rooted spanning trees to find high-quality solutions to COP problems. The framework, implemented in COMET, is applied to Resource Constrained Shortest Path (RCSP) problems (with and without side constraints) and to the edge-disjoint paths problem (EDP). Computational results show the potential significance of the approach.