Variable neighborhood search and local branching.
Pierre HansenNenad MladenovicDragan UrosevicPublished in: Comput. Oper. Res. (2006)
Keyphrases
- variable neighborhood search
- metaheuristic
- traveling salesman problem
- tabu search
- neighborhood search
- routing problem
- heuristic methods
- minimum spanning tree
- hybrid method
- single machine scheduling problem
- benchmark instances
- vehicle routing problem
- branch and bound
- search procedure
- path relinking
- combinatorial optimization
- combinatorial optimization problems
- ant colony optimization
- dynamic programming
- scatter search
- graph theory
- genetic algorithm
- branch and bound algorithm
- optimization problems
- simulated annealing
- optimal solution