IDEAS home Printed from https://ideas.repec.org/h/spr/lnopch/978-3-031-08623-6_42.html
   My bibliography  Save this book chapter

New Optimization Guidance for Dynamic Dial-a-Ride Problems

In: Operations Research Proceedings 2021

Author

Listed:
  • Christian Ackermann

    (University of Hildesheim)

  • Julia Rieck

    (University of Hildesheim)

Abstract

In the dial-a-ride problem, customers have to be transported from different pickup to drop-off locations. Various constraints such as time windows and a maximum ride time per passenger need to be considered. In the dynamic version of the problem, not all customer requests are known in advance, but arrive during the operation time. Therefore, the maximization of the number of served customers is usually set as the optimization goal. Nevertheless, in the vast majority of known heuristics, the total distance is used to guide the optimization. In this paper, we present different metrics that should enable the evaluation of the insertion potential of future customers and lead to a higher acceptance rate through their use in solution procedures. We show that even a single metric can provide better results than the distances and present a Markov decision process-based approach to enable an agent trained by reinforcement learning to perform even more anticipatory decision making by considering multiple metrics simultaneously.

Suggested Citation

  • Christian Ackermann & Julia Rieck, 2022. "New Optimization Guidance for Dynamic Dial-a-Ride Problems," Lecture Notes in Operations Research, in: Norbert Trautmann & Mario Gnägi (ed.), Operations Research Proceedings 2021, pages 283-288, Springer.
    • Handle: RePEc:spr:lnopch:978-3-031-08623-6_42
    DOI: 10.1007/978-3-031-08623-6_42
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:lnopch:978-3-031-08623-6_42. 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.