A branch-and-cut algorithm for the generalized traveling salesman problem with time windows.
Yuan YuanDiego CattaruzzaMaxime OgierFrédéric SemetPublished in: Eur. J. Oper. Res. (2020)
Keyphrases
- traveling salesman problem
- combinatorial optimization
- hamiltonian cycle
- cost function
- ant colony optimization
- computational complexity
- minimum spanning tree
- np hard
- optimization problems
- genetic local search
- objective function
- ant colony optimization algorithm
- benchmark problems
- dynamic programming
- convex hull
- markov decision processes
- particle swarm optimization
- vehicle routing problem
- simulated annealing
- evolutionary algorithm
- traveling salesman
- discrete particle swarm optimization
- subtour elimination
- optimal solution