Heuristic Bounds and Test Problem Generation for the Time-Dependent Traveling Salesman Problem.
Russ J. Vander WielNikolaos V. SahinidisPublished in: Transp. Sci. (1995)
Keyphrases
- traveling salesman problem
- combinatorial optimization
- lin kernighan
- traveling salesman
- benchmark instances
- variable neighborhood search
- neighborhood search
- combinatorial optimization problems
- minimum spanning tree
- combinatorial problems
- ant colony optimization
- upper bound
- vehicle routing problem
- ant colony optimization algorithm
- optimization problems
- discrete particle swarm optimization
- satisfy the triangle inequality
- genetic local search
- path relinking
- lower and upper bounds
- crossover operator
- branch and bound
- metaheuristic
- dynamic programming
- valid inequalities
- search algorithm
- travel time
- simulated annealing
- exact algorithms
- quadratic assignment problem
- branch and bound algorithm
- hamiltonian cycle
- discrete optimization problems
- lower bound