Current Approaches for Solving Over-Constrained Problems

We summarize existing approaches to model and solve overconstrained problems. These problems are usually formulated as combinatorial optimization problems, and different specific and generic formalisms are discussed, including the special case of multi-objective optimization. Regarding solving methods, both systematic and local search approaches are considered. Finally we review a number of case studies on overconstrained problems taken from the specialized literature.

[1]  David Abramson,et al.  Constructing school timetables using simulated annealing: sequential and parallel algorithms , 1991 .

[2]  Andrea Schaerf,et al.  REPORT RAPPORT , 2022 .

[3]  Vipin Kumar,et al.  Algorithms for Constraint-Satisfaction Problems: A Survey , 1992, AI Mag..

[4]  Jeffrey Horn,et al.  Multiobjective Optimization Using the Niched Pareto Genetic Algorithm , 1993 .

[5]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[6]  Eugene C. Freuder,et al.  Heuristic Methods for Over-Constrained Constraint Satisfaction Problems , 1995, Over-Constrained Systems.

[7]  Thomas Schiex,et al.  Maintaining Reversible DAC for Max-CSP , 1999, Artif. Intell..

[8]  John Tartar,et al.  Graph coloring conditions for the existence of solutions to the timetable problem , 1974, CACM.

[9]  E. Tsang.  A Family of Stochastic Methods For Constraint Satisfaction and Optimisation , 2001 .

[10]  Javier Larrosa,et al.  Partition-Based Lower Bound for Max-CSP , 1999, CP.

[11]  R. Rosenthal.  Concepts, Theory, and Techniques PRINCIPLES OF MULTIOBJECTIVE OPTIMIZATION* , 1985 .

[12]  E. L. Ulungu,et al.  MOSA method: a tool for solving multiobjective combinatorial optimization problems , 1999 .

[13]  Thomas Schiex,et al.  Valued Constraint Satisfaction Problems: Hard and Easy Problems , 1995, IJCAI.

[14]  Jacques Teghem,et al.  Efficiency of interactive multi-objective simulated annealing through a case study , 1998, J. Oper. Res. Soc..

[15]  R. Alvarez-Valdes,et al.  Constructing Good Solutions for the Spanish School Timetabling Problem , 1996 .

[16]  D. Costa,et al.  A tabu search algorithm for computing an operational timetable , 1994 .

[17]  Steven Minton,et al.  Minimizing Conflicts: A Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems , 1992, Artif. Intell..

[18]  Gérard Verfaillie,et al.  Earth Observation Satellite Management , 1999, Constraints.

[19]  Michel Lema,et al.  Daily Management of an Earth Observation Satellite : Comparison of Ilog Solver with Dedicated Algorithms for Valued Constraint Satisfaction Problems , .

[20]  Ashok D. Belegundu,et al.  Multi-objective optimization of laminated ceramic composites using genetic algorithms , 1994 .

[21]  Steven Minton,et al.  Solving Large-Scale Constraint-Satisfaction and Scheduling Problems Using a Heuristic Repair Method , 1990, AAAI.

[22]  Hoong Chuin LAU.  A New Approach for Weighted Constraint Satisfaction: Theoretical and Computational Results , 1996, CP.

[23]  Alberto Colorni,et al.  A genetic algorithm to solve the timetable problem , 1992 .

[24]  Andrea Schaerf,et al.  A Survey of Automated Timetabling , 1999, Artificial Intelligence Review.

[25]  A. E. Eiben,et al.  Solving constraint satisfaction problems using genetic algorithms , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[26]  Christian Bessiere,et al.  An Original Constraint Based Approach for Solving over Constrained Problems , 2000, CP.

[27]  Robert M. Haralick,et al.  Increasing Tree Search Efficiency for Constraint Satisfaction Problems , 1979, Artif. Intell..

[28]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[29]  Eugene C. Freuder,et al.  Stable Solutions for Dynamic Constraint Satisfaction Problems , 1998, CP.

[30]  Alan Borning,et al.  Hierarchical Constraint Logic Programming , 1994, J. Log. Program..

[31]  Simon de Givry,et al.  Bounding the Optimum of Constraint Optimization Problems , 1997, CP.

[32]  Helene Fargier.  Problèmes de satisfaction de contraintes flexibles. Application à l'ordonnancement de production , 1994 .

