A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem.
Özlem ErgunJames B. OrlinPublished in: Discret. Optim. (2006)
Keyphrases
- traveling salesman problem
- neighborhood search
- dynamic programming
- combinatorial optimization
- variable neighborhood search
- path relinking
- ant colony optimization
- vehicle routing problem
- optimization problems
- nature inspired
- combinatorial problems
- crossover operator
- ant colony optimization algorithm
- combinatorial optimization problems
- linear programming
- simulated annealing
- benchmark instances
- swarm intelligence