Meso-parametric value function approximation for dynamic customer acceptances in delivery routing
From MaRDI portal
Recommendations
- Value function approximation for dynamic multi-period vehicle routing
- Offline approximate value iteration for dynamic solutions to the multivehicle routing problem with stochastic demand
- A dynamic vehicle routing problem with multiple delivery routes
- An approximate dynamic programming approach for the vehicle routing problem with stochastic demands
- The probabilistic travelling salesman problem with crowdsourcing
Cites work
- scientific article; zbMATH DE number 1321699 (Why is no real title available?)
- A rollout algorithm framework for heuristic solutions to finite-horizon stochastic dynamic programs
- 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
- An adaptive, distribution-free algorithm for the newsvendor problem with censored demands, with applications to inventory and distribution
- An approximate dynamic programming algorithm for monotone value functions
- An approximate dynamic programming approach to attended home delivery management
- An approximate dynamic programming approach to multidimensional knapsack problems
- Anticipatory optimization for dynamic decision making
- Approximate dynamic programming for ambulance redeployment
- Approximate dynamic programming. Solving the curses of dimensionality
- Discrete-variable extremum problems
- Dynamic-programming approximations for stochastic time-staged integer multicommodity-flow problems
- Exploiting structure in adaptive dynamic programming algorithms for a stochastic batch service problem
- Horizontal combinations of online and offline approximate dynamic programming for stochastic dynamic vehicle routing
- Optimal hour-ahead bidding in the real-time electricity market with battery storage using approximate dynamic programming
- Rollout policies for dynamic solutions to the multivehicle routing problem with stochastic demand and duration limits
- Solving stochastic resource-constrained project scheduling problems by closed-loop approximate dynamic programming
- Solving the dynamic ambulance relocation and dispatching problem using approximate dynamic programming
- Sourcing strategies in supply risk management: an approximate dynamic programming approach
- The Dynamic and Stochastic Knapsack Problem with Deadlines
- The Dynamic and Stochastic Knapsack Problem with Random Sized Items
- The dynamic and stochastic knapsack problem
- Value function approximation for dynamic multi-period vehicle routing
- Value function approximation using multiple aggregation for multiattribute resource management
Cited in
(12)- Accelerating value function approximations for dynamic dial-a-ride problems via dimensionality reductions
- Recent advances in integrating demand management and vehicle routing: a methodological review
- Route-based approximate dynamic programming for dynamic pricing in attended home delivery
- Anticipative dynamic slotting for attended home deliveries
- 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
- Dynamic demand management and online tour planning for same-day delivery
- Opportunities for reinforcement learning in stochastic dynamic vehicle routing
- Deep Q-learning for same-day delivery with vehicles and drones
- Stochastic dynamic vehicle routing in the light of prescriptive analytics: a review
This page was built for publication: Meso-parametric value function approximation for dynamic customer acceptances in delivery routing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2183325)
