Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

The Online Dial-a-Ride Problem under Reasonable Load

  • Conference paper
  • First Online:
Algorithms and Complexity (CIAC 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1767))

Included in the following conference series:

  • 542 Accesses

Abstract

In this paper, we analyze algorithms for the online dial-a- ride problem with request sets that fulfill a certain worst-case restriction: roughly speaking, a set of requests for the online dial-a-ride problem is reasonable if the requests that come up in a sufficiently large time period can be served in a time period of at most the same length. This new notion is a stability criterion implying that the system is not overloaded. The new concept is used to analyze the online dial-a-ride problem for the minimization of the maximal resp. average flow time. Under reasonable load it is possible to distinguish the performance of two particular algorithms for this problem, which seems to be impossible by means of classical competitive analysis.

Research supported by the German Science Foundation (grant 883/5-2)

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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.

Similar content being viewed by others

References

  1. N. Ascheuer, S. O. Krumke, and J. Rambau. Online dial-a-ride problems: Minimizing the completion time. In Proceedings of the 17th International Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, 2000. To appear.

    Google Scholar 

  2. Mikhail J. Atallah and S. Rao Kosaraju. Efficient solutions to some transportation problems with applications to minimizing robot arm travel. SIAM Journal on Computing, 17:849–869, 1988.

    Article  MATH  MathSciNet  Google Scholar 

  3. Georgio Ausiello, Esteban Feuerstein, Stefano Leonardi, Leen Stougie, and Maurizio Talamo. Algorithms for the on-line traveling salesman. Algorithmica, to appear.

    Google Scholar 

  4. Allan Borodin and Ran El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998.

    Google Scholar 

  5. Esteban Feuerstein and Leen Stougie. On-line single server dial-a-ride problems. Theoretical Computer Science, special issue on on-line algorithms, to appear.

    Google Scholar 

  6. Amos Fiat and Gerhard J. Woeginger, editors. Online Algorithms: The State of the Art, volume 1442 of Lecture Notes in Computer Science. Springer, 1998.

    Google Scholar 

  7. Greg N. Frederickson and D. J. Guan. Nonpreemptive ensemble motion planning on a tree. Journal of Algorithms, 15:29–60, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  8. Greg N. Frederickson, Matthew S. Hecht, and Chul Kim. Approximation algorithms for some routing problems. SIAM Journal on Computing, 7:178–193, 1978.

    Article  MathSciNet  Google Scholar 

  9. Martin Grötschel, Dietrich Hauptmeier, Sven O. Krumke, and Jörg Rambau. Simulation studies for the online dial-a-ride-problem. Preprint SC 99-09, Konrad-Zuse-Zentrum für Informationstechnik Berlin, 1999.

    Google Scholar 

  10. Dietrich Hauptmeier, Sven O. Krumke, Jörg Rambau, and Hans C. Wirth. Euler is standing in line—dial-a-ride problems with fifo-precedence-contraints. In Peter Widmeyer, Gabriele Neyer, and Stephan Eidenbenz, editors, Graph Theoretic Concepts in Computer Science, volume 1665 of Lecture Notes in Computer Science, pages 42–54. Springer, Berlin Heidelberg New York, 1999.

    Chapter  Google Scholar 

  11. Hans Kellerer, Thomas Tautenhahn, and Gerhard Woeginger. Approximability and nonapproximabiblity results for minimizing total flow time on a single machine. In Proceedings of the Symposium on the Theory of Computing, 1996.

    Google Scholar 

  12. Jiří Sgall. Online scheduling. In Amos Fiat and Gerhard J. Woeginger, editors, Online Algorithms: The State of the Art, volume 1442 of Lecture Notes in Computer Science. Springer, 1998.

    Chapter  Google Scholar 

  13. David B. Shmoys, Joel Wein, and David P. Williamson. Scheduling parallel machines on-line. SIAM Journal on Computing, 24(6):1313–1331, December 1995.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Konrad-Zuse-Zentrum für Informationstechnik Berlin, Takustr. 7, 14195, Berlin, Germany

    Dietrich Hauptmeier, Sven O. Krumke & Jörg Rambau

Authors
  1. Dietrich Hauptmeier
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sven O. Krumke
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jörg Rambau
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Rome “La Sapienza”, Via Salaria 113, 00198, Rome, Italy

    Giancarlo Bongiovanni  & Rossella Petreschi  & 

  2. Department of Mathematics, University of Rome “Tor Vergata”, Via della Ricerca Scientifica 1, 00133, Rome, Italy

    Giorgio Gambosi

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hauptmeier, D., Krumke, S.O., Rambau, J. (2000). The Online Dial-a-Ride Problem under Reasonable Load. In: Bongiovanni, G., Petreschi, R., Gambosi, G. (eds) Algorithms and Complexity. CIAC 2000. Lecture Notes in Computer Science, vol 1767. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46521-9_11

Download citation

  • DOI: https://doi.org/10.1007/3-540-46521-9_11

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67159-6

  • Online ISBN: 978-3-540-46521-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation