arbiter
JournalsPricingAccount

Multiple plan approach for a dynamic dial-a-ride problem

Christian Ackermann & Julia Rieck

OR Spectrum2025https://doi.org/10.1007/s00291-025-00809-yarticle
AJG 3ABDC B
Weight
0.41

What the paper says

Abstract In densely populated areas, ridepooling services are becoming more and more popular and can contribute to promote sustainable mobility concepts. In this paper, we study a dynamic dial-a-ride problem and propose a novel two-phase multiple plan approach. By maintaining multiple plans simultaneously over the course of the optimization procedure, we increase the likelihood and speed of a successful insertion for dynamically arising customer requests. Additionally, we present a new metric to replace the commonly used distance minimization as guidance within the optimization procedure. In order to examine the impact of certain instance characteristics on the quality of the solutions, we evaluate our design decisions on various instance sets. The results show that the proposed method consistently outperforms commonly used single plan approaches.

2 citations

Open paper page →

Cite this paper

https://doi.org/https://doi.org/10.1007/s00291-025-00809-y

Or copy a formatted citation

@article{christian2025,
  title        = {{Multiple plan approach for a dynamic dial-a-ride problem}},
  author       = {Christian Ackermann & Julia Rieck},
  journal      = {OR Spectrum},
  year         = {2025},
  doi          = {https://doi.org/https://doi.org/10.1007/s00291-025-00809-y},
}

Paste directly into BibTeX, Zotero, or your reference manager.

Flag this paper

Multiple plan approach for a dynamic dial-a-ride problem

Flags are reviewed by the Arbiter methodology team within 5 business days.

Evidence weight

0.41

Balanced mode · F 0.40 / M 0.15 / V 0.05 / R 0.40

F · citation impact0.25 × 0.4 = 0.10
M · momentum0.55 × 0.15 = 0.08
V · venue signal0.50 × 0.05 = 0.03
R · text relevance †0.50 × 0.4 = 0.20

† Text relevance is estimated at 0.50 on the detail page — for your query’s actual relevance score, open this paper from a search result.