IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v5y1971i4p366-389.html
   My bibliography  Save this article

An Extended Traffic Assignment Model with Applications to Two-Way Traffic

Author

Listed:
  • Stella C. Dafermos

    (Department of Operations Research Cornell University Ithaca, New York)

Abstract

A transportation network is considered. The traffic demands associated with pairs of nodes and the traveling cost functions associated with the links are assumed given. An extended traffic assignment model where the traveling cost on a link becomes a function of the entire flow pattern in the network is introduced. The model appears particularly suitable for application to networks containing two-way streets, in view of its capability of taking into account delays to travelers of one lane caused by traffic on the opposite lane. It is also suitable for application to urban transportation networks, where the travel time on a link depends crucially on the delays occurring at the intersections. This in turn depends on the traffic volumes on the intersecting links. The concepts of system-optimizing and user-optimizing traffic patterns are studied. Moreover, an algorithm for the construction of the above patterns is presented and applied in an example.

Suggested Citation

  • Stella C. Dafermos, 1971. "An Extended Traffic Assignment Model with Applications to Two-Way Traffic," Transportation Science, INFORMS, vol. 5(4), pages 366-389, November.
    • Handle: RePEc:inm:ortrsc:v:5:y:1971:i:4:p:366-389
    DOI: 10.1287/trsc.5.4.366
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.5.4.366
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.5.4.366?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Zheng, Hong & Peeta, Srinivas, 2014. "Cost scaling based successive approximation algorithm for the traffic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 68(C), pages 17-30.
    2. Vo, Khoa D. & Lam, William H.K. & Chen, Anthony & Shao, Hu, 2020. "A household optimum utility approach for modeling joint activity-travel choices in congested road networks," Transportation Research Part B: Methodological, Elsevier, vol. 134(C), pages 93-125.
    3. Karakostas, George & Kim, Taeyon & Viglas, Anastasios & Xia, Hao, 2011. "On the degradation of performance for traffic networks with oblivious users," Transportation Research Part B: Methodological, Elsevier, vol. 45(2), pages 364-371, February.
    4. Nie, Yu (Marco), 2010. "A class of bush-based algorithms for the traffic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 44(1), pages 73-89, January.
    5. Cantarella, Giulio Erberto & Cartenì, Armando & de Luca, Stefano, 2015. "Stochastic equilibrium assignment with variable demand: Theoretical and implementation issues," European Journal of Operational Research, Elsevier, vol. 241(2), pages 330-347.
    6. Oran Richman & Nahum Shimkin, 2007. "Topological Uniqueness of the Nash Equilibrium for Selfish Routing with Atomic Users," Mathematics of Operations Research, INFORMS, vol. 32(1), pages 215-232, February.
    7. D E Boyce, 1984. "Urban Transportation Network-Equilibrium and Design Models: Recent Achievements and Future Prospects," Environment and Planning A, , vol. 16(11), pages 1445-1474, November.
    8. Florian, Michael, 1976. "Urban Travel Demand Models and Multi-Modal Traffic Equilibrium," Transportation Research Forum Proceedings 1970s 318523, Transportation Research Forum.
    9. Sanjiv Kapoor & Junghwan Shin, 2020. "Price of Anarchy in Networks with Heterogeneous Latency Functions," Mathematics of Operations Research, INFORMS, vol. 45(2), pages 755-773, May.
    10. M Florian, 1982. "Letter to the Editor," Environment and Planning A, , vol. 14(2), pages 265-267, February.
    11. Watling, David, 1996. "Asymmetric problems and stochastic process models of traffic assignment," Transportation Research Part B: Methodological, Elsevier, vol. 30(5), pages 339-357, October.
    12. Liu, Haoxiang & Wang, David Z.W., 2017. "Locating multiple types of charging facilities for battery electric vehicles," Transportation Research Part B: Methodological, Elsevier, vol. 103(C), pages 30-55.
    13. Liu, Yang & Nie, Yu (Marco) & Hall, Jonathan, 2015. "A semi-analytical approach for solving the bottleneck model with general user heterogeneity," Transportation Research Part B: Methodological, Elsevier, vol. 71(C), pages 56-70.
    14. Joaquín De Cea & J. Enrique Fernández & Valérie Dekock & Alexandra Soto, 2004. "Solving network equilibrium problems on multimodal urban transportation networks with multiple user classes," Transport Reviews, Taylor & Francis Journals, vol. 25(3), pages 293-317, January.
    15. Wen-Long Jin, 2015. "Advances in Dynamic Traffic Assgmnt: TAC," Networks and Spatial Economics, Springer, vol. 15(3), pages 617-634, September.
    16. David Boyce, 2007. "Forecasting Travel on Congested Urban Transportation Networks: Review and Prospects for Network Equilibrium Models," Networks and Spatial Economics, Springer, vol. 7(2), pages 99-128, June.
    17. Bliemer, Michiel C. J. & Bovy, Piet H. L., 2003. "Quasi-variational inequality formulation of the multiclass dynamic traffic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 37(6), pages 501-519, July.
    18. Nagurney, Anna, 2010. "Optimal supply chain network design and redesign at minimal total cost and with demand satisfaction," International Journal of Production Economics, Elsevier, vol. 128(1), pages 200-208, November.

    More about this item

    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:inm:ortrsc:v:5:y:1971:i:4:p:366-389. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.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.