A Set Covering Approach for the Double Traveling Salesman Problem with Multiple Stacks.
Michele BarbatoRoland GrappeMathieu LacroixRoberto Wolfler CalvoPublished in: ISCO (2016)
Keyphrases
- traveling salesman problem
- set covering
- combinatorial optimization
- ant colony optimization
- combinatorial problems
- traveling salesman
- vehicle routing problem
- combinatorial optimization problems
- set covering problem
- optimization problems
- discrete particle swarm optimization
- neural network
- hamiltonian cycle
- discrete optimization problems
- genetic local search
- integer programming