A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading.
Jean-François CordeauManuel IoriGilbert LaporteJuan José Salazar GonzálezPublished in: Networks (2010)
Keyphrases
- cost function
- estimation algorithm
- improved algorithm
- times faster
- preprocessing
- learning algorithm
- single pass
- dynamic programming
- detection algorithm
- k means
- high accuracy
- optimization algorithm
- search space
- similarity measure
- objective function
- selection algorithm
- recognition algorithm
- convergence rate
- optimal solution
- matching algorithm
- theoretical analysis
- significant improvement
- segmentation algorithm
- computationally efficient
- expectation maximization
- tree structure
- simulated annealing
- worst case
- state space
- computational cost
- computational complexity
- lower bound
- data sets