A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows.
Jeffrey W. OhlmannBarrett W. ThomasPublished in: INFORMS J. Comput. (2007)
Keyphrases
- traveling salesman problem
- combinatorial optimization
- simulated annealing
- lin kernighan
- traveling salesman
- benchmark instances
- neighborhood search
- variable neighborhood search
- vehicle routing problem
- minimum spanning tree
- metaheuristic
- ant colony optimization
- combinatorial optimization problems
- combinatorial problems
- tabu search
- optimization problems
- ant colony optimization algorithm
- path relinking
- satisfy the triangle inequality
- hamiltonian cycle
- transportation networks
- search procedure
- discrete optimization problems
- crossover operator
- solution quality
- valid inequalities
- mixed integer programming
- discrete particle swarm optimization
- genetic algorithm
- dynamic programming
- genetic local search
- job shop scheduling problem
- quadratic assignment problem
- exact algorithms
- branch and bound algorithm
- search strategies
- evolutionary algorithm