IDEAS home Printed from https://ideas.repec.org/a/eee/chsofr/v181y2024ics0960077924001565.html
   My bibliography  Save this article

Understanding route choice behaviors' impact on traffic throughput in a dynamic transportation network

Author

Listed:
  • Liu, Gang
  • He, Jing
  • Luo, Zhiyong
  • Yao, Xiaobai
  • Fan, Qinjin

Abstract

Route planning is one of the most important and attractive topics in complex networks, geographical information science (GIS) and logistics. Travelers' route choice behaviors may affect the actual throughput of a transportation network. This study aims to analyze the influence of travelers' route choice behaviors on network traffic throughput. Two kinds of route choice behaviors, called continuous optimization behavior and hybrid optimization behavior, are defined. Based on this, two traffic scenarios are constructed to describe these behaviors and examine their effect on the network's actual traffic throughput. The application of our approach to urban street networks, Barabási-Albert scale-free network and Erdös-Rényi random network demonstrates that if all travelers choose optimal paths constraint with time from the start, network throughput is insensitive to the continuous optimization behavior but depends on the relationship between time and distance in the routing algorithm. Besides, network throughput is sensitive to the hybrid optimization behavior that the more travelers choose time-dependent optimal paths, the higher the throughput. The results indicate that the choice of initial paths and the time dependence of routing algorithms can directly affect the network's actual throughput which is enhanced >50 % when the time dependence parameter is >0.2 or the proportion of time-dependent shortest paths in initial paths is >0.2. Our findings provide supports for exploring efficient routing algorithms to enhance the throughput of urban street networks and other kinds of networks.

Suggested Citation

  • Liu, Gang & He, Jing & Luo, Zhiyong & Yao, Xiaobai & Fan, Qinjin, 2024. "Understanding route choice behaviors' impact on traffic throughput in a dynamic transportation network," Chaos, Solitons & Fractals, Elsevier, vol. 181(C).
    • Handle: RePEc:eee:chsofr:v:181:y:2024:i:c:s0960077924001565
    DOI: 10.1016/j.chaos.2024.114605
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0960077924001565
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.chaos.2024.114605?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. John Matthews & Geoffrey Turnbull, 2007. "Neighborhood Street Layout and Property Value: The Interaction of Accessibility and Land Use Mix," The Journal of Real Estate Finance and Economics, Springer, vol. 35(2), pages 111-141, August.
    2. Suvrajeet Sen & Rekha Pillai & Shirish Joshi & Ajay K. Rathi, 2001. "A Mean-Variance Model for Route Guidance in Advanced Traveler Information Systems," Transportation Science, INFORMS, vol. 35(1), pages 37-49, February.
    3. Kawamoto, Hiroki & Igarashi, Akito, 2012. "Efficient packet routing strategy in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(3), pages 895-904.
    4. Tarun Rambha & Stephen D. Boyles & S. Travis Waller, 2016. "Adaptive Transit Routing in Stochastic Time-Dependent Networks," Transportation Science, INFORMS, vol. 50(3), pages 1043-1059, August.
    5. Yueyue Fan & Yu Nie, 2006. "Optimal Routing for Maximizing the Travel Time Reliability," Networks and Spatial Economics, Springer, vol. 6(3), pages 333-344, September.
    6. Ampol Karoonsoontawong & Onwasa Kobkiattawin & Chi Xie, 2019. "Efficient Insertion Heuristic Algorithms for Multi-Trip Inventory Routing Problem with Time Windows, Shift Time Limits and Variable Delivery Time," Networks and Spatial Economics, Springer, vol. 19(2), pages 331-379, June.
    7. Chen, Jie & Cao, Jinde & Huang, Wei, 2023. "Traffic-driven explosive synchronization with adaptive local routing in complex networks," Chaos, Solitons & Fractals, Elsevier, vol. 168(C).
    8. Liu, Gang & Li, Yongshu & Guo, Jiawei & Li, Zheng, 2015. "Maximum transport capacity of a network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 432(C), pages 315-320.
    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. Muskan Verma & Arvind Kumar Gupta & Sapna Sharma, 2024. "Traffic flow dynamics and oscillation control in conserved fractal networks," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 97(10), pages 1-12, October.
    2. Yang, Jinling & Chen, Zhiwei & Criado, Regino & Zhang, Shenggui, 2024. "A mathematical framework for shortest path length computation in multi-layer networks with inter-edge weighting and dynamic inter-edge weighting: The case of the Beijing bus network, China," Chaos, Solitons & Fractals, Elsevier, vol. 182(C).

    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. Nie, Yu (Marco) & Wu, Xing & Dillenburg, John F. & Nelson, Peter C., 2012. "Reliable route guidance: A case study from Chicago," Transportation Research Part A: Policy and Practice, Elsevier, vol. 46(2), pages 403-419.
    2. Bi Chen & William Lam & Agachai Sumalee & Qingquan Li & Hu Shao & Zhixiang Fang, 2013. "Finding Reliable Shortest Paths in Road Networks Under Uncertainty," Networks and Spatial Economics, Springer, vol. 13(2), pages 123-148, June.
    3. Shahabi, Mehrdad & Unnikrishnan, Avinash & Boyles, Stephen D., 2013. "An outer approximation algorithm for the robust shortest path problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 58(C), pages 52-66.
    4. Mohammad Hossein Keyhani & Mathias Schnee & Karsten Weihe, 2017. "Arrive in Time by Train with High Probability," Transportation Science, INFORMS, vol. 51(4), pages 1122-1137, November.
    5. Yu Nie & Xing Wu & Tito Homem-de-Mello, 2012. "Optimal Path Problems with Second-Order Stochastic Dominance Constraints," Networks and Spatial Economics, Springer, vol. 12(4), pages 561-587, December.
    6. A. Arun Prakash & Karthik K. Srinivasan, 2017. "Finding the Most Reliable Strategy on Stochastic and Time-Dependent Transportation Networks: A Hypergraph Based Formulation," Networks and Spatial Economics, Springer, vol. 17(3), pages 809-840, September.
    7. Redmond, Michael & Campbell, Ann Melissa & Ehmke, Jan Fabian, 2022. "Reliability in public transit networks considering backup itineraries," European Journal of Operational Research, Elsevier, vol. 300(3), pages 852-864.
    8. Nie, Yu (Marco) & Wu, Xing, 2009. "Shortest path problem considering on-time arrival probability," Transportation Research Part B: Methodological, Elsevier, vol. 43(6), pages 597-613, July.
    9. Paulsen, Mads & Rasmussen, Thomas Kjær & Nielsen, Otto Anker, 2021. "Impacts of real-time information levels in public transport: A large-scale case study using an adaptive passenger path choice model," Transportation Research Part A: Policy and Practice, Elsevier, vol. 148(C), pages 155-182.
    10. Rostami, Borzou & Chassein, André & Hopf, Michael & Frey, Davide & Buchheim, Christoph & Malucelli, Federico & Goerigk, Marc, 2018. "The quadratic shortest path problem: complexity, approximability, and solution methods," European Journal of Operational Research, Elsevier, vol. 268(2), pages 473-485.
    11. Yang, Lixing & Zhou, Xuesong, 2017. "Optimizing on-time arrival probability and percentile travel time for elementary path finding in time-dependent transportation networks: Linear mixed integer programming reformulations," Transportation Research Part B: Methodological, Elsevier, vol. 96(C), pages 68-91.
    12. Ricardo Gatica & Pablo Miranda, 2011. "Special Issue on Latin-American Research: A Time Based Discretization Approach for Ship Routing and Scheduling with Variable Speed," Networks and Spatial Economics, Springer, vol. 11(3), pages 465-485, September.
    13. Hao Hu & Renata Sotirov, 2020. "On Solving the Quadratic Shortest Path Problem," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 219-233, April.
    14. Hao Hu & Renata Sotirov, 2021. "The linearization problem of a binary quadratic problem and its applications," Annals of Operations Research, Springer, vol. 307(1), pages 229-249, December.
    15. Matthias Ruß & Gunther Gust & Dirk Neumann, 2021. "The Constrained Reliable Shortest Path Problem in Stochastic Time-Dependent Networks," Operations Research, INFORMS, vol. 69(3), pages 709-726, May.
    16. Zhang, Junfeng & Ma, Jinlong & Li, Hui-Jia, 2022. "An efficient link closing strategy for improving traffic capacity on scale-free networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 604(C).
    17. Yunes Almansoub & Ming Zhong & Asif Raza & Muhammad Safdar & Abdelghani Dahou & Mohammed A. A. Al-qaness, 2022. "Exploring the Effects of Transportation Supply on Mixed Land-Use at the Parcel Level," Land, MDPI, vol. 11(6), pages 1-28, May.
    18. Aaron Swoboda & Tsegaye Nega & Maxwell Timm, 2015. "Hedonic Analysis Over Time And Space: The Case Of House Prices And Traffic Noise," Journal of Regional Science, Wiley Blackwell, vol. 55(4), pages 644-670, September.
    19. Phaneuf, Daniel J. & Liu, Xiangping, 2016. "Disentangling property value impacts of environmental contamination from locally undesirable land uses: Implications for measuring post-cleanup stigmaAuthor-Name: Taylor, Laura O," Journal of Urban Economics, Elsevier, vol. 93(C), pages 85-98.
    20. Park, Alex & Lappas, Petros, 2017. "Evaluating demand charge reduction for commercial-scale solar PV coupled with battery storage," Renewable Energy, Elsevier, vol. 108(C), pages 523-532.

    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:eee:chsofr:v:181:y:2024:i:c:s0960077924001565. 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: Thayer, Thomas R. (email available below). General contact details of provider: https://www.journals.elsevier.com/chaos-solitons-and-fractals .

    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.