A tabu search approach to the constraint satisfaction problem as a general problem solver

Many combinatorial problems, including a variety of combinatorial optimization problems, can be naturally formulated as a constraint satisfaction problem (CSP). We develop in this paper a tabu search-based algorithm for the CSP as a foundation for a general problem solver. In addition to the basic components of tabu search, we develop a number of elaborations, such as an automatic control mechanism for the tabu tenure, modification of the penalty function to handle objective functions, and enlargement of the neighborhood by allowing swap operations. Computational results with our algorithm are reported for various problems selected from a wide range of applications, i.e., graph coloring, generalized assignment, set covering, timetabling and nurse scheduling. Our results appear to be competitive with those of existing algorithms specially developed for the respective problem domains.

[1]  D. Costa,et al.  A tabu search algorithm for computing an operational timetable , 1994 .

[2]  Steven Minton,et al.  Minimizing Conflicts: A Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems , 1992, Artif. Intell..

[3]  Sabah U. Randhawa,et al.  A heuristic-based computerized nurse scheduling system , 1993, Comput. Oper. Res..

[4]  Dirk Cattrysse,et al.  A set partitioning heuristic for the generalized assignment problem , 1994 .

[5]  Jonathan F. Bard,et al.  A GRASPTM for a difficult single machine scheduling problem, , 1991, Comput. Oper. Res..

[6]  Fred Glover,et al.  Probabilistic Move Selection in Tabu Search for Zero-One Mixed Integer Programming Problems , 1996 .

[7]  Jun Gu,et al.  Local search for satisfiability (SAT) problem , 1993, IEEE Trans. Syst. Man Cybern..

[8]  Rina Dechter,et al.  Network-based heuristics for constraint satisfaction problems , 1988 .

[9]  Charles Fleurent,et al.  Genetic and hybrid algorithms for graph coloring , 1996, Ann. Oper. Res..

[10]  Eugene C. Freuder.  A Sufficient Condition for Backtrack-Free Search , 1982, JACM.

[11]  Eugene C. Freuder.  Complexity of K-Tree Structured Constraint Satisfaction Problems , 1990, AAAI.

[12]  L. A. Lorena,et al.  A surrogate heuristic for set covering problems , 1994 .

[13]  Carlo Mannino,et al.  Solving hard set covering problems , 1995, Oper. Res. Lett..

[14]  John E. Beasley,et al.  A genetic algorithm for the generalised assignment problem , 1997, Comput. Oper. Res..

[15]  Manuel Laguna,et al.  A Greedy Randomized Adaptive Search Procedure for the Two-Partition Problem , 1994, Oper. Res..

[16]  J. Beasley.  An algorithm for set covering problem , 1987 .

[17]  Yahiko Kambayashi,et al.  Database Queries as Combinatorial Optimization Problems , 1996, CODAS.

[18]  D. R. Fulkerson,et al.  Two computationally difficult set covering problems that arise in computing the 1-width of incidence matrices of Steiner triple systems , 1974 .

[19]  Roberto Battiti,et al.  The Reactive Tabu Search , 1994, INFORMS J. Comput..

[20]  L. V. Wassenhove,et al.  A survey of algorithms for the generalized assignment problem , 1992 .

[21]  Hector J. Levesque,et al.  A New Method for Solving Hard Satisfiability Problems , 1992, AAAI.

[22]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[23]  A. Hertz.  Tabu search for large scale timetabling problems , 1991 .

[24]  Andrew C. Ho,et al.  Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study , 1980 .

[25]  Masazumi Yoshikawa,et al.  A Constraint-Based High School Scheduling System , 1996, IEEE Expert.

[26]  I H Osman,et al.  Meta-Heuristics Theory and Applications , 2011 .

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

[28]  Andrea Schaerf,et al.  REPORT RAPPORT , 2022 .

[29]  Davis Avis.  A note on some computationally difficult set covering problems , 1980, Math. Program..

[30]  Ibrahim H. Osman,et al.  Heuristics for the generalised assignment problem: simulated annealing and tabu search approaches , 1995 .