Sequential and Parallel Local Search for the Time-Constrained Traveling Salesman Problem.
Gerard A. P. KindervaterJan Karel LenstraMartin W. P. SavelsberghPublished in: Discret. Appl. Math. (1993)
Keyphrases
- traveling salesman problem
- combinatorial optimization
- neighborhood search
- lin kernighan
- ant colony optimization
- traveling salesman
- combinatorial problems
- combinatorial optimization problems
- vehicle routing problem
- aco algorithm
- hamiltonian cycle
- optimization problems
- metaheuristic
- memetic algorithm
- crossover operator
- simulated annealing
- ant colony optimization algorithm
- discrete optimization problems
- valid inequalities
- discrete particle swarm optimization
- path relinking
- genetic algorithm
- transportation networks
- branch and bound
- neural network
- branch and bound algorithm
- quadratic assignment problem
- tabu search
- variable neighborhood search
- job shop scheduling problem
- search space
- search algorithm