A General VNS heuristic for the traveling salesman problem with time windows.
Rodrigo Ferreira da SilvaSebastián UrrutiaPublished in: Discret. Optim. (2010)
Keyphrases
- traveling salesman problem
- variable neighborhood search
- combinatorial optimization
- neighborhood search
- vehicle routing problem
- benchmark instances
- traveling salesman
- ant colony optimization
- lin kernighan
- minimum spanning tree
- special case
- path relinking
- combinatorial problems
- optimization problems
- combinatorial optimization problems
- metaheuristic
- tabu search
- ant colony optimization algorithm
- crossover operator
- solution quality
- simulated annealing
- nature inspired
- hamiltonian cycle
- routing problem
- valid inequalities
- search algorithm
- satisfy the triangle inequality
- beam search