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

DOI10.1016/j.cor.2024.106639MaRDI QIDQ6568451

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

Publication date: 8 July 2024

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

zbMATH Keywords

reinforcement learningdimensionality reductiondial-a-rideapproximate dynamic programmingdynamic vehicle routingride-sharing

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• The dial-A-ride problem with transfers
• 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
• The dial-a-ride problem (DARP): variants, modeling issues and algorithms
• Solving the dynamic ambulance relocation and dispatching problem using approximate dynamic programming
• Approximate dynamic programming for planning a ride-hailing system using autonomous fleets of electric vehicles
• Meso-parametric value function approximation for dynamic customer acceptances in delivery routing
• The dial-a-ride problem: Models and algorithms
• Approximate Dynamic Programming for Ambulance Redeployment
• The Linear Programming Approach to Approximate Dynamic Programming
• Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers
• Fast Online Reinforcement Learning Control Using State-Space Dimensionality Reduction

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)