DMCA
Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems (1992)
Cached
Download Links
- [jmvidal.cse.sc.edu]
- [centaurus.cs.umass.edu]
- [www.isi.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | ARTIF. INTELL |
| Citations: | 457 - 6 self |
BibTeX
@ARTICLE{Minton92minimizingconflicts:,
author = {Steven Minton and Mark D. Johnston and Andrew B. Philips and Philip Laird},
title = {Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems},
journal = {ARTIF. INTELL},
year = {1992},
pages = {161--205}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
This paper describes a simple heuristic approach to solving large-scale constraint satisfaction and scheduling problems. In this approach one starts with an inconsistent assignment for a set of variables and searches through the space of possible repairs. The search can be guided by a value-ordering heuristic, the min-conflicts heuristic, that attempts to minimize the number of constraint violations after each step. The heuristic can be used with a variety of different search strategies. We demonstrate empirically that on the n-queens problem, a technique based on this approach performs orders of magnitude better than traditional backtracking techniques. We also describe a scheduling application where the approach has been used successfully. A theoretical analysis is presented both to explain why this method works well on certain types of problems and to predict when it is likely to be One of the most promising general approaches for solving combinatorial search problems is to generate an
Keyphrases
scheduling problem constraint satisfaction heuristic repair method inconsistent assignment scheduling application certain type simple heuristic approach different search strategy possible repair value-ordering heuristic traditional backtracking technique combinatorial search problem n-queens problem large-scale constraint satisfaction constraint violation theoretical analysis promising general approach
