A New Approximation Algorithm for the Capacitated Vehicle Routing Problem on a Tree.
Tetsuo AsanoNaoki KatohKazuhiro KawashimaPublished in: ISAAC (1999)
Keyphrases
- tree structure
- preprocessing
- binary tree
- recognition algorithm
- optimization algorithm
- np hard
- dynamic programming
- similarity measure
- detection algorithm
- theoretical analysis
- computational cost
- learning algorithm
- particle swarm optimization
- experimental evaluation
- search space
- ant colony optimization
- combinatorial optimization
- approximation ratio
- polygonal approximation
- minimum spanning tree
- optimal solution
- times faster
- computational complexity
- metaheuristic
- lower bound
- segmentation algorithm
- simulated annealing