Hybrid evolutionary algorithms for constraint satisfaction problems: memetic overkill?
Bart G. W. CraenenA. E. EibenPublished in: Congress on Evolutionary Computation (2005)
Keyphrases
- constraint satisfaction problems
- hybrid evolutionary algorithms
- constraint satisfaction
- particle swarm optimization
- differential evolution
- np complete
- constraint propagation
- search space
- combinatorial problems
- non binary
- constraint programming
- constraint solving
- memetic algorithm
- np hard
- computational problems
- sat problem
- constraint networks
- arc consistency
- soft constraints
- lower bound
- constraint problems
- decomposition methods
- global constraints
- phase transition
- branch and bound algorithm
- simulated annealing
- forward checking
- backtracking algorithm
- constraint optimization
- optimisation problems
- reasoning problems
- finite domain
- backtracking search
- partial constraint satisfaction
- metaheuristic