Skip to main content
SpringerLink
Log in

On the Power of Lookahead in On-Line Vehicle Routing Problems

Extended Abstract

  • Conference paper
Computing and Combinatorics (COCOON 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3595))

Included in the following conference series:

Abstract

Vehicle Routing Problems are generalizations of the well known Traveling Salesman Problem; we focus on the on-line version of these problems, where requests are not known in advance and arrive over time. We introduce a model of lookeahead for this class of problems, the time lookaheadΔ, which allows an on-line algorithm to foresee all the requests that will be released during next Δ time units. We present lower and upper bounds on the competitive ratio of known and studied variants of the OlTsp; we compare these results with the ones from the literature. Our results show that the effectiveness of lookahead varies significantly as we consider different problems.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Albers, S.: On the influence of lookahead in competitive paging algorithms. Algorithmica 18(3), 283–305 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  2. Albers, S.: A competitive analysis of the list update problem with lookahead. Theor. Comput. Sci. 197(1-2), 95–109 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  3. Allulli, L., Ausiello, G., Laura, L.: On the power of lookahead in on-line vehicle routing problems. TR-02-05, DIS, Università di Roma “La Sapienza”

    Google Scholar 

  4. Ausiello, G., Feuerstein, E., Leonardi, S., Stougie, L., Talamo, M.: Algorithms for the on-line travelling salesman. Algorithmica 29(4), 560–581 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  5. Blom, M., Krumke, S.O., de Paepe, W.E., Stougie, L.: The online-TSP against fair adversaries. INFORMS Journal on Computing 13, 138–148 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  6. Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)

    MATH  Google Scholar 

  7. Chung, F.R.K., Graham, R.L., Saks, M.E.: A dynamic location problem for graphs. Combinatorica 9(2), 111–131 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  8. Graham, R.L.: Bounds for certain multiprocessing anomalies. Bell System Technical Journal 45, 1563–1581 (1966)

    Article  Google Scholar 

  9. Grove, E.F.: Online bin packing with lookahead. In: SODA 1995: Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms, pp. 430–436. SIAM, Philadelphia (1995)

    Google Scholar 

  10. Gutin, G., Punnen, A.P. (eds.): The Traveling Salesman Problem and its Variations. Kluwer, Dordrecht (2002)

    MATH  Google Scholar 

  11. Irani, S.: Coloring inductive graphs on-line. Algorithmica 11(1), 53–72 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  12. Kalyanasundaram, B., Pruhs, K.: Speed is as powerful as clairvoyance [scheduling problems]. In: FOCS 1995: Proceedings of the 36th Annual Symposium on Foundations of Computer Science (FOCS 1995), p. 214. IEEE Computer Society, Los Alamitos (1995)

    Google Scholar 

  13. Krumke, S.O., Laura, L., Lipmann, M., Marchetti-Spaccamela, A., de Paepe, W.E., Poensgen, D., Stougie, L.: Non-abusiveness helps: An \(\mathcal O(1)\)-competitive algorithm for minimizing the maximum flow time in the online traveling salesman problem. In: Jansen, K., Leonardi, S., Vazirani, V.V. (eds.) APPROX 2002. LNCS, vol. 2462, pp. 200–214. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  14. M. Lipmann. On-Line Routing. PhD thesis, Technical University of Eindhoven, 2003.

    Google Scholar 

  15. Lipmann, M., Lu, X., de Paepe, W., Sitters, R., Stougie, L.: On-line dial-a-ride problems under a restricted information model. In: Möhring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 674–685. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  16. Motwani, R., Saraswat, V., Torng, E.: Online scheduling with lookahead: Multipass assembly lines. INFORMS J. on Computing 10(3), 331–340 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  17. Sleator, D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Communications of the ACM 28(2), 202–208 (1985)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dip. di Informatica e Sistemistica, Università di Roma “La Sapienza”, Via Salaria, 113, 00198, Roma, Italy

    Luca Allulli, Giorgio Ausiello & Luigi Laura

Authors
  1. Luca Allulli
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Giorgio Ausiello
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Luigi Laura
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, City University of Hong Kong, Tat Chee Avenue, Kowloon, Hong Kong

    Lusheng Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Allulli, L., Ausiello, G., Laura, L. (2005). On the Power of Lookahead in On-Line Vehicle Routing Problems. In: Wang, L. (eds) Computing and Combinatorics. COCOON 2005. Lecture Notes in Computer Science, vol 3595. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11533719_74

Download citation

  • DOI: https://doi.org/10.1007/11533719_74

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28061-3

  • Online ISBN: 978-3-540-31806-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation