A dynamic programming based local search approach for the double traveling salesman problem with multiple stacks.
Sebastián UrrutiaAnolan MilanésArne LøkketangenPublished in: Int. Trans. Oper. Res. (2015)
Keyphrases
- traveling salesman problem
- combinatorial optimization
- dynamic programming
- neighborhood search
- ant colony optimization
- optimization problems
- traveling salesman
- combinatorial problems
- genetic algorithm
- vehicle routing problem
- hamiltonian cycle
- metaheuristic
- simulated annealing
- lin kernighan
- combinatorial optimization problems
- search space
- ant colony optimization algorithm
- path relinking
- subtour elimination
- genetic local search
- quadratic assignment problem
- valid inequalities
- memetic algorithm
- crossover operator
- search procedure
- knapsack problem
- genetic algorithm ga