Evolutionary algorithms for constraint satisfaction problems

The author is interested in defining a general evolutionary algorithm to solve constraint satisfaction problems, which takes into account both advantages of the systematic and traditional methods and of characteristics of the CSP. She presents evolutionary algorithms to solve constraint satisfaction problems (CSP).

[1]  Steven Minton,et al.  Integrating Heuristics for Constraint Satisfaction Problems: A Case Study , 1993, AAAI.

[2]  Eugene C. Freuder.  A Sufficient Condition for Backtrack-Free Search , 1982, JACM.

[3]  Hachemi Bennaceur,et al.  A Labelling Arc Consistency Method for Functional Constraints , 1996, CP.

[4]  M. Rojas,et al.  Using the knowledge of the constraints network to design an evolutionary algorithm that solves CSP , 1996 .

[5]  Mark D. Johnston,et al.  A discrete stochastic neural network algorithm for constraint satisfaction problems , 1990, 1990 IJCNN International Joint Conference on Neural Networks.

[6]  Charles Fleurent,et al.  Genetic and hybrid algorithms for graph coloring , 1996, Ann. Oper. Res..

[7]  A. E. Eiben,et al.  Self-adaptivity for constraint satisfaction: learning penalty functions , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[8]  James Bowen,et al.  Solving Constraint Satisfaction Problems Using a Genetic/Systematic Search Hybrid That Realizes When to Quit , 1995, ICGA.

[9]  María Cristina Riff.  From Quasi-Solutions to Solution: An Evolutionary Algorithm to Solve CSP , 1996, CP.

[10]  Eugene C. Freuder.  The Many Paths to Satisfaction , 1995, Constraint Processing, Selected Papers.

[11]  M. Rojas,et al.  From quasi-solutions to solution: an evolutionary algorithm to solve CSP , 1996 .

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

[13]  Peter C. Cheeseman,et al.  Where the Really Hard Problems Are , 1991, IJCAI.

[14]  A. E. Eiben,et al.  GA-easy and GA-hard Constraint Satisfaction Problems , 1995, Constraint Processing, Selected Papers.

[15]  James Bowen,et al.  Solving small and large scale constraint satisfaction problems using a heuristic-based microgenetic algorithm , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

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

[17]  Rina Dechter,et al.  Enhancement Schemes for Constraint Processing: Backjumping, Learning, and Cutset Decomposition , 1990, Artif. Intell..

[18]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1992, Artificial Intelligence.

[19]  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.

[20]  Charles J. Petrie,et al.  On the Equivalence of Constraint Satisfaction Problems , 1990, ECAI.

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

[22]  M.C. Riff-Rojas,et al.  Evolutionary search guided by the constraint network to solve CSP , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[23]  Edward P. K. Tsang,et al.  Using a genetic algorithm to tackle the processors configuration problem , 1994, SAC '94.

[24]  Edward P. K. Tsang,et al.  Applying Genetic Algorithms to Constraint Satisfaction Optimization Problems , 1990, ECAI.