An approximation algorithm for the clustered path travelling salesman problem.
Jiaxuan ZhangSuogang GaoBo HouWen LiuPublished in: J. Comb. Optim. (2023)
Keyphrases
- learning algorithm
- detection algorithm
- improved algorithm
- dynamic programming
- cost function
- computational complexity
- optimization algorithm
- np hard
- experimental evaluation
- search space
- segmentation algorithm
- theoretical analysis
- times faster
- high accuracy
- optimal solution
- computational cost
- significant improvement
- error bounds
- matching algorithm
- approximation ratio
- objective function
- shortest path
- linear programming
- worst case
- clustering method
- particle swarm optimization
- input data
- approximation algorithms
- ant colony algorithm
- shortest path problem
- quadratic assignment problem
- polygonal approximation
- preprocessing