IDEAS home Printed from https://ideas.repec.org/a/spr/orspec/v47y2025i3d10.1007_s00291-025-00809-y.html
   My bibliography  Save this article

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

Author

Listed:
  • Christian Ackermann

    (University of Hildesheim)

  • Julia Rieck

    (University of Hildesheim)

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.

Suggested Citation

  • Christian Ackermann & Julia Rieck, 2025. "Multiple plan approach for a dynamic dial-a-ride problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 47(3), pages 781-815, September.
    • Handle: RePEc:spr:orspec:v:47:y:2025:i:3:d:10.1007_s00291-025-00809-y
    DOI: 10.1007/s00291-025-00809-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00291-025-00809-y
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s00291-025-00809-y?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:orspec:v:47:y:2025:i:3:d:10.1007_s00291-025-00809-y. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.