## Minimizing Conflicts: A Heuristic Repair Method for Constraint-Satisfaction and Scheduling Problems (1993)

Venue: | J. ARTIFICIAL INTELLIGENCE RESEARCH |

Citations: | 397 - 6 self |

### BibTeX

@ARTICLE{Minton93minimizingconflicts:,

author = {Steven Minton and Andy Philips and Mark D. Johnston and Philip Laird},

title = {Minimizing Conflicts: A Heuristic Repair Method for Constraint-Satisfaction and Scheduling Problems},

journal = {J. ARTIFICIAL INTELLIGENCE RESEARCH},

year = {1993},

volume = {58},

pages = {161--205}

}

### Years of Citing Articles

### 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 most effective.

### Citations

1572 | Neural networks and physical systems with emergent collective computational abilities - Hopfield |

680 | A New Method for Solving Hard Satisfiability Problems - Selman, Levesque, et al. - 1992 |

577 | Where the really hard problems are - Cheeseman, Kanefsky, et al. - 1991 |

509 | Optimization by simulated annealing: an experimental evaluation; part 1, graph partitioning - Johnson, Aragon, et al. - 1989 |

457 | G.: Increasing tree-search efficiency for constraint satisfaction problems - Haralick, Elliot - 1980 |

422 | R.J.: Partial constraint satisfaction - Freuder, Wallace - 1992 |

388 | Network-based heuristics for constraint satisfaction problems - R, Pearl - 1988 |

350 | New methods to color the vertices of a graph - BrÃ©laz - 1979 |

232 |
A computer Model of Skill Acquisition
- Sussman
- 1975
(Show Context)
Citation Context ...lems (Johnson, Papadimitrou, & Yannakakis, 1988). Such techniques also have a long tradition in AI, most notably in problem-solving systems that operate by debugging initial solutions (Simmons, 1988; =-=Sussman, 1975). In this-=- paper, we describe how this idea can be extended to constraint satisfaction problems (CSPs) in a natural manner. Most of the previous work on CSP algorithms has assumed a "constructive" bac... |

195 | How easy is local search - Johnson, Papadimitriou, et al. - 1988 |

159 | Constraint-directed search: A case study of job-shop scheduling - Fox - 1983 |

131 | Using tabu search techniques for graph coloring - Hertz, deWerra - 1987 |

117 | Reingold, Backtrack programming techniques - Bitner, M - 1975 |

111 | Algorithmic: theory and practice - Brassard, Bratley - 1988 |

66 | Iterative broadening - Ginsberg, Harvey - 1992 |

66 |
Systematic and non-systematic search strategies
- Langley
- 1992
(Show Context)
Citation Context ...with the average distance between solutions. Consequently depth-first search performs relatively poorly in a tree where the solutions are clustered, such as that on the left (Ginsberg & Harvey, 1990; =-=Langley, 1992-=-). In comparison, a search strategy which examines the leaves of the tree in random order is unaffected by solution clustering. We investigated whether this phenomenon explained the relatively poor pe... |

66 | Almost all k-colorable graphs are easy to color - Turner - 1988 |

56 | Case-based planning: An integrated theory of planning, learning and memory. Department of computer science technical report - Hammond - 1986 |

55 |
A Theory of Debugging Plans and Interpretations
- Simmons
- 1988
(Show Context)
Citation Context ...rtitioning problems (Johnson, Papadimitrou, & Yannakakis, 1988). Such techniques also have a long tradition in AI, most notably in problem-solving systems that operate by debugging initial solutions (=-=Simmons, 1988; Sus-=-sman, 1975). In this paper, we describe how this idea can be extended to constraint satisfaction problems (CSPs) in a natural manner. Most of the previous work on CSP algorithms has assumed a "co... |

54 | Constrained heuristic search - Fox, Sadeh, et al. - 1989 |

45 | A process model of case-based reasoning in problem solving - Kolodner, Simpson, et al. - 1985 |

43 | A discrete stochastic neural network algorithm for constraint satisfaction problems - Adorf, Johnston - 1990 |

32 |
Efficient Search Techniques: An Empirical Study of the N-Queens Problem
- Stone, Stone
- 1986
(Show Context)
Citation Context ...ow, column or diagonal. The network has been used to solve problems of up to 1024 queens, whereas most heuristic backtracking methods encounter difficulties with problems one-tenth that size (Stone & =-=Stone, 1987-=-). The GDS network is a modified Hopfield network (Hopfield, 1982). In a standard Hopfield network, all connections between neurons are symmetric. In the GDS network, the main network is coupled asymm... |

32 | A polynomial time algorithm for the n-queens problem - Sosic, Gu - 1990 |

28 | Anytime Rescheduling - Zweben, Deal, et al. - 1990 |

26 |
Solving Large Scale Constraint Satisfaction and Scheduling Problems Using a Heuristic Repair Method
- Minton, Johnson, et al.
- 1990
(Show Context)
Citation Context ...ider a theoretical model identifying general problem characteristics that influence the performance of the method. We include a second gratuitous citation to ourselves to illustrate a short citation (=-=Minton et al., 1990-=-). 2. Previous Work: The GDS Network By almost any measure, the Hubble Space Telescope scheduling problem is a complex task (Johnston, 1987; Waldrop, 1989). Between ten thousand and thirty thousand as... |

18 | Bottleneck Identification Using Process Chronologies - Biefeld, Cooper - 1991 |

16 | Learning search control for constraint-based scheduling - Eskey, Zweben - 1990 |

15 | An almost perfect heuristic for the n nonattacking queens problem - Kale - 1990 |

13 | Divide and conquer under global constraints: A solution to the n-queens problem - Abramson, Yung - 1989 |

12 | Partial match and search control via internal analogy - Hickman, Lovett - 1991 |

12 | On the density of solutions in equilibrium points for the queens problem - Morris - 1992 |

11 | How long it will take - Musick, Russell - 1992 |

11 | Towards scaling up machine learning: A case study with derivational analogy in prodigy - Veloso, Carbonell - 1993 |

10 | A Planning/Scheduling Methodology for the Constrained Resource Problem - Keng, Yun - 1989 |

8 | A Framework for Iterative Improvement Search Algorithms Suited for Constraint Satisfaction Problems - Zweben - 1990 |

7 | Learning in stochastic neural networks for constraint satisfaction problems - Johnston, Adorf - 1989 |

6 | Knowledge-Based Telescope Scheduling
- Johnston
- 1989
(Show Context)
Citation Context ...s citation to ourselves to illustrate a short citation (Minton et al., 1990). 2. Previous Work: The GDS Network By almost any measure, the Hubble Space Telescope scheduling problem is a complex task (=-=Johnston, 1987-=-; Waldrop, 1989). Between ten thousand and thirty thousand astronomical observations per year must be scheduled, subject to a great variety of constraints including power restrictions, observation pri... |

6 | Solutions without exhaustive search: An iterative descent method for binary constraint satisfaction problems - Morris - 1990 |

6 | Generating Space Telescope Observation Schedules - Muscettola, Smith, et al. - 1989 |

3 | Supporting flexible plan reuse - Kambhampati - 1992 |

3 | The Mfive space station crew activity scheduler and stowage logistics clerk - Kurtzman, Aiken - 1989 |

3 | An iterative improvement algorithm with guaranteed convergence - Morris - 1991 |

3 | the Hubble space telescope compute - Will - 1989 |

2 | Time and Resource Constrained Scheduling, with Applications to Space Station Planning - Kurtzman - 1988 |

1 | Neural networks and physical systems with emergent collective computational abilities - Minton, Johnston - 1982 |