Off-line approximate dynamic programming for the vehicle routing problem with a highly variable customer basis and stochastic demands.
Mohsen DastpakFausto ErricoOla JabaliPublished in: Comput. Oper. Res. (2023)
Keyphrases
- vehicle routing problem
- approximate dynamic programming
- stochastic dynamic programming
- linear program
- routing problem
- tabu search
- metaheuristic
- vehicle routing
- dynamic programming
- benchmark problems
- vehicle routing problem with time windows
- hybrid metaheuristic
- step size
- combinatorial optimization
- travel time
- np hard
- traveling salesman problem
- reinforcement learning
- control policy
- particle swarm optimization
- search strategies
- vehicle routing problem with simultaneous
- knapsack problem
- average cost
- monte carlo
- optimization problems
- simulated annealing
- cost function
- policy iteration
- multistage
- least squares
- multi depot
- greedy randomized adaptive search procedure
- optimal solution