A New Branch-and-Cut Algorithm for the Generalized Directed Rural Postman Problem.
Thais ÁvilaÁngel CorberánIsaac PlanaJosé María SanchisPublished in: Transp. Sci. (2016)
Keyphrases
- single pass
- convergence rate
- cost function
- worst case
- estimation algorithm
- tree structure
- detection algorithm
- high accuracy
- similarity measure
- computational cost
- experimental evaluation
- dynamic programming
- significant improvement
- preprocessing
- evolutionary algorithm
- np hard
- computationally efficient
- segmentation algorithm
- k means
- ant colony optimization
- optimal solution
- computational complexity
- path planning
- clustering method
- optimization algorithm
- particle swarm optimization
- multi objective
- probabilistic model