Skip to main content
SpringerLink
Log in

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

  • Conference paper
Operations Research Proceedings 2006

Part of the book series: Operations Research Proceedings ((ORP,volume 2006))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Caramia, M., Italiano, G. F., Oriolo, G., Pacifici, A. and Perugia, A. (2001) Routing a fleet of vehicles for dynamic combined pickup and delivery services. Proceedings of the Symposium on Operation Research 2001, pp 3–8. Berlin/Heidelberg: Springer-Verlag

    Google Scholar 

  2. Fabri, A., Recht, P. (2006) On dynamic pickup and delivery vehicle routing with several time windows and waiting times. Transportation Research Part B, 40, pp335–350. Elsevier

    Article  Google Scholar 

  3. Fabri, A. (2006) Die Größe der Statusgraphen des DARP unter Ladebedingungen. Working Paper. Universität Dortmund, Fachgebiet Operations Research

    Google Scholar 

  4. Fabri, A. (2005) Benchmarkprobleme, http://www.wiso.unidortmund.de/orwi/de/content/team/mitarbeiter/Benchmarks.html, 19.07.2006

    Google Scholar 

  5. P. E. Hart, N. J. Nilsson, B. Raphael: A Formal Basis for the Heuristic Determination of Minimum Cost Paths; IEEE transactions of systems science and cybernetics, Vol. 4, No.2, 1968

    Google Scholar 

  6. Pugh, William (1990) Skip lists: a probabilistic alternative to balanced trees. Commun. ACM, vol. 33 nr. 6ACM Press, pp. 668–676. New York: ACM Press

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universität Dortmund, Germany

    Anke Fabri & Peter Recht

Authors
  1. Anke Fabri
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Peter Recht
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Wirtschaftstheorie und Operations Research, Universität Karlsruhe (TH), Kaiserstraße 12, 76131, Karlsruhe, Germany

    Karl-Heinz Waldmann  & Ulrike M. Stocker  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fabri, A., Recht, P. (2007). Online Dial-A-Ride Problem with Time Windows: An Exact Algorithm Using Status Vectors. In: Waldmann, KH., Stocker, U.M. (eds) Operations Research Proceedings 2006. Operations Research Proceedings, vol 2006. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69995-8_71

Download citation

Publish with us

Policies and ethics

Search

Navigation