New formulation and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks.
Afonso H. SampaioSebastián UrrutiaPublished in: Int. Trans. Oper. Res. (2017)
Keyphrases
- learning algorithm
- experimental evaluation
- computational complexity
- k means
- times faster
- theoretical analysis
- computational cost
- worst case
- detection algorithm
- optimization algorithm
- np hard
- dynamic programming
- simulated annealing
- decomposition algorithm
- computationally efficient
- recognition algorithm
- selection algorithm
- cost function
- significant improvement
- preprocessing
- decision trees
- high accuracy
- expectation maximization
- probabilistic model
- segmentation algorithm
- search space
- clustering method
- path planning
- neural network
- integer program
- data sets