Off-line approximate dynamic programming for the vehicle routing problem with stochastic customers and demands via decentralized decision-making.
Mohsen DastpakFausto ErricoPublished in: CoRR (2021)
Keyphrases
- vehicle routing problem
- approximate dynamic programming
- stochastic dynamic programming
- decentralized decision making
- linear program
- metaheuristic
- tabu search
- dynamic programming
- routing problem
- reinforcement learning
- benchmark problems
- step size
- multi agent
- combinatorial optimization
- traveling salesman problem
- np hard
- multi armed bandit
- pick up and delivery
- decision making
- control policy
- knapsack problem
- particle swarm optimization
- bandit problems
- global optimization
- resource allocation
- optimization problems
- neural network
- search strategies
- linear programming
- decision makers
- average cost
- objective function
- genetic algorithm