IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-540-69995-8_71.html
   My bibliography  Save this book chapter

Online Dial-A-Ride Problem with Time Windows: An Exact Algorithm Using Status Vectors

In: Operations Research Proceedings 2006

Author

Listed:
  • Anke Fabri

    (Universität Dortmund)

  • Peter Recht

    (Universität Dortmund)

Abstract

The Dial-A-Ride Problem (DARP) has often been used to organize transport of elderly and handicapped people, assuming that these people can book their transport in advance. But the DARP can also be used to organize usual passenger or goods transportation in real online scenarios with time window constraints. This paper presents an efficient exact algorithm with significantly reduced calculation times.

Suggested Citation

  • Anke Fabri & Peter Recht, 2007. "Online Dial-A-Ride Problem with Time Windows: An Exact Algorithm Using Status Vectors," Operations Research Proceedings, in: Karl-Heinz Waldmann & Ulrike M. Stocker (ed.), Operations Research Proceedings 2006, pages 445-450, Springer.
    • Handle: RePEc:spr:oprchp:978-3-540-69995-8_71
    DOI: 10.1007/978-3-540-69995-8_71
    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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Sahar Bsaybes & Alain Quilliot & Annegret K. Wagler, 2019. "Fleet management for autonomous vehicles using flows in time-expanded networks," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 27(2), pages 288-311, July.

    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:oprchp:978-3-540-69995-8_71. 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.