Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems
Artificial Intelligence - Special volume on constraint-based reasoning
Solution reuse in dynamic constraint satisfaction problems
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Stable Solutions for Dynamic Constraint Satisfaction Problems
CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
Journal of Artificial Intelligence Research
Combining local search and look-ahead for scheduling and constraint satisfaction problems
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
Combining local search and backtracking techniques for constraint satisfaction
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Hi-index | 0.00 |
Many hard practical problems such as Time Tabling and Scheduling can be formulated as Constraint Satisfaction Problems. For these CSPs, powerful problem-solving methods are available. However, in practice, the problem definition may change over time. Each separate change may invoke a new CSP formulation. The resulting sequence of CSPs is denoted as a Dynamic CSP. A valid solution of one CSP in the sequence need not be a solution of the next CSP. Hence it might be necessary to solve every CSP in the sequence forming a DCSP. Successive solutions of the sequence of CSPs can differ quite considerably. In practical environments large differences between successive solutions are often undesirable. To cope with this hindrance, the paper proposes a repair-based algorithm, i.e., a Local Search algorithm that systematically searches the neighborhood of an infringed solution to find a new nearby solution. The algorithm combines local search with constraint propagation to reduce its time complexity.