A tutorial on value function approximation for stochastic and dynamic transportation

DOI10.1007/S10288-023-00539-3MaRDI QIDQ6489316

Unnamed Author

Publication date: 21 April 2024

Published in: 4OR (Search for Journal in Brave)

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports
• Adaptive stepsizes for recursive estimation with applications in approximate dynamic programming
• Value function approximation for dynamic multi-period vehicle routing
• Solving the dynamic ambulance relocation and dispatching problem using approximate dynamic programming
• Look-ahead strategies for dynamic pickup and delivery problems
• Commentary—Post-Decision States and Separable Approximations Are Powerful Tools of Approximate Dynamic Programming
• Approximate Dynamic Programming for Ambulance Redeployment
• Approximate Dynamic Programming
• What you should know about approximate dynamic programming
• Approximate Dynamic Programming by Practical Examples
• Reoptimization Approaches for the Vehicle-Routing Problem with Stochastic Demands

This page was built for publication: A tutorial on value function approximation for stochastic and dynamic transportation