Advanced Search
MyIDEAS: Login

System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion

Contents:

Author Info

  • Jahn, Olaf
  • Möhring, Rolf
  • Schulz, Andreas
  • Stier Moses, Nicolás
Registered author(s):

    Abstract

    The design of route-guidance systems faces a well-known dilemma. The approach that theoretically yields the system-optimal traffic pattern may discriminate against some users, for the sake of favoring others. Proposed alternate models, however, do not directly address the system perspective and may result in inferior performance. We propose a novel model and corresponding algorithms to resolve this dilemma. We present computational results on real-world instances and compare the new approach with the well-established traffic assignment model. The quintessence is that system-optimal routing of traffic flow with explicit integration of user constraints leads to a better performance than the user equilibrium while simultaneously guaranteeing a superior fairness compared to the pure system optimum.

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL: http://hdl.handle.net/1721.1/7380
    Download Restriction: no

    Bibliographic Info

    Paper provided by Massachusetts Institute of Technology (MIT), Sloan School of Management in its series Working papers with number 4394-02.

    as in new window
    Length:
    Date of creation: 10 Dec 2004
    Date of revision:
    Handle: RePEc:mit:sloanp:7380

    Contact details of provider:
    Postal: MASSACHUSETTS INSTITUTE OF TECHNOLOGY (MIT), SLOAN SCHOOL OF MANAGEMENT, 50 MEMORIAL DRIVE CAMBRIDGE MASSACHUSETTS 02142 USA
    Phone: 617-253-2659
    Web page: http://mitsloan.mit.edu/
    More information through EDIRC

    Order Information:
    Postal: MASSACHUSETTS INSTITUTE OF TECHNOLOGY (MIT), SLOAN SCHOOL OF MANAGEMENT, 50 MEMORIAL DRIVE CAMBRIDGE MASSACHUSETTS 02142 USA

    Related research

    Keywords: Intelligent Transportation Systems; Route Guidance; Traffic Flow; System Optimum; User Equilibrium; Multicommodity Flow; Constrained Shortest Path;

    This paper has been announced in the following NEP Reports:

    References

    References listed on IDEAS
    Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
    as in new window
    1. Papageorgiou, Markos, 1990. "Dynamic modeling, assignment, and route guidance in traffic networks," Transportation Research Part B: Methodological, Elsevier, vol. 24(6), pages 471-495, December.
    2. Yang, Hai & Yagar, Sam, 1994. "Traffic assignment and traffic control in general freeway-arterial corridor systems," Transportation Research Part B: Methodological, Elsevier, vol. 28(6), pages 463-486, December.
    3. Larsson, Torbjörn & Patriksson, Michael, 1995. "An augmented lagrangean dual algorithm for link capacity side constrained traffic assignment problems," Transportation Research Part B: Methodological, Elsevier, vol. 29(6), pages 433-455, December.
    Full references (including those not matched with items on IDEAS)

    Citations

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    When requesting a correction, please mention this item's handle: RePEc:mit:sloanp:7380. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Christian Zimmermann).

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.