A new heuristic for the period traveling salesman problem.
I-Ming ChaoBruce L. GoldenEdward A. WasilPublished in: Comput. Oper. Res. (1995)
Keyphrases
- traveling salesman problem
- combinatorial optimization
- lin kernighan
- traveling salesman
- benchmark instances
- neighborhood search
- variable neighborhood search
- ant colony optimization
- optimization problems
- combinatorial optimization problems
- minimum spanning tree
- ant colony optimization algorithm
- simulated annealing
- combinatorial problems
- metaheuristic
- satisfy the triangle inequality
- optimal solution
- discrete optimization problems
- vehicle routing problem
- valid inequalities
- transportation networks
- dynamic programming
- discrete particle swarm optimization
- tabu search
- hamiltonian cycle
- path relinking
- exact algorithms
- genetic local search
- branch and bound
- constraint satisfaction
- search algorithm
- beam search
- job shop scheduling problem
- branch and bound algorithm
- constraint programming
- evolutionary algorithm
- subtour elimination
- objective function