A Branch-and-cut algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem.
Hipólito Hernández-PérezJuan José Salazar GonzálezPublished in: Eur. J. Oper. Res. (2022)
Keyphrases
- preprocessing
- improved algorithm
- cost function
- detection algorithm
- theoretical analysis
- segmentation algorithm
- learning algorithm
- times faster
- matching algorithm
- experimental evaluation
- expectation maximization
- optimization algorithm
- high accuracy
- minimum spanning tree
- path planning
- dynamic programming
- worst case
- np hard
- significant improvement
- search algorithm
- benchmark problems
- recognition algorithm
- selection algorithm
- optimal solution
- feature selection