An improved heuristic for the period traveling salesman problem.
Luca BertazziGiuseppe PalettaMaria Grazia SperanzaPublished in: Comput. Oper. Res. (2004)
Keyphrases
- traveling salesman problem
- combinatorial optimization
- lin kernighan
- traveling salesman
- benchmark instances
- variable neighborhood search
- neighborhood search
- optimization problems
- ant colony optimization
- minimum spanning tree
- combinatorial problems
- simulated annealing
- combinatorial optimization problems
- satisfy the triangle inequality
- ant colony optimization algorithm
- transportation networks
- discrete particle swarm optimization
- discrete optimization problems
- hamiltonian cycle
- path relinking
- valid inequalities
- genetic local search
- exact algorithms
- vehicle routing problem
- branch and bound algorithm
- metaheuristic
- dynamic programming
- evolutionary algorithm
- search algorithm
- global optimization
- branch and bound
- optimal solution
- genetic algorithm
- quadratic assignment problem
- discrete optimization
- solution quality
- cost function