An Improved Tabu Search Method For The Weighted Constraint Satisfaction Problem

Abstract Aiming at developing a general problem solver for combinatorial optimization problems, we consider in this paper the weighted constraint satisfaction problem (WCSP), which, given a number of constraints and their weights of importance, asks to minimize the total weight of unsatisfied constraints. We propose a tabu search algorithm for WCSP with the features that it uses an evaluation function, defined in terms of the modified weights of constraints, for guiding the search, and that it incorporates an automatic control mechanism of the weights in the evaluation function. Using this code, we solved a number of problems including those from real applications such as generalized assignment, set covering, parallel shop scheduling, timetabling and nurse scheduling. Many problems that arise in cellular manufacturing can also be formulated as WCSP, including the problems of cell formation and tool selection. Our computational results indicate that the control mechanism of weights makes our tabu search more powerful, and our algorithm is practically usable.

[1]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[2]  Anthony V. Fiacco,et al.  Nonlinear programming;: Sequential unconstrained minimization techniques , 1968 .

[3]  M. J. D. Powell,et al.  Nonlinear Programming—Sequential Unconstrained Minimization Techniques , 1969 .

[4]  Philip Wolfe,et al.  Validation of subgradient optimization , 1974, Math. Program..

[5]  Miss A.O. Penney.  (b) , 1974, The New Yale Book of Quotations.

[6]  Bjørn N. Freeman-Benson,et al.  Constraint hierarchies , 1987, OOPSLA '87.

[7]  Richard J. Wallace,et al.  Partial Constraint Satisfaction , 1989, IJCAI.

[8]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[9]  J. Dongarra.  Performance of various computers using standard linear equations software , 1990, CARN.

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

[11]  Steven Minton,et al.  Solving Large-Scale Constraint-Satisfaction and Scheduling Problems Using a Heuristic Repair Method , 1990, AAAI.

[12]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem , 1991 .

[13]  Bart Selman,et al.  Domain-Independent Extensions to GSAT : Solving Large StructuredSatis ability , 1993 .

[14]  Paul Morris,et al.  The Breakout Method for Escaping from Local Minima , 1993, AAAI.

[15]  Eugene C. Freuder,et al.  Heuristic Methods for Over-Constrained Constraint Satisfaction Problems , 1995, Over-Constrained Systems.

[16]  J. P. Kelly,et al.  Tabu search for the multilevel generalized assignment problem , 1995 .

[17]  Thomas Schiex,et al.  Semiring-Based CSPs and Valued CSPs: Basic Properties and Comparison , 1995, Over-Constrained Systems.

[18]  Jin-Kao Hao,et al.  Empirical Studies of Heuristic Local Search for Constraint Solving , 1996, CP.

[19]  Richard J. Wallace,et al.  Analysis of Heuristic Methods for Partial Constraint Satisfaction Problems , 1996, CP.

[20]  Egon Balas,et al.  A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering , 1992, Oper. Res..

[21]  Hoong Chuin LAU.  A New Approach for Weighted Constraint Satisfaction: Theoretical and Computational Results , 1996, CP.

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

[23]  K. Al-Sultan,et al.  A Genetic Algorithm for the Set Covering Problem , 1996 .

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

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

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

[27]  H. R. Lourenço,et al.  Adaptive Approach Heuristics for The Generalized Assignment Problem , 1998 .

[28]  John E. Beasley,et al.  Constraint Handling in Genetic Algorithms: The Set Partitioning Problem , 1998, J. Heuristics.

[29]  Simon de Givry,et al.  Anytime Lower Bounds for Constraint Violation Minimization Problems , 1998, CP.

[30]  David Sinriech,et al.  Process selection and tool assignment in automated cellular manufacturing using Genetic Algorithms , 1998, Ann. Oper. Res..

[31]  Rakesh Nagi,et al.  An integrated formulation of manufacturing cell formation with capacity planning and multiple routings , 1998, Ann. Oper. Res..

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

[33]  京都大学大学院情報学研究科.  Graduate School of Informatics, Kyoto University , 1999 .

[34]  Matteo Fischetti,et al.  A Heuristic Method for the Set Covering Problem , 1999, Oper. Res..