Shaping decision models for stochastic dynamic optimization problems via reinforcement learning

DOI10.1002/NET.70039MaRDI QIDQ7267813zbMATH OpenFDO

Authors Florentin D. Hildebrandt, Alexander Bode, Marlin W. Ulmer, Dirk Christian Mattfeld

Publication date 16 June 2026

Published in Networks (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1002/NET.70039

zbMATH Keywords

machine learningmixed integer linear programmingapproximate dynamic programmingreinforcement learningsequential decision processstochastic dynamic decision making

Mathematics Subject Classification ID

Dynamic programming (90C39) Stochastic programming (90C15) Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06)

Cites work

• A Cost-Shaping Linear Program for Average-Cost Approximate Dynamic Programming with Performance Guarantees
• A Rollout Policy for the Vehicle Routing Problem with Stochastic Demands
• A genetic algorithm for the multidimensional knapsack problem
• A priori orienteering with time windows and stochastic wait times at customers
• A reinforcement learning approach to the orienteering problem with time windows
• A rollout algorithm framework for heuristic solutions to finite-horizon stochastic dynamic programs
• Adaptive granular local search heuristic for a dynamic vehicle routing problem
• An approximate dynamic programming approach to multidimensional knapsack problems
• Approximate dynamic programming for planning a ride-hailing system using autonomous fleets of electric vehicles
• Binary driver-customer familiarity in service routing
• Deep Q-learning for same-day delivery with vehicles and drones
• Discrete-variable extremum problems
• Diversion issues in real-time vehicle dispatching
• Dynamic assignment of a multi-skilled workforce in job shops: an approximate dynamic programming approach
• Dynamic scheduling with uncertain job types
• Estimation of the arrival time of deliveries by occasional drivers in a crowd-shipping setting
• Maximum Pressure Policies in Stochastic Processing Networks
• Meso-parametric value function approximation for dynamic customer acceptances in delivery routing
• Opportunities for reinforcement learning in stochastic dynamic vehicle routing
• Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching
• Reinforcement Learning and Stochastic Optimization
• Reinforcement learning. An introduction
• Same-day delivery with fair customer service
• Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers
• Solving the stochastic time-dependent orienteering problem with time windows
• Stochastic dynamic vehicle routing in the light of prescriptive analytics: a review
• Stochastic search for a parametric cost function approximation: energy storage with rolling forecasts
• Strong mixed-integer programming formulations for trained neural networks
• The Dynamic and Stochastic Knapsack Problem with Random Sized Items
• The dynamic and stochastic knapsack problem
• The dynamic dispatch waves problem for same-day delivery
• The flexible job shop scheduling problem: a review
• Value function approximation for dynamic multi-period vehicle routing
• Waiting and Buffering Strategies for the Dynamic Pickup and Delivery Problem with Time Windows

This page was built for publication: Shaping decision models for stochastic dynamic optimization problems via reinforcement learning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7267813)