A branch-and-cut algorithm for the pickup-and-delivery traveling salesman problem with handling costs.
Devaraj Radha KrishnanTieming LiuPublished in: Networks (2022)
Keyphrases
- times faster
- learning algorithm
- computational complexity
- theoretical analysis
- preprocessing
- detection algorithm
- optimization algorithm
- cost function
- objective function
- k means
- dynamic programming
- image processing
- improved algorithm
- recognition algorithm
- segmentation algorithm
- expectation maximization
- high accuracy
- hidden markov models
- multi objective
- particle swarm optimization
- worst case
- computationally efficient
- state space
- significant improvement
- segmentation method
- search space
- search algorithm
- selection algorithm
- image segmentation