A comparison of neighborhood search techniques for multi-objective combinatorial problems.
Richard MarettMike WrightPublished in: Comput. Oper. Res. (1996)
Keyphrases
- combinatorial problems
- neighborhood search
- traveling salesman problem
- multi objective
- metaheuristic
- combinatorial optimization
- constraint programming
- variable neighborhood search
- simulated annealing
- evolutionary algorithm
- optimization problems
- nature inspired
- genetic algorithm
- multi objective optimization
- constraint satisfaction
- path relinking
- ant colony optimization
- optimization algorithm
- ant colony optimization algorithm
- tabu search
- constraint satisfaction problems
- objective function
- phase transition
- particle swarm optimization
- nsga ii
- multiobjective optimization
- multiple objectives
- exact algorithms
- vehicle routing problem
- branch and bound algorithm
- cellular automata
- constraint propagation
- sat problem
- graph search
- scatter search
- knapsack problem