Generalized multiple depot traveling salesmen problem - Polyhedral study and exact algorithm.
Kaarthik SundarSivakumar RathinamPublished in: Comput. Oper. Res. (2016)
Keyphrases
- learning algorithm
- times faster
- dynamic programming
- simulated annealing
- simulation study
- improved algorithm
- computational complexity
- k means
- convergence rate
- classification algorithm
- input data
- experimental study
- detection algorithm
- benchmark problems
- optimal solution
- brute force
- dual space
- segmentation algorithm
- computational cost
- experimental evaluation
- cost function
- significant improvement
- search space
- optimization algorithm
- computationally efficient
- clustering method
- particle swarm optimization
- tree structure
- high accuracy
- worst case
- preprocessing