A New Heuristic for the Traveling Salesman Problem with Time Windows.
Roberto Wolfler CalvoPublished in: Transp. Sci. (2000)
Keyphrases
- traveling salesman problem
- combinatorial optimization
- lin kernighan
- traveling salesman
- benchmark instances
- neighborhood search
- variable neighborhood search
- vehicle routing problem
- combinatorial problems
- minimum spanning tree
- ant colony optimization
- optimization problems
- satisfy the triangle inequality
- combinatorial optimization problems
- simulated annealing
- path relinking
- hamiltonian cycle
- exact algorithms
- ant colony optimization algorithm
- solution quality
- discrete particle swarm optimization
- test instances
- genetic local search
- neural network
- crossover operator
- optimal solution
- transportation networks
- evolutionary algorithm
- multi objective
- metaheuristic
- genetic algorithm
- subtour elimination
- search algorithm
- discrete optimization problems
- nearest neighbor
- heuristic methods
- tabu search
- branch and bound
- branch and bound algorithm
- valid inequalities
- search procedure
- routing problem