Solving the dynamic Dial-a-Ride problem using a rolling-horizon event-based graph

DOI10.4230/OASICS.ATMOS.2021.8zbMATH Open1548.90072MaRDI QIDQ6587283FDOQ6587283

Authors: Daniela Gaul, Kathrin Klamroth, Michael Stiglmayr 

Publication date: 13 August 2024

Recommendations

• Event-based MILP models for ridepooling applications
• An effective and fast heuristic for the dial-a-ride problem
• Dial-a-ride problem: mixed integer programming revisited and constraint programming proposed
• Maximizing the number of served requests in an online shared transport system by solving a dynamic DARP
• A matheuristic for the dial-a-ride problem

zbMATH Keywords

dial-a-ride problemrolling-horizonridepoolingdynamic requestsevent-based MILP

Mathematics Subject Classification ID

Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Traffic problems in operations research (90B20)

This page was built for publication: Solving the dynamic Dial-a-Ride problem using a rolling-horizon event-based graph

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