Loading...
Please wait, while we are loading the content...
Similar Documents
Minimizing conflicts: a heuristic repair method for constraint-satisfaction and scheduling problems
| Content Provider | NASA Technical Reports Server (NTRS) |
|---|---|
| Author | Johnston, Mark Philips, Andrew Laird, Phil Minton, Steve |
| Copyright Year | 1992 |
| Description | 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 most effective. |
| File Size | 2220389 |
| Page Count | 38 |
| File Format | |
| Alternate Webpage(s) | http://archive.org/details/NASA_NTRS_Archive_19930006097 |
| Archival Resource Key | ark:/13960/t2b905v19 |
| Language | English |
| Publisher Date | 1992-06-01 |
| Access Restriction | Open |
| Subject Keyword | Cybernetics Neural Nets Searching Heuristic Methods Hubble Space Telescope Problem Solving Scheduling Probability Distribution Functions Artificial Intelligence Optimization Ntrs Nasa Technical Reports Server (ntrs) Nasa Technical Reports Server Aerodynamics Aircraft Aerospace Engineering Aerospace Aeronautic Space Science |
| Content Type | Text |
| Resource Type | Technical Report |
