Abstract:
We are interested in de��ning 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. In this context knowledge about properties of the constraint network has allowed us to de��ne a ��tness function, and two operators arc-crossover and arc-mutation. We introduce here a new operator called Self-Adap-arc which uses the idea of self adaptivity and looks at the constraint network during the evolution. This operator is used to improve the stochastic search.
Citations
|
1329
|
Genetic Algorithms + Data Structures = Evolution Programs, 3rd edition, 387 pp
– Michalewicz
- 1996
|
|
474
|
Where the really hard problem are
– Cheeseman, Kanefsky, et al.
- 1991
|
|
302
|
Algorithms for constraints satisfaction problems: A survey
– Kumar
- 1992
|
|
240
|
Enhancement schemes for constraint processing: backjumping, learning, and cutset decomposition
– Dechter
- 1990
|
|
217
|
A sufficient condition for backtrack-free search
– Freuder
- 1982
|
|
24
|
Solving Constraint Satisfaction Problems Using A Genetic/Systematic Search Hybrid That Realizes When to Quit
– Bowen, Dozier
- 1995
|
|
16
|
Solving Small and Large Scale Constraint Satisfaction Problems Using a Heuristic-Based Microgenetic Algorithm
– Dozier, Bowen, et al.
- 1994
|
|
10
|
Applying Genetic Algorithms to Constraint Satisfaction Optimization Problems
– Tsang
- 1990
|
|
6
|
The many paths to satisfaction
– Freuder
- 1995
|
|
3
|
A labelling arc consistency method for functional constraints
– Aane, Bennaceur
- 1996
|
|
3
|
Ruttkay Zs. Solving constraint satisfaction problems using genetic algorithms
– Eiben, Raua
- 1994
|
|
3
|
Minimizing conAEicts: a heuristic repair method for constraint satisfaction and scheduling problems
– Minton, Philips
- 1992
|
|
2
|
Increasing tree search eOEciency for Constraint Satisfaction Problems
– Haralick, Elliott
- 1980
|
|
2
|
From Quasi-solutions to Solution: An Evolutionary Algorithm to Solve
– Rioe
- 1996
|
|
2
|
Using the knowledge of the Constraints Network to design an evolutionary algorithm that solves CSP
– Rioe
- 1996
|
|
1
|
Ruttkay Zs, GA-easy and GA-hard Constraint Satisfaction Problems
– Eiben, Rau
- 1995
|
|
1
|
Ruttkay Zs, Self-adaptivity for Constraint Satisfaction: Learning Penalty Functions
– Eiben, Rau
- 1996
|
|
1
|
Evolutionary Search guided by the Constraint Network to solve CSP
– Rioe
- 1997
|
|