[33]  Eugene C. Freuder,et al.  Conjunctive Width Heuristics for Maximal Constraint Satisfaction , 1993, AAAI.

[34]  Andrew J. Davenport,et al.  GENET: A Connectionist Architecture for Solving Constraint Satisfaction Problems by Iterative Improvement , 1994, AAAI.

[35]  Alan Borning,et al.  Constraint hierarchies , 1992 .

[36]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[37]  John E. Beasley,et al.  A genetic algorithm for the generalised assignment problem , 1997, Comput. Oper. Res..

[38]  Makoto Yokoo,et al.  Weak-Commitment Search for Solving Constraint Satisfaction Problems , 1994, AAAI.

[39]  Thomas Schiex,et al.  Solution Reuse in Dynamic Constraint Satisfaction Problems , 1994, AAAI.

[40]  Abdollah Homaifar,et al.  Constrained Optimization Via Genetic Algorithms , 1994, Simul..

[41]  Kalyanmoy Deb,et al.  Muiltiobjective Optimization Using Nondominated Sorting in Genetic Algorithms , 1994, Evolutionary Computation.

[42]  Jérôme Lang,et al.  Uncertainty in Constraint Satisfaction Problems: a Probalistic Approach , 1993, ECSQARU.

[43]  Eugene C. Freuder,et al.  Partial Constraint Satisfaction , 1989, IJCAI.

[44]  Thomas Schiex,et al.  Russian Doll Search for Solving Constraint Optimization Problems , 1996, AAAI/IAAI, Vol. 1.

[45]  Gérard Verfaillie,et al.  Using Mean Field Methods for Boosting Backtrack Search in Constraint Satisfaction Problems , 1996, ECAI.

[46]  Richard J. Wallace,et al.  Directed Arc Consistency Preprocessing , 1995, Constraint Processing, Selected Papers.

[47]  Richard J. Wallace,et al.  Enhancements of Branch and Bound Methods for the Maximal Constraint Satisfaction Problem , 1996, AAAI/IAAI, Vol. 1.

[48]  Masazumi Yoshikawa,et al.  A Constraint-Based High School Scheduling System , 1996, IEEE Expert.

[49]  Ian C. Parmee,et al.  Adaptive Computing in Design and Manufacture: The Integration of Evolutionary and Adaptive Computing Technologies with Product/System Design and Reali , 1998 .

[50]  Richard E. Rosenthal,et al.  Principles of multiobjective optimization , 1984 .

[51]  Hachemi Bennaceur,et al.  A Weighted Arc Consistency Technique for MAX-CSP , 1998, ECAI.

[52]  Simon de Givry,et al.  Radio Link Frequency Assignment , 1999, Constraints.

[53]  Yinghao Li.  Directed annealing search in constraint satisfaction and optimization , 1997 .

[54]  Paul Morris,et al.  The Breakout Method for Escaping from Local Minima , 1993, AAAI.

[55]  Javier Larrosa,et al.  Exploiting the Use of DAC in MAX-CSP , 1996, CP.

[56]  Thomas Schiex,et al.  Semiring-Based CSPs and Valued CSPs: Frameworks, Properties, and Comparison , 1999, Constraints.

[57]  Arie M. C. A. Koster,et al.  Optimal Solutions for Frequency Assignment Problems via Tree Decomposition , 1999, WG.

[58]  Francesca Rossi,et al.  Constraint Solving over Semirings , 1995, IJCAI.

[59]  Edward P. K. Tsang,et al.  Foundations of constraint satisfaction , 1993, Computation in cognitive science.

[60]  George M. White,et al.  A logic approach to the resolution of constraints in timetabling , 1992 .

[61]  Javier Larrosa,et al.  Boosting Search with Variable Elimination , 2000, CP.

[62]  Simon de Givry,et al.  Anytime Lower Bounds for Constraint Violation Minimization Problems , 1998, CP.

[63]  Didier Dubois,et al.  Possibility theory in constraint satisfaction problems: Handling priority, preference and uncertainty , 1996, Applied Intelligence.

[64]  Tao Wang,et al.  Simulated Annealing with Asymptotic Convergence for Nonlinear Constrained Global Optimization , 1999, CP.