Skip to main content
SpringerLink
Log in

Optimal Routing of Traffic Flows with Length Restrictions in Networks with Congestion

  • Conference paper
Operations Research Proceedings 1999

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

Summary

When traffic flows are routed through a road network it is desirable to minimize the total road usage. Since a route guidance system can only recommend paths to the drivers, special care has to be taken not to route them over paths they perceive as too long. This leads in a simplified model to a nonlinear multicommodity flow problem with constraints on the available paths. In this article an algorithm for this problem is given, which combines the convex combinations algorithm by Frank and Wolfe with column generation and algorithms for the constrained shortest path problem. Computational results stemming from a cooperation with DaimlerChrysler are presented.

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 99.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 132.00
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. Ravindra K. Ahuja, Thomas L. Magnanti, and James B. Orlin. Network Flows. Prentice-Hall, New Jersey, 1993.

    Google Scholar 

  2. Y. P. Aneja, V. Aggarwal, and K. P. K. Nair. Shortest chain subject to side constraints. Networks, 13:295–302, 1983.

    Article  Google Scholar 

  3. J. E. Beasley and N. Christofides. An algorithm for the resource constrained shortest path problem. Networks, 19:379–394, 1989.

    Article  Google Scholar 

  4. G. Beccaria and A. Bolelli. Modelling and assessment of dynamic route guidance: the MARGOT project. In Vehicle Navigation & Information Systems Conference Proceedings, 1992, Oslo (VNIS ′92), pages 117–126. IEEE, 1992.

    Google Scholar 

  5. Marguerite Prank and Philip Wolfe. An algorithm for quadratic programming. Naval Research Logistics Quarterly, 3:95–110, 1956.

    Article  Google Scholar 

  6. Michael R. Garey and David S. Johnson. Computers and Intractability, A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York, 1979.

    Google Scholar 

  7. Olaf Jahn. Multicommodity Flow-Modelle und Algorithmen zur dynamischen Lenkung von Verkehrsströmen. Diploma thesis, Fachbereich Mathematik, Technische Universität Berlin, 1998.

    Google Scholar 

  8. R. W. Klessig. An algorithm for nonlinear multicommodity flow problems. Networks, 4:343–355, 1974.

    Article  Google Scholar 

  9. Markos Papageorgiou, editor. Concise Encyclopedia of Traffic & Transportation Systems. Pergamon Press, Oxford, 1991.

    Google Scholar 

  10. Yosef Sheffi. Urban Transportation Networks. Prentice-Hall, New Jersey, 1985.

    Google Scholar 

  11. John Glen Wardrop. Some theoretical aspects of road traffic research. Proceedings of the Institution of Civil Engineers, 1(2):325–362, 1952.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Mathematik, Technische Universität Berlin, Germany

    Olaf Jahn & Rolf H. Möhring

  2. Sloan School of Management, MIT, Cambridge, USA

    Andreas S. Schulz

Authors
  1. Olaf Jahn
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rolf H. Möhring
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Andreas S. Schulz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Fakultät für Wirtschaftswissenschaft, Otto-von-Guericke-Universität Magdeburg, Universitätsplatz 2, D-39106, Magdeburg, Germany

    Karl Inderfurth  & Gerhard Schwödiauer  & 

  2. Fachbereich Rechts- und Wirtschaftswissenschaften, Technische Universität Darmstadt, Hochschulstr. 1, D-64289, Darmstadt, Germany

    Wolfgang Domschke

  3. Fakultät für Mathematik, Otto-von-Guericke-Universität Magdeburg, Universitätsplatz 2, D-39106, Magdeburg, Germany

    Friedrich Juhnke

  4. Wirtschaftswissenschaftliche Fakultät, Universität Passau, Innstr. 29, D-90030, Passau, Germany

    Peter Kleinschmidt

  5. Wirtschaftswissenschaftliche Fakultät, Martin-Luther-Universität Halle-Wittenberg, Große Steinstr. 73, D-06108, Halle/Saale, Germany

    Gerhard Wäscher

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jahn, O., Möhring, R.H., Schulz, A.S. (2000). Optimal Routing of Traffic Flows with Length Restrictions in Networks with Congestion. In: Inderfurth, K., Schwödiauer, G., Domschke, W., Juhnke, F., Kleinschmidt, P., Wäscher, G. (eds) Operations Research Proceedings 1999. Operations Research Proceedings 1999, vol 1999. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-58300-1_68

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-58300-1_68

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-642-58300-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation