An analytical bound on the fleet size in vehicle routing problems: a dynamic programming approach.
Ali EshraghRasul EsmaeilbeigiRichard H. MiddletonPublished in: CoRR (2019)
Keyphrases
- vehicle routing problem
- dynamic programming
- metaheuristic
- tabu search
- vehicle routing problem with time windows
- benchmark problems
- vehicle routing
- routing problem
- memetic algorithm
- test instances
- knapsack problem
- upper bound
- traveling salesman problem
- particle swarm optimization
- waste collection
- lower bound
- travel time
- neighborhood search
- np hard
- combinatorial optimization
- search strategies
- multi depot
- simulated annealing
- computational complexity
- greedy algorithm
- greedy randomized adaptive search procedure
- benchmark instances
- linear programming
- variable neighborhood search
- worst case
- multi objective
- guided local search
- data structure
- reinforcement learning