A branch-and-cut algorithm for the capacitated open vehicle routing problem.
Adam N. LetchfordJens LysgaardRichard W. EglesePublished in: J. Oper. Res. Soc. (2007)
Keyphrases
- vehicle routing problem
- routing problem
- np hard
- benchmark problems
- worst case
- particle swarm optimization
- memetic algorithm
- optimal solution
- dynamic programming
- tabu search
- search space
- simulated annealing
- constraint satisfaction
- vehicle routing problem with time windows
- test instances
- constraint satisfaction problems
- benchmark instances
- optimization algorithm
- neural network
- cost function
- computational complexity
- genetic algorithm