A new branch-and-cut algorithm for the capacitated vehicle routing problem.
Jens LysgaardAdam N. LetchfordRichard W. EglesePublished in: Math. Program. (2004)
Keyphrases
- dynamic programming
- experimental evaluation
- learning algorithm
- single pass
- improved algorithm
- matching algorithm
- detection algorithm
- segmentation algorithm
- high accuracy
- worst case
- computational cost
- cost function
- k means
- search space
- optimal solution
- np hard
- lower bound
- preprocessing
- computationally efficient
- similarity measure
- ant colony optimization
- memetic algorithm
- data sets
- network flow
- scatter search
- estimation algorithm
- times faster
- path planning
- objective function
- genetic algorithm