IDEAS home Printed from https://ideas.repec.org/p/mit/sloanp/7380.html
   My bibliography  Save this paper

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

Author

Listed:
  • Jahn, Olaf
  • Möhring, Rolf
  • Schulz, Andreas
  • Stier Moses, Nicolá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.

Suggested Citation

  • Jahn, Olaf & Möhring, Rolf & Schulz, Andreas & Stier Moses, Nicolás, 2004. "System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion," Working papers 4394-02, Massachusetts Institute of Technology (MIT), Sloan School of Management.
    • Handle: RePEc:mit:sloanp:7380
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/1721.1/7380
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Kaj Holmberg & Di Yuan, 2003. "A Multicommodity Network-Flow Problem with Side Constraints on Paths Solved by Column Generation," INFORMS Journal on Computing, INFORMS, vol. 15(1), pages 42-57, February.
    2. T. Leventhal & G. Nemhauser & L. Trotter, 1973. "A Column Generation Algorithm for Optimal Traffic Assignment," Transportation Science, INFORMS, vol. 7(2), pages 168-176, May.
    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.
    4. Larsson, Torbjörn & Patriksson, Michael, 1999. "Side constrained traffic equilibrium models-- analysis, computation and applications," Transportation Research Part B: Methodological, Elsevier, vol. 33(4), pages 233-264, May.
    5. 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.
    6. Larry J. LeBlanc & Richard V. Helgason & David E. Boyce, 1985. "Improved Efficiency of the Frank-Wolfe Algorithm for Convex Network Programs," Transportation Science, INFORMS, vol. 19(4), pages 445-462, November.
    7. 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.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Olaf Jahn & Rolf H. Möhring & Andreas S. Schulz & Nicolás E. Stier-Moses, 2005. "System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion," Operations Research, INFORMS, vol. 53(4), pages 600-616, August.
    2. Chi Xie & Xing Wu & Stephen Boyles, 2019. "Traffic equilibrium with a continuously distributed bound on travel weights: the rise of range anxiety and mental account," Annals of Operations Research, Springer, vol. 273(1), pages 279-310, February.
    3. José R. Correa & Andreas S. Schulz & Nicolás E. Stier-Moses, 2004. "Selfish Routing in Capacitated Networks," Mathematics of Operations Research, INFORMS, vol. 29(4), pages 961-976, November.
    4. Larsson, Torbjörn & Patriksson, Michael & Rydergren, Clas, 2004. "A column generation procedure for the side constrained traffic equilibrium problem," Transportation Research Part B: Methodological, Elsevier, vol. 38(1), pages 17-38, January.
    5. Correa, Jose R. & Schulz, Andreas S. & Stier Moses, Nicolas E., 2003. "Selfish Routing in Capacitated Networks," Working papers 4319-03, Massachusetts Institute of Technology (MIT), Sloan School of Management.
    6. Abdelfettah Laouzai & Rachid Ouafi, 2022. "A prediction model for atmospheric pollution reduction from urban traffic," Environment and Planning B, , vol. 49(2), pages 566-584, February.
    7. Seungkyu Ryu & Anthony Chen & Xiangdong Xu & Keechoo Choi, 2014. "A Dual Approach for Solving the Combined Distribution and Assignment Problem with Link Capacity Constraints," Networks and Spatial Economics, Springer, vol. 14(2), pages 245-270, June.
    8. Xin Lin & Chris M. J. Tampère & Stef Proost, 2020. "Optimizing Traffic System Performance with Environmental Constraints: Tolls and/or Additional Delays," Networks and Spatial Economics, Springer, vol. 20(1), pages 137-177, March.
    9. Bliemer, Michiel C.J. & Raadsen, Mark P.H., 2020. "Static traffic assignment with residual queues and spillback," Transportation Research Part B: Methodological, Elsevier, vol. 132(C), pages 303-319.
    10. Wu, Xin & Nie, Lei & Xu, Meng & Yan, Fei, 2018. "A perishable food supply chain problem considering demand uncertainty and time deadline constraints: Modeling and application to a high-speed railway catering service," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 111(C), pages 186-209.
    11. Ren-Yong Guo & Hai Yang & Hai-Jun Huang & Zhijia Tan, 2016. "Day-to-Day Flow Dynamics and Congestion Control," Transportation Science, INFORMS, vol. 50(3), pages 982-997, August.
    12. Zhaoqi Zang & Xiangdong Xu & Anthony Chen & Chao Yang, 2022. "Modeling the α-max capacity of transportation networks: a single-level mathematical programming formulation," Transportation, Springer, vol. 49(4), pages 1211-1243, August.
    13. Maëlle Zimmermann & Emma Frejinger & Patrice Marcotte, 2021. "A Strategic Markovian Traffic Equilibrium Model for Capacitated Networks," Transportation Science, INFORMS, vol. 55(3), pages 574-591, May.
    14. Yildirim, Mehmet Bayram & Hearn, Donald W., 2005. "A first best toll pricing framework for variable demand traffic assignment problems," Transportation Research Part B: Methodological, Elsevier, vol. 39(8), pages 659-678, September.
    15. Bliemer, Michiel C.J. & Raadsen, Mark P.H. & Smits, Erik-Sander & Zhou, Bojian & Bell, Michael G.H., 2014. "Quasi-dynamic traffic assignment with residual point queues incorporating a first order node model," Transportation Research Part B: Methodological, Elsevier, vol. 68(C), pages 363-384.
    16. Yasushi Masuda & Akira Tsuji, 2019. "Congestion Control for a System with Parallel Stations and Homogeneous Customers Using Priority Passes," Networks and Spatial Economics, Springer, vol. 19(1), pages 293-318, March.
    17. Graf, Lukas & Harks, Tobias & Palkar, Prashant, 2025. "Dynamic traffic assignment for electric vehicles," Transportation Research Part B: Methodological, Elsevier, vol. 195(C).
    18. Lv, Si & Wei, Zhinong & Chen, Sheng & Sun, Guoqiang & Wang, Dan, 2021. "Integrated demand response for congestion alleviation in coupled power and transportation networks," Applied Energy, Elsevier, vol. 283(C).
    19. Han, Sangjin, 2007. "A route-based solution algorithm for dynamic user equilibrium assignments," Transportation Research Part B: Methodological, Elsevier, vol. 41(10), pages 1094-1113, December.
    20. Michael Patriksson & R. Tyrrell Rockafellar, 2002. "A Mathematical Model and Descent Algorithm for Bilevel Traffic Management," Transportation Science, INFORMS, vol. 36(3), pages 271-291, August.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;
    ;

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:mit:sloanp:7380. See general information about how to correct material in RePEc.

    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 CitEc recognized a bibliographic reference but did not link an item in RePEc 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: None The email address of this maintainer does not seem to be valid anymore. Please ask None to update the entry or send us the correct address (email available below). General contact details of provider: https://edirc.repec.org/data/ssmitus.html .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.