IDEAS home Printed from https://ideas.repec.org/a/kap/netspa/v15y2015i3p617-634.html
   My bibliography  Save this article

Advances in Dynamic Traffic Assgmnt: TAC

Author

Listed:
  • Wen-Long Jin

Abstract

Traditionally traffic assignment problems (TAPs) have been formulated as non-cooperative games (NCGs), and Wardrop’s user equilibrium (UE) of a TAP as Nash equilibrium (NE) of the corresponding NCG. In this study, in contrast, we propose a mapping from finite NCGs (F-NCGs) to asymmetric TAPs (A-TAPs) on a two-way or urban network, in which the travel cost of one link depends on flows on other links. With the help of three route-based formulations of UE, we show that NE of an F-NCG is equivalent to UE of the corresponding A-TAP. Based on the new relationship, we extend Nash’s fixed point formulation of NE to prove the existence of static UE. This study provides a more complete picture of the relationships between NCGs and TAPs. In the future we will be interested in studying Nash’s fixed point formulation for dynamic UE. Copyright Springer Science+Business Media New York 2015

Suggested Citation

  • Wen-Long Jin, 2015. "Advances in Dynamic Traffic Assgmnt: TAC," Networks and Spatial Economics, Springer, vol. 15(3), pages 617-634, September.
    • Handle: RePEc:kap:netspa:v:15:y:2015:i:3:p:617-634
    DOI: 10.1007/s11067-014-9250-x
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s11067-014-9250-x
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s11067-014-9250-x?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Sandholm, William H., 2001. "Potential Games with Continuous Player Sets," Journal of Economic Theory, Elsevier, vol. 97(1), pages 81-108, March.
    2. Carlos F. Daganzo, 1998. "Queue Spillovers in Transportation Networks with a Route Choice," Transportation Science, INFORMS, vol. 32(1), pages 3-11, February.
    3. Heydecker, B. G., 1986. "On the definition of traffic equilibrium," Transportation Research Part B: Methodological, Elsevier, vol. 20(6), pages 435-440, December.
    4. Robert Gibbons, 1997. "An Introduction to Applicable Game Theory," Journal of Economic Perspectives, American Economic Association, vol. 11(1), pages 127-149, Winter.
    5. Smith, M. J., 1984. "Two alternative definitions of traffic equilibrium," Transportation Research Part B: Methodological, Elsevier, vol. 18(1), pages 63-65, February.
    6. Iryo, Takamasa, 2011. "Multiple equilibria in a dynamic traffic network," Transportation Research Part B: Methodological, Elsevier, vol. 45(6), pages 867-879, July.
    7. Devarajan, Shantayanan, 1981. "A note of network equilibrium and noncooperative games," Transportation Research Part B: Methodological, Elsevier, vol. 15(6), pages 421-426, December.
    8. Jin, Wen-Long, 2007. "A dynamical system model of the traffic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 41(1), pages 32-48, January.
    9. Stella Dafermos, 1980. "Traffic Equilibrium and Variational Inequalities," Transportation Science, INFORMS, vol. 14(1), pages 42-54, February.
    10. Yang, Hai & Huang, Hai-Jun, 2004. "The multi-class, multi-criteria traffic network equilibrium and systems optimum problem," Transportation Research Part B: Methodological, Elsevier, vol. 38(1), pages 1-15, January.
    11. MERCHANT, Deepak K. & NEMHAUSER, George L., 1978. "A model and an algorithm for the dynamic traffic assignment problems," LIDAM Reprints CORE 346, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    12. Smith, M. J., 1979. "The existence, uniqueness and stability of traffic equilibria," Transportation Research Part B: Methodological, Elsevier, vol. 13(4), pages 295-304, December.
    13. 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.
    14. Milchtaich, Igal, 2004. "Social optimality and cooperation in nonatomic congestion games," Journal of Economic Theory, Elsevier, vol. 114(1), pages 56-87, January.
    15. 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.
    16. David E. Boyce & Hani S. Mahmassani & Anna Nagurney, 2005. "A retrospective on Beckmann, McGuire and Winsten's Studies in the Economics of Transportation," Papers in Regional Science, Wiley Blackwell, vol. 84(1), pages 85-103, March.
    17. Stella C. Dafermos, 1972. "The Traffic Assignment Problem for Multiclass-User Transportation Networks," Transportation Science, INFORMS, vol. 6(1), pages 73-87, February.
    18. Carlos F. Daganzo & Yosef Sheffi, 1977. "On Stochastic Models of Traffic Assignment," Transportation Science, INFORMS, vol. 11(3), pages 253-274, August.
    19. SCHMEIDLER, David, 1973. "Equilibrium points of nonatomic games," LIDAM Reprints CORE 146, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    20. Patrice Marcotte & Laura Wynter, 2004. "A New Look at the Multiclass Network Equilibrium Problem," Transportation Science, INFORMS, vol. 38(3), pages 282-292, August.
    21. David Bernstein & Tony E. Smith, 1994. "Equilibria for Networks with Lower Semicontinuous Costs: With an Application to Congestion Pricing," Transportation Science, INFORMS, vol. 28(3), pages 221-235, August.
    22. Deepak K. Merchant & George L. Nemhauser, 1978. "A Model and an Algorithm for the Dynamic Traffic Assignment Problems," Transportation Science, INFORMS, vol. 12(3), pages 183-199, August.
    23. Han, Ke & Friesz, Terry L. & Yao, Tao, 2013. "Existence of simultaneous route and departure choice dynamic user equilibrium," Transportation Research Part B: Methodological, Elsevier, vol. 53(C), pages 17-30.
    24. Smith, M. J., 1979. "Traffic control and route-choice; a simple example," Transportation Research Part B: Methodological, Elsevier, vol. 13(4), pages 289-294, December.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. 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.

    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. Berliant, Marcus, 2017. "Commuting and internet traffic congestion," MPRA Paper 77378, University Library of Munich, Germany.
    2. Jiang, Chenming & Bhat, Chandra R. & Lam, William H.K., 2020. "A bibliometric overview of Transportation Research Part B: Methodological in the past forty years (1979–2019)," Transportation Research Part B: Methodological, Elsevier, vol. 138(C), pages 268-291.
    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. Guo, Ren-Yong & Yang, Hai & Huang, Hai-Jun & Tan, Zhijia, 2015. "Link-based day-to-day network traffic dynamics and equilibria," Transportation Research Part B: Methodological, Elsevier, vol. 71(C), pages 248-260.
    5. Watling, David, 1998. "Perturbation stability of the asymmetric stochastic equilibrium assignment model," Transportation Research Part B: Methodological, Elsevier, vol. 32(3), pages 155-171, April.
    6. 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.
    7. 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.
    8. Robin Lindsey, 2004. "Existence, Uniqueness, and Trip Cost Function Properties of User Equilibrium in the Bottleneck Model with Multiple User Classes," Transportation Science, INFORMS, vol. 38(3), pages 293-314, August.
    9. Moore, II, James E. & Kim, Geunyoung & Cho, Seongdil & Hu, Hsi-hwa & Xu, Rong, 1997. "Evaluating System ATMIS Technologies Via Rapid Estimation Of Network Flows: Final Report," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt5c70f3d9, Institute of Transportation Studies, UC Berkeley.
    10. E. Nikolova & N. E. Stier-Moses, 2014. "A Mean-Risk Model for the Traffic Assignment Problem with Stochastic Travel Times," Operations Research, INFORMS, vol. 62(2), pages 366-382, April.
    11. Fernando Ordóñez & Nicolás E. Stier-Moses, 2010. "Wardrop Equilibria with Risk-Averse Users," Transportation Science, INFORMS, vol. 44(1), pages 63-86, February.
    12. Anna Nagurney & Ding Zhang, "undated". "Massively Parallel Computation of Dynamic Traffic Problems Modeled as Projected Dynamical Systems," Computing in Economics and Finance 1996 _039, Society for Computational Economics.
    13. G. E. Cantarella & D. P. Watling, 2016. "Modelling road traffic assignment as a day-to-day dynamic, deterministic process: a unified approach to discrete- and continuous-time models," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 5(1), pages 69-98, March.
    14. 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.
    15. 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.
    16. Farokhi, Farhad & Johansson, Karl H., 2015. "A piecewise-constant congestion taxing policy for repeated routing games," Transportation Research Part B: Methodological, Elsevier, vol. 78(C), pages 123-143.
    17. D. Zhang & A. Nagurney, 1997. "Formulation, Stability, and Computation of Traffic Network Equilibria as Projected Dynamical Systems," Journal of Optimization Theory and Applications, Springer, vol. 93(2), pages 417-444, May.
    18. Tong, C. O. & Wong, S. C., 2000. "A predictive dynamic traffic assignment model in congested capacity-constrained road networks," Transportation Research Part B: Methodological, Elsevier, vol. 34(8), pages 625-644, November.
    19. Nagurney, Anna & Zhang, Ding, 1998. "A massively parallel implementation of a discrete-time algorithm for the computation of dynamic elastic demand traffic problems modeled as projected dynamical systems," Journal of Economic Dynamics and Control, Elsevier, vol. 22(8-9), pages 1467-1485, August.
    20. 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.

    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:kap:netspa:v:15:y:2015:i:3:p:617-634. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.