A branch-and-cut algorithm for vehicle routing problems.
J. R. Araque GGautham K. KudvaThomas L. MorinJoseph F. PeknyPublished in: Ann. Oper. Res. (1994)
Keyphrases
- vehicle routing problem with time windows
- dynamic programming
- computational complexity
- np hard
- benchmark problems
- particle swarm optimization
- optimal solution
- benchmark instances
- simulated annealing
- cost function
- objective function
- optimization algorithm
- metaheuristic
- greedy algorithm
- search strategy
- worst case
- spanning tree
- memetic algorithm
- test instances