A General Approach for Constraint Solving by Local Search

In this paper, we present a general approach for solving constraint problems by local search. The proposed approach is based on a set of high-level constraint primitives motivated by constraint programming systems. These constraints constitute the basic bricks to formulate a given combinatorial problem. A tabu search engine ensures the resolution of the problem so formulated. Experimental results are shown to validate the proposed approach.

[1]  Sally C. Brailsford,et al.  The Progressive Party Problem: Integer Linear Programming and Constraint Programming Compared , 1995, CP.

[2]  Peter J. Stuckey,et al.  A Lagrangian reconstruction of GENET , 2000, Artif. Intell..

[3]  Fred W. Glover,et al.  Tabu Search , 1997, Handbook of Heuristics.

[4]  Sally C. Brailsford,et al.  Organizing a social event - A difficult problem of combinatorial optimization , 1996, Comput. Oper. Res..

[5]  Alain Hertz,et al.  Using tabu search techniques for graph coloring , 1987, Computing.

[6]  David L. Woodruff,et al.  Optimization software class libraries , 2002 .

[7]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning , 1991, Oper. Res..

[8]  Marcus Randall,et al.  A General Meta-Heuristic Based Solver for Combinatorial Optimisation Problems , 2001, Comput. Optim. Appl..

[9]  Joachim P. Walser.  Integer Optimization by Local Search , 2000, Lecture Notes in Computer Science.

[10]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[11]  Toshihide Ibaraki,et al.  A tabu search approach to the constraint satisfaction problem as a general problem solver , 1998, Eur. J. Oper. Res..

[12]  Charles Fleurent,et al.  Object-oriented implementation of heuristic search methods for Graph Coloring, Maximum Clique, and Satisfiability , 1993, Cliques, Coloring, and Satisfiability.

[13]  Jin-Kao Hao,et al.  Tabu Search for Maximal Constraint Satisfaction Problems , 1997, CP.

[14]  Jin-Kao Hao,et al.  Tabu Search for Frequency Assignment in Mobile Radio Networks , 1998, J. Heuristics.

[15]  Andrew J. Davenport,et al.  GENET: A Connectionist Architecture for Solving Constraint Satisfaction Problems by Iterative Improvement , 1994, AAAI.

[16]  Jin-Kao Hao,et al.  Hybrid Evolutionary Algorithms for Graph Coloring , 1999, J. Comb. Optim..

[17]  Edward P. K. Tsang,et al.  Foundations of constraint satisfaction , 1993, Computation in cognitive science.

[18]  J. K. Lenstra,et al.  Local Search in Combinatorial Optimisation. , 1997 .

[19]  Philippe Codognet,et al.  Yet Another Local Search Method for Constraint Solving , 2001, SAGA.

[20]  Jin-Kao Hao,et al.  Solving the Progressive Party Problem by Local Search , 1999 .

[21]  Silvano Martello,et al.  Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization , 2012 .

[22]  Alain Hertz,et al.  An Object-Oriented Methodology for Solving Assignment-Type Problems with Neighborhood Search Techniques , 1996, Oper. Res..

[23]  Alan K. Mackworth.  Constraint Satisfaction , 1985 .