IDEAS home Printed from https://ideas.repec.org/a/hin/jnddns/162128.html
   My bibliography  Save this article

Nonlinear Min-Cost-Pursued Route-Swapping Dynamic System

Author

Listed:
  • Wenyi Zhang
  • Wei Guan
  • Jihui Ma
  • Tao Wang

Abstract

This study proposes a nonlinear min-cost-pursued swapping dynamic (NMSD) system to model the evolution of selfish routing games on traffic network where travelers only swap from previous costly routes to the least costly ones. NMSD is a rational behavior adjustment process with stationary link flow pattern being the Wardrop user equilibrium. NMSD is able to prevent two behavioral deficiencies suffered by the existing min-cost-oriented models and keep solution invariance. NMSD relaxes the homogeneous user assumption, and the continuous-time NMSD (CNMSD) and discrete-time NMSD (DNMSD) share the same revision protocol. Moreover, CNMSD is Lyapunov-stable. Two numerical examples are conducted. The first one is designed to characterize the NMSD-conducted network traffic evolution and test the stability of day-to-day NMSD. The second one aims to explore the impacts of network scale on the stability of route-swaps conducted by pairwise and min-cost-pursed swapping behaviors.

Suggested Citation

  • Wenyi Zhang & Wei Guan & Jihui Ma & Tao Wang, 2013. "Nonlinear Min-Cost-Pursued Route-Swapping Dynamic System," Discrete Dynamics in Nature and Society, Hindawi, vol. 2013, pages 1-10, May.
    • Handle: RePEc:hin:jnddns:162128
    DOI: 10.1155/2013/162128
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/DDNS/2013/162128.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/DDNS/2013/162128.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2013/162128?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
    ---><---

    References listed on IDEAS

    as
    1. Huang, Hai-Jun & Lam, William H. K., 2002. "Modeling and solving the dynamic user equilibrium route and departure time choice problem in network with queues," Transportation Research Part B: Methodological, Elsevier, vol. 36(3), pages 253-273, March.
    2. Zhang, Ding & Nagurney, Anna & Wu, Jiahao, 2001. "On the equivalence between stationary link flow patterns and traffic network equilibria," Transportation Research Part B: Methodological, Elsevier, vol. 35(8), pages 731-748, September.
    3. Yang, Fan & Zhang, Ding, 2009. "Day-to-day stationary link flow pattern," Transportation Research Part B: Methodological, Elsevier, vol. 43(1), pages 119-126, January.
    4. Smith, Mike & Mounce, Richard, 2011. "A splitting rate model of traffic re-routeing and traffic control," Transportation Research Part B: Methodological, Elsevier, vol. 45(9), pages 1389-1409.
    5. Michael J. Smith, 1984. "The Stability of a Dynamic Model of Traffic Assignment---An Application of a Method of Lyapunov," Transportation Science, INFORMS, vol. 18(3), pages 245-252, August.
    6. Mounce, Richard & Carey, Malachy, 2011. "Route swapping in dynamic traffic networks," Transportation Research Part B: Methodological, Elsevier, vol. 45(1), pages 102-111, January.
    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. Han, Linghui & Wang, David Z.W. & Lo, Hong K. & Zhu, Chengjuan & Cai, Xingju, 2017. "Discrete-time day-to-day dynamic congestion pricing scheme considering multiple equilibria," Transportation Research Part B: Methodological, Elsevier, vol. 104(C), pages 1-16.
    2. Peeta, Srinivas, 2016. "A marginal utility day-to-day traffic evolution model based on one-step strategic thinkingAuthor-Name: He, Xiaozheng," Transportation Research Part B: Methodological, Elsevier, vol. 84(C), pages 237-255.
    3. 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.
    4. Wen-yi Zhang & Wei Guan & Ji-hui Ma & Jun-fang Tian, 2015. "A Nonlinear Pairwise Swapping Dynamics to Model the Selfish Rerouting Evolutionary Game," Networks and Spatial Economics, Springer, vol. 15(4), pages 1075-1092, December.
    5. Kumar, Amit & Peeta, Srinivas, 2015. "A day-to-day dynamical model for the evolution of path flows under disequilibrium of traffic networks with fixed demand," Transportation Research Part B: Methodological, Elsevier, vol. 80(C), pages 235-256.
    6. Ren-Yong Guo & Hai-Jun Huang & Hai Yang, 2019. "Tradable Credit Scheme for Control of Evolutionary Traffic Flows to System Optimum: Model and its Convergence," Networks and Spatial Economics, Springer, vol. 19(3), pages 833-868, September.
    7. 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.
    8. Ye, Hongbo & Xiao, Feng & Yang, Hai, 2021. "Day-to-day dynamics with advanced traveler information," Transportation Research Part B: Methodological, Elsevier, vol. 144(C), pages 23-44.
    9. Iryo, Takamasa, 2019. "Instability of departure time choice problem: A case with replicator dynamics," Transportation Research Part B: Methodological, Elsevier, vol. 126(C), pages 353-364.
    10. Liu, Peng & Liao, Feixiong & Tian, Qiong & Huang, Hai-Jun & Timmermans, Harry, 2020. "Day-to-day needs-based activity-travel dynamics and equilibria in multi-state supernetworks," Transportation Research Part B: Methodological, Elsevier, vol. 132(C), pages 208-227.
    11. Ren-Yong Guo & Hai Yang & Hai-Jun Huang, 2018. "Are We Really Solving the Dynamic Traffic Equilibrium Problem with a Departure Time Choice?," Transportation Science, INFORMS, vol. 52(3), pages 603-620, June.
    12. Liu, Ronghui & Smith, Mike, 2015. "Route choice and traffic signal control: A study of the stability and instability of a new dynamical model of route choice and traffic signal control," Transportation Research Part B: Methodological, Elsevier, vol. 77(C), pages 123-145.
    13. Lie Han, 2022. "Proportional-Switch Adjustment Process with Elastic Demand and Congestion Toll in the Absence of Demand Functions," Networks and Spatial Economics, Springer, vol. 22(4), pages 709-735, December.
    14. Hongbo Ye & Hai Yang, 2017. "Rational Behavior Adjustment Process with Boundedly Rational User Equilibrium," Transportation Science, INFORMS, vol. 51(3), pages 968-980, August.
    15. Xu, Xiangdong & Qu, Kai & Chen, Anthony & Yang, Chao, 2021. "A new day-to-day dynamic network vulnerability analysis approach with Weibit-based route adjustment process," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 153(C).
    16. Iryo, Takamasa & Watling, David, 2019. "Properties of equilibria in transport problems with complex interactions between users," Transportation Research Part B: Methodological, Elsevier, vol. 126(C), pages 87-114.
    17. He, Xiaozheng & Guo, Xiaolei & Liu, Henry X., 2010. "A link-based day-to-day traffic assignment model," Transportation Research Part B: Methodological, Elsevier, vol. 44(4), pages 597-608, May.
    18. Ding, Hongxing & Yang, Hai & Xu, Hongli & Li, Ting, 2023. "Status quo-dependent user equilibrium model with adaptive value of time," Transportation Research Part B: Methodological, Elsevier, vol. 170(C), pages 77-90.
    19. Guo, Ren-Yong & Szeto, W.Y., 2018. "Day-to-day modal choice with a Pareto improvement or zero-sum revenue scheme," Transportation Research Part B: Methodological, Elsevier, vol. 110(C), pages 1-25.
    20. Wang, Jian & He, Xiaozheng & Peeta, Srinivas, 2016. "Sensitivity analysis based approximation models for day-to-day link flow evolution process," Transportation Research Part B: Methodological, Elsevier, vol. 92(PA), pages 35-53.

    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:hin:jnddns:162128. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.