LS(Graph): a constraint-based local search for constraint optimization on trees and paths

  • Authors:

  • Quang Dung Pham;Yves Deville;Pascal Hentenryck

  • Affiliations:

  • School of Information and Communication Technology, Hanoi University of Science and Technology, Hanoi, Vietnam;Université catholique de Louvain, Louvain-la-Neuve, Belgium 1348;Optimization Research Group, NICTA, Victoria Research Laboratory, Electrical and Electronic Engineering, The University of Melbourne, Melbourne, Australia 3010

  • Venue:
  • Constraints
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Constrained optimum tree (COT) and 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 framework for COT/COP applications, bringing the compositionality, reuse, and extensibility at the core of constraint-based local search and constraint programming systems. The modeling contribution is the ability to express compositional models for various COT/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. This framework is applied to some COT/COP problems, e.g., the quorumcast routing problem, the edge-disjoint paths problem, and the routing and wavelength assignment with delay side constraints problem. Computational results show the potential importance of the approach.