Horizontal combinations of online and offline approximate dynamic programming for stochastic dynamic vehicle routing

DOI10.1007/s10100-018-0588-xOpenAlexW2894871058WikidataQ129150670 ScholiaQ129150670MaRDI QIDQ2303337

Marlin W. Ulmer

Publication date: 3 March 2020

Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10100-018-0588-x

zbMATH Keywords

value function approximationapproximate dynamic programmingmulti-perioddynamic vehicle routingrollout algorithmstochastic requests

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items (4)

CEJOR special issue: dynamic optimization in management and economics ⋮ Meso-parametric value function approximation for dynamic customer acceptances in delivery routing ⋮ Recent advances in integrating demand management and vehicle routing: a methodological review ⋮ Dynamic demand management and online tour planning for same-day delivery

Cites Work

• Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem
• Solving stochastic resource-constrained project scheduling problems by closed-loop approximate dynamic programming
• The dynamic multiperiod vehicle routing problem with probabilistic information
• Multi-period vehicle routing problem with due dates
• Anticipatory optimization for dynamic decision making
• The dynamic dispatch waves problem for same-day delivery
• Multi-period technician scheduling with experience-based service times and stochastic customers
• Trends in transportation and logistics
• Improved solutions to dynamic and stochastic maritime pick-up and delivery problems using local search
• A rollout algorithm framework for heuristic solutions to finite-horizon stochastic dynamic programs
• Value function approximation for dynamic multi-period vehicle routing
• A dynamic vehicle routing problem with multiple delivery routes
• The dynamic multi-period vehicle routing problem
• Approximate Dynamic Programming
• On the Asymptotic Validity of Fully Sequential Selection Procedures for Steady-State Simulation
• Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers
• Distribution of waiting time for dynamic pickup and delivery problems
• Variable neighborhood search for the stochastic and dynamic vehicle routing problem

This page was built for publication: Horizontal combinations of online and offline approximate dynamic programming for stochastic dynamic vehicle routing