An adaptation of the parliamentary metaheuristic for permutation constraint satisfaction.
Luis de MarcosAntonio García-CabotEva GarcíaJosé-Javier MartínezJosé Antonio Gutiérrez de MesaRoberto BarchinoJosé María GutiérrezJosé Ramón HileraSalvador OtónPublished in: IEEE Congress on Evolutionary Computation (2010)
Keyphrases
- constraint satisfaction
- metaheuristic
- constraint satisfaction problems
- search space
- tabu search
- simulated annealing
- optimization problems
- ant colony optimization
- combinatorial problems
- scatter search
- optimal solution
- search methods
- genetic algorithm
- combinatorial optimization
- heuristic search
- constraint programming
- constraint propagation
- path relinking
- iterated local search
- particle swarm optimization
- phase transition
- vehicle routing problem
- arc consistency
- hybrid metaheuristic
- soft constraints
- constraint relaxation
- metaheuristic algorithms
- set of benchmark instances
- variable neighborhood search
- benchmark instances
- lower bound
- sat solvers
- evolutionary algorithm
- greedy randomized adaptive search procedure
- cost function