Skip to main content
Article thumbnail
Location of Repository

Optimal routing of traffic flows with length restrictions in networks with congestion

By Olaf Jahn, Rolf H. Möhring and Andreas S. Schulz

Abstract

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

Year: 1999
OAI identifier: oai:CiteSeerX.psu:10.1.1.318.1037
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://dspace.mit.edu/bitstrea... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.