Sciweavers

Share
CPAIOR
2010
Springer

Constraint-Based Local Search for Constrained Optimum Paths Problems

9 years 8 months ago
Constraint-Based Local Search for Constrained Optimum Paths Problems
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 h 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 sig...
Pham Quang Dung, Yves Deville, Pascal Van Hentenry
Added 19 Jul 2010
Updated 19 Jul 2010
Type Conference
Year 2010
Where CPAIOR
Authors Pham Quang Dung, Yves Deville, Pascal Van Hentenryck
Comments (0)
books