The Dial-a-Ride Problem in Primary Care with Flexible Scheduling
Christina B\"using, Martin Comis, Felix Rauh

TL;DR
This paper introduces a novel extension of the dial-a-ride problem that incorporates flexible scheduling for primary care patient transportation, improving request utilization and ride sharing efficiency.
Contribution
It proposes two heuristics exploiting scheduling flexibility in the DARPCF, enhancing request bundling and transportation efficiency.
Findings
Average served requests increased by 16% with flexible scheduling.
Heuristics effectively exploit scheduling flexibility for better routing.
Flexible scheduling leads to higher system utilization.
Abstract
Patient transportation systems are instrumental in lowering access barriers in primary care by taking patients to their GPs. As part of this setting, each transportation request of a chronic or walk-in patient consists of an outbound trip to the GP and an inbound trip back home. The economic sustainability of patient transportation systems mainly depends on their utilization and how well transportation requests can be bundled through ride sharing. To ease the latter, we consider a flexible scheduling of chronic patients in which only a certain range for an appointment is fixed a priori while the exact time is determined by the scheduling of the outbound trip. This leads to a novel extension of the dial-a-ride problem that we call the dial-a-ride problem with combined requests and flexible scheduling (DARPCF). In this paper, we introduce two heuristics for the DARPCF that exploit this…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTransportation and Mobility Innovations · Vehicle Routing Optimization Methods · Healthcare Operations and Scheduling Optimization
