An analytical bound on the fleet size in vehicle routing problems: A dynamic programming approach.
Ali EshraghRasul EsmaeilbeigiRichard H. MiddletonPublished in: Oper. Res. Lett. (2020)
Keyphrases
- vehicle routing problem
- dynamic programming
- tabu search
- metaheuristic
- benchmark problems
- vehicle routing
- traveling salesman problem
- np hard
- vehicle routing problem with time windows
- knapsack problem
- routing problem
- combinatorial optimization
- test instances
- memetic algorithm
- worst case
- particle swarm optimization
- waste collection
- upper bound
- lower bound
- travel time
- state space
- multi depot
- linear programming
- greedy algorithm
- genetic algorithm
- pick up and delivery
- greedy randomized adaptive search procedure
- path relinking
- genetic programming
- computational complexity
- reinforcement learning