LS(graph & tree): a local search framework for constraint optimization on graphs and trees

LS(Graph & Tree) is a local search framework which aims at simplifying the modeling of Constraint Satisfaction Optimization Problems on graphs (CSOP on graphs or GCSOP). Optimum Constrained Trees (OCT) problems (a subclass of CSOP on graphs) in which we need to find an optimum subtree with additional constraints of a given weighted graph arise in many real-life applications. This paper introduces the LS(Graph & Tree) framework and local search abstractions for OCT problems. These abstractions are applied to model and solve the edge weighted k-Cardinality Tree (KCT) problem. The modeling as well as experimental results show the significance of the abstractions.

[1]  Marco Laumanns,et al.  A hybrid ACO algorithm for the Capacitated Minimum Spanning Tree Problem , 2004, Hybrid Metaheuristics.

[2]  Renato F. Werneck,et al.  Dual Heuristics on the Exact Solution of Large Steiner Problems , 2001, Electron. Notes Discret. Math..

[3]  Martin Zachariasen,et al.  Local search for the Steiner tree problem in the Euclidean plane , 1999, Eur. J. Oper. Res..

[4]  Kerry Raymond,et al.  A tree-based algorithm for distributed mutual exclusion , 1989, TOCS.

[5]  Christian Blum,et al.  New metaheuristic approaches for the edge-weighted k-cardinality tree problem , 2005, Comput. Oper. Res..

[6]  Uzi Vishkin,et al.  Recursive Star-Tree Parallel Data Structure , 1993, SIAM J. Comput..

[7]  Jano I. van Hemert,et al.  Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO , 2006, GECCO.

[8]  Markus Chimani,et al.  Obtaining Optimal k-Cardinality Trees Fast , 2008, ALENEX.

[9]  Dushyant Sharma,et al.  A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem , 2003, Oper. Res. Lett..

[10]  Yves Deville,et al.  CP(Graph): Introducing a Graph Computation Domain in Constraint Programming , 2005, CP.

[11]  Shmuel Tomi Klein,et al.  Compression of correlated bit-vectors , 1991, Inf. Syst..

[12]  Abilio Lucena,et al.  Using Lagrangian dual information to generate degree constrained spanning trees , 2006, Discret. Appl. Math..

[13]  Liyuan Liu,et al.  Constraint-Based Combinators for Local Search , 2004, CP.

[14]  Liyuan Liu,et al.  Contraint-Based Combinators for Local Search , 2005, Constraints.

[15]  Andreas T. Ernst,et al.  Comparison of Algorithms for the Degree Constrained Minimum Spanning Tree , 2001, J. Heuristics.

[16]  Steven Skiena,et al.  Lowest common ancestors in trees and directed acyclic graphs , 2005, J. Algorithms.