A Local Search Modeling for Constrained Optimum Paths Problems (Extended Abstract)

Quang Dung Pham
(UC Louvain)
Yves Deville
(UC Louvain)
Pascal Van Hentenryck
(Brown University)

Constrained Optimum Path (COP) problems appear in many real-life applications, especially on communication networks. Some of these problems have been considered and solved by specific techniques which are usually difficult to extend. In this paper, we introduce a novel local search modeling for solving some COPs by local search. The modeling features the compositionality, modularity, reuse and strengthens the benefits of Constrained-Based Local Search. We also apply the modeling to the edge-disjoint paths problem (EDP). We show that side constraints can easily be added in the model. Computational results show the significance of the approach.

In Yves Deville and Christine Solnon: Proceedings 6th International Workshop on Local Search Techniques in Constraint Satisfaction (LSCS 2009), Lisbon, Portugal, 20 September 2009, Electronic Proceedings in Theoretical Computer Science 5, pp. 5–11.
Published: 8th October 2009.

ArXived at: https://dx.doi.org/10.4204/EPTCS.5.1 bibtex PDF

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org