GA-easy and GA-hard Constraint Satisfaction Problems.
A. E. EibenPaul-Erik RauéZsófia RuttkayPublished in: Constraint Processing, Selected Papers (1995)
Keyphrases
- constraint satisfaction problems
- genetic algorithm ga
- genetic algorithm
- constraint satisfaction
- constraint programming
- fitness function
- search heuristics
- constraint propagation
- combinatorial problems
- genetic programming
- search space
- non binary
- arc consistency
- np complete
- optimization method
- graph coloring problems
- np hard
- constraint networks
- multi objective
- decomposition methods
- simulated annealing
- ant colony optimization
- evolutionary computation
- global constraints
- computational problems
- evolutionary algorithm
- soft constraints
- path consistency
- finite domain
- random instances