Non-additive Shortest Paths | SpringerLink
Skip to main content
Springer Nature Link
Log in

Non-additive Shortest Paths

  • Conference paper
Algorithms – ESA 2004 (ESA 2004)

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

Included in the following conference series:

  • 1646 Accesses

Abstract

The non-additive shortest path (NASP) problem asks for finding an optimal path that minimizes a certain multi-attribute non-linear cost function. In this paper, we consider the case of a non-linear convex and non-decreasing function on two attributes. We present an efficient polynomial algorithm for solving a Lagrangian relaxation of NASP. We also present an exact algorithm that is based on new heuristics we introduce here, and conduct a comparative experimental study with synthetic and real-world data that demonstrates the quality of our approach.

This work was partially supported by the IST Programme (6th FP) of EC under contract No. IST-2002-001907 (integrated project DELIS).

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
¥17,985 /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
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 11439
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 14299
Price includes VAT (Japan)
  • 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. Ahuja, R., Magnanti, T., Orlin, J.: Network Flows. Prentice-Hall, Englewood Cliffs (1993)

    Google Scholar 

  2. Beasley, J., Christofides, N.: An Algorithm for the Resource Constrained Shortest Path Problem. Networks 19, 379–394 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  3. Cheney, E.W.: Introduction to Approximation Theory. McGraw-Hill, New York (1966)

    MATH  Google Scholar 

  4. Gabriel, S., Bernstein, D.: The Traffic Equilibrium Problem with Nonadditive Path Costs. Transportation Science 31(4), 337–348 (1997)

    Article  MATH  Google Scholar 

  5. Gabriel, S., Bernstein, D.: Nonadditive Shortest Paths: Subproblems in Multi- Agent Competitive Network Models. Comp. & Math. Organiz. Theory 6 (2000)

    Google Scholar 

  6. Handler, G., Zang, I.: A Dual Algorithm for the Constrained Shortest Path Problem. Networks 10, 293–310 (1980)

    Article  MathSciNet  Google Scholar 

  7. Henig, M.: The Shortest Path Problem with Two Objective Functions. European Journal of Operational Research 25, 281–291 (1985)

    Article  MathSciNet  Google Scholar 

  8. Hensen, D., Truong, T.: Valuation of Travel Times Savings. Journal of Transport Economics and Policy, 237–260 (1985)

    Google Scholar 

  9. Mehlhorn, K., Ziegelmann, M.: Resource Constrained Shortest Paths. In: Paterson, M. (ed.) ESA 2000. LNCS, vol. 1879, pp. 326–337. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  10. Mirchandani, P., Wiecek, M.: Routing with Nonlinear Multiattribute Cost Functions. Applied Mathematics and Computation 54, 215–239 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  11. Papadimitriou, C., Yannakakis, M.: On the Approximability of Trade-offs and Optimal Access of Web Sources. In: Proc. 41st FOCS 2000, pp. 86–92 (2000)

    Google Scholar 

  12. Scott, K., Bernstein, D.: Solving a Best Path Problem when the Value of Time Function is Nonlinear, preprint 980976 of the Transport. Research Board (1997)

    Google Scholar 

  13. Tsaggouris, G., Zaroliagis, C.: Non-Additive Shortest Paths, Tech. Report TR-2004/03/01, Computer Technology Institute, Patras (March 2004)

    Google Scholar 

  14. Zhan, F.B., Noon, C.E.: Shortest Path Algorithms: An Evaluation using Real Road Networks. Transportation Science 32(1), 65–73 (1998)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Technology Institute, P.O. Box 1122, 26110, Patras, Greece

    George Tsaggouris & Christos Zaroliagis

  2. Department of Computer Engineering and Informatics, University of Patras, 26500, Patras, Greece

    George Tsaggouris & Christos Zaroliagis

Authors
  1. George Tsaggouris
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Christos Zaroliagis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Freiburg, Georges Köhler Allee 79, 79110, Freiburg, Germany

    Susanne Albers

  2. Department of Computer Science, King’s College, WC2R 2LS, London, UK

    Tomasz Radzik

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tsaggouris, G., Zaroliagis, C. (2004). Non-additive Shortest Paths. In: Albers, S., Radzik, T. (eds) Algorithms – ESA 2004. ESA 2004. Lecture Notes in Computer Science, vol 3221. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30140-0_72

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30140-0_72

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23025-0

  • Online ISBN: 978-3-540-30140-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation