Constraint-Based Local Search for Constrained Optimum Paths Problems

PHAM, Quang Dung;Deville, Yves;Van Hentenryck, Pascal
(2010) 7th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2010), Lecture Notes in Computer Science, Springer — Location: Bologna, Italy (14.June.2010)

Files

CPAIOR2010_PHAM.pdf
  • Open Access
  • Adobe PDF
  • 220.24 KB
Download

Details

Authors
  • PHAM, Quang DungUCLouvain
    Author
  • Deville, Yvesorcid-logoUCLouvain
    Collaborator
  • Van Hentenryck, PascalBrown University
    Collaborator
Abstract
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 extensibil- ity 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 neigh- borhood based on rooted spanning trees to find high-quality solutions to COP problems. The framework, implemented in COMET, is applied to Re- source Constrained Shortest Path (RCSP) problems (with and without side constraints) and to the edge-disjoint paths problem (EDP). Com- putational results show the potential significance of the approach.
Affiliations

Citations

  • APA
  • Chicago
  • FWB

PHAM, Q. D. (2010). Constraint-Based Local Search for Constrained Optimum Paths Problems. 7th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2010), Lecture Notes in Computer Science, Springer, Bologna, Italy. https://hdl.handle.net/2078.5/219262