Meso-parametric value function approximation for dynamic customer acceptances in delivery routing

DOI10.1016/J.EJOR.2019.04.029zbMath1441.90038OpenAlexW2940841755WikidataQ127986068 ScholiaQ127986068MaRDI QIDQ2183325

Barrett W. Thomas, Marlin W. Ulmer

Publication date: 26 May 2020

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

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

zbMATH Keywords

value function approximationapproximate dynamic programmingdynamic vehicle routingdynamic customer acceptancesdynamic multi-dimensional knapsack problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Dynamic programming (90C39)

Related Items (12)

A review of revenue management: recent generalizations and advances in industry applications ⋮ An approximate dynamic programming approach to the admission control of elective patients ⋮ A dynamic and probabilistic orienteering problem ⋮ Solving large-scale dynamic vehicle routing problems with stochastic requests ⋮ Recent advances in integrating demand management and vehicle routing: a methodological review ⋮ Dynamic demand management and online tour planning for same-day delivery ⋮ Route-based approximate dynamic programming for dynamic pricing in attended home delivery ⋮ Accelerating value function approximations for dynamic dial-a-ride problems via dimensionality reductions ⋮ Anticipative dynamic slotting for attended home deliveries ⋮ Stochastic dynamic vehicle routing in the light of prescriptive analytics: a review ⋮ Deep Q-learning for same-day delivery with vehicles and drones ⋮ Opportunities for reinforcement learning in stochastic dynamic vehicle routing

Cites Work

• Unnamed Item
• Unnamed Item
• Solving stochastic resource-constrained project scheduling problems by closed-loop approximate dynamic programming
• Sourcing strategies in supply risk management: an approximate dynamic programming approach
• Anticipatory optimization for dynamic decision making
• An approximate dynamic programming approach to attended home delivery management
• A rollout algorithm framework for heuristic solutions to finite-horizon stochastic dynamic programs
• Value function approximation for dynamic multi-period vehicle routing
• Exploiting structure in adaptive dynamic programming algorithms for a stochastic batch service problem
• Solving the dynamic ambulance relocation and dispatching problem using approximate dynamic programming
• Horizontal combinations of online and offline approximate dynamic programming for stochastic dynamic vehicle routing
• The Dynamic and Stochastic Knapsack Problem
• An Approximate Dynamic Programming Algorithm for Monotone Value Functions
• Dynamic-Programming Approximations for Stochastic Time-Staged Integer Multicommodity-Flow Problems
• Approximate Dynamic Programming for Ambulance Redeployment
• Approximate Dynamic Programming
• An Adaptive, Distribution-Free Algorithm for the Newsvendor Problem with Censored Demands, with Applications to Inventory and Distribution
• An Approximate Dynamic Programming Approach to Multidimensional Knapsack Problems
• Optimal Hour-Ahead Bidding in the Real-Time Electricity Market with Battery Storage Using Approximate Dynamic Programming
• The Dynamic and Stochastic Knapsack Problem with Random Sized Items
• The Dynamic and Stochastic Knapsack Problem with Deadlines
• An Adaptive Dynamic Programming Algorithm for Dynamic Fleet Management, I: Single Period Travel Times
• An Adaptive Dynamic Programming Algorithm for Dynamic Fleet Management, II: Multiperiod Travel Times
• Rollout Policies for Dynamic Solutions to the Multivehicle Routing Problem with Stochastic Demand and Duration Limits
• Discrete-Variable Extremum Problems

This page was built for publication: Meso-parametric value function approximation for dynamic customer acceptances in delivery routing