Solving Large-Scale Constraint-Satisfaction and Scheduling Problems Using a Heuristic Repair Method

This paper describes a simple heuristic method for solving large-scale constraint satisfaction and scheduling problems. Given an initial assignment for the variables in a problem, the method operates by searching though the space of possible repairs. The search is guided by an ordering heuristic, the min-conflicts heuristic, that attempts to minimize the number of constraint violations after each step. We demonstrate empirically that the method performs orders of magnitude better than traditional backtracking techniques on certain standard problems. For example, the one million queens problem can be solved rapidly using our approach. We also describe practical scheduling applications where the method has been successfully applied. A theoretical analysis is presented to explain why the method works so well on certain types of problems and to predict when it is likely to be most effective.

[1]  Gerald Jay Sussman,et al.  A Computer Model of Skill Acquisition , 1975 .

[2]  Edward M. Reingold,et al.  Backtrack programming techniques , 1975, CACM.

[3]  Alan K. Mackworth.  Consistency in Networks of Relations , 1977, Artif. Intell..

[4]  Daniel Brélaz,et al.  New methods to color the vertices of a graph , 1979, CACM.

[5]  Robert M. Haralick,et al.  Increasing Tree Search Efficiency for Constraint Satisfaction Problems , 1979, Artif. Intell..

[6]  J J Hopfield,et al.  Neural networks and physical systems with emergent collective computational abilities. , 1982, Proceedings of the National Academy of Sciences of the United States of America.

[7]  Mihalis Yannakakis,et al.  How easy is local search? , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[8]  Janice M. Stone,et al.  Efficient Search Techniques - An Empirical Study of the N-Queens Problem , 1987, IBM J. Res. Dev..

[9]  Rina Dechter,et al.  Network-Based Heuristics for Constraint-Satisfaction Problems , 1987, Artif. Intell..

[10]  Jonathan S. Turner,et al.  Almost All k-Colorable Graphs are Easy to Color , 1988, J. Algorithms.

[11]  Reid G. Simmons,et al.  A Theory of Debugging Plans and Interpretations , 1988, AAAI.

[12]  M. Johnston.  Automated telescope scheduling , 1988 .

[13]  Stephen F. Smith,et al.  Generating Space Telescope Observation Schedules , 1989 .

[14]  Norman M. Sadeh,et al.  Constrained Heuristic Search , 1989, IJCAI.

[15]  Mark D. Johnston,et al.  Learning in stochastic neural networks for constraint satisfaction problems , 1989 .

[16]  M M Waldrop,et al.  Will the hubble space telescope compute? , 1989, Science.

[17]  Monte Zweben,et al.  Constraint Satisfaction with Delayed Evaluation , 1989, IJCAI.

[18]  Moti Yung,et al.  Divide and Conquer under Global Constraints: A Solution to the N-Queens Problem , 1989, J. Parallel Distributed Comput..

[19]  Craig A. Knoblock.  Learning Hierarchies of Abstraction Spaces , 1989, ML.

[20]  David Y. Y. Yun,et al.  A Planning/Scheduling Methodology for the Constrained Resource Problem , 1989, IJCAI.

[21]  Mark D. Johnston,et al.  A discrete stochastic neural network algorithm for constraint satisfaction problems , 1990, 1990 IJCNN International Joint Conference on Neural Networks.

[22]  Steven Minton,et al.  Quantitative Results Concerning the Utility of Explanation-based Learning , 1988, Artif. Intell..

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

[24]  Steven Minton,et al.  The min-conflicts heuristic: Experimental and theoretical results , 1991 .