Value function approximation for dynamic multi-period vehicle routing

DOI10.1016/j.ejor.2018.02.038zbMath1388.90025OpenAlexW2794152854WikidataQ130199500 ScholiaQ130199500MaRDI QIDQ1749495

Ninja Soeffker, Marlin W. Ulmer, Dirk Christian Mattfeld

Publication date: 17 May 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2018.02.038

zbMATH Keywords

routingvalue function approximationdynamic vehicle routingmulti-periodicitystochastic requests

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Dynamic programming (90C39) Markov and semi-Markov decision processes (90C40)

Related Items (11)

A dynamic multi-period general routing problem arising in postal service and parcel delivery systems ⋮ Meso-parametric value function approximation for dynamic customer acceptances in delivery routing ⋮ Dynamic service area sizing in urban delivery ⋮ Offline approximate value iteration for dynamic solutions to the multivehicle routing problem with stochastic demand ⋮ Solving large-scale dynamic vehicle routing problems with stochastic requests ⋮ Same-day delivery with fair customer service ⋮ Dynamic priority rules for combining on-demand passenger transportation and transportation of goods ⋮ Dynamic multi-period vehicle routing with touting ⋮ Horizontal combinations of online and offline approximate dynamic programming for stochastic dynamic vehicle routing ⋮ Stochastic dynamic vehicle routing in the light of prescriptive analytics: a review ⋮ Opportunities for reinforcement learning in stochastic dynamic vehicle routing

Cites Work

• Unnamed Item
• The dynamic multiperiod vehicle routing problem with probabilistic information
• Multi-period vehicle routing problem with due dates
• Multi-period technician scheduling with experience-based service times and stochastic customers
• Trends in transportation and logistics
• A rollout algorithm framework for heuristic solutions to finite-horizon stochastic dynamic programs
• A dynamic vehicle routing problem with multiple delivery routes
• The dynamic multi-period vehicle routing problem
• Approximate Dynamic Programming
• An Approximate Dynamic Programming Approach to Multidimensional Knapsack Problems
• A tabu search heuristic for periodic and multi-depot vehicle routing problems
• Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers

This page was built for publication: Value function approximation for dynamic multi-period vehicle routing