Off-line approximate dynamic programming for the vehicle routing problem with a highly variable customer basis and stochastic demands

DOI10.1016/j.cor.2023.106338arXiv2109.10200OpenAlexW4383070024MaRDI QIDQ6047879

Ola Jabali, Mohsen Dastpak, Fausto Errico

Publication date: 13 September 2023

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2109.10200

zbMATH Keywords

approximate dynamic programmingQ-learningstochastic vehicle routing problem

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• An approximate dynamic programming approach for the vehicle routing problem with stochastic demands
• The vehicle scheduling problem with intermittent customer demands
• Dynamic lookahead policies for stochastic-dynamic inventory routing in bike sharing systems
• \({\mathcal Q}\)-learning
• Stochastic dynamic vehicle routing in the light of prescriptive analytics: a review
• Deep Q-learning for same-day delivery with vehicles and drones
• A review of stochastic algorithms with continuous value function approximation and some new approximate policy iteration algorithms for multidimensional continuous applications
• Approximate Dynamic Programming for Ambulance Redeployment
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Approximate Dynamic Programming
• A Rollout Policy for the Vehicle Routing Problem with Stochastic Demands
• Vehicle-scheduling Problems with Uncertainty and Omitted Customers
• Rollout Policies for Dynamic Solutions to the Multivehicle Routing Problem with Stochastic Demand and Duration Limits
• An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers