The min-conflicts heuristic: Experimental and theoretical results
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 through 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.
- Research Organization:
- National Aeronautics and Space Administration, Moffett Field, CA (United States). Ames Research Center
- OSTI ID:
- 7296997
- Report Number(s):
- N-92-25443; NASA-TM--107877; NASA-FIA--91-25; NAS--1.15:107877
- Country of Publication:
- United States
- Language:
- English
Similar Records
Search and heuristics
A constraint-based assignment system for automating long side chain assignments in protein 2D NMR spectra