Accelerating value function approximations for dynamic dial-a-ride problems via dimensionality reductions

DOI10.1016/J.COR.2024.106639MaRDI QIDQ6568451zbMATH OpenFDO

Authors R.-Julius O. Heitmann, Ninja Soeffker, Frank Klawonn, Marlin W. Ulmer, Dirk Christian Mattfeld

Publication date 8 July 2024

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.COR.2024.106639

zbMATH Keywords

approximate dynamic programmingdial-a-ridedimensionality reductiondynamic vehicle routingreinforcement learningride-sharing

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• Approximate dynamic programming for ambulance redeployment
• Approximate dynamic programming for planning a ride-hailing system using autonomous fleets of electric vehicles
• Fast Online Reinforcement Learning Control Using State-Space Dimensionality Reduction
• Meso-parametric value function approximation for dynamic customer acceptances in delivery routing
• Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports
• Optimization of occupancy rate in dial-a-ride problems via linear fractional column generation
• Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers
• Solving the dynamic ambulance relocation and dispatching problem using approximate dynamic programming
• The dial-a-ride problem (DARP): variants, modeling issues and algorithms
• The dial-A-ride problem with transfers
• The dial-a-ride problem: Models and algorithms
• The Linear Programming Approach to Approximate Dynamic Programming

Cited in

(1)

• Ride-pool assignment algorithms: swapping heuristics and efficient implementation

This page was built for publication: Accelerating value function approximations for dynamic dial-a-ride problems via dimensionality reductions

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