An adaptive memory heuristic for a class of vehicle routing problems with minmax objective.
Bruce L. GoldenGilbert LaporteÉric D. TaillardPublished in: Comput. Oper. Res. (1997)
Keyphrases
- vehicle routing problem
- benchmark instances
- multi depot
- tabu search
- variable neighborhood search
- test instances
- vehicle routing problem with time windows
- guided local search
- tree search algorithm
- metaheuristic
- combinatorial optimization
- routing problem
- traveling salesman problem
- neighborhood search
- search strategies
- memetic algorithm
- exact algorithms
- waste collection
- solution quality
- scheduling problem
- optimal solution
- greedy randomized adaptive search procedure
- search algorithm
- heuristic methods
- test problems
- linear programming
- lower bound