IDEAS home Printed from https://ideas.repec.org/a/gam/jsusta/v14y2022i11p6931-d832660.html
   My bibliography  Save this article

Evaluating the Sustainable Traffic Flow Operational Features of U-turn Design with Advance Left Turn

Author

Listed:
  • Shengneng Hu

    (School of Civil Engineering and Communication, North China University of Water Resources and Electric Power, Zhengzhou 450011, China)

  • Zhen Jia

    (School of Civil Engineering and Communication, North China University of Water Resources and Electric Power, Zhengzhou 450011, China)

  • Anping Yang

    (School of Civil Engineering and Communication, North China University of Water Resources and Electric Power, Zhengzhou 450011, China)

  • Kui Xue

    (School of Civil Engineering and Communication, North China University of Water Resources and Electric Power, Zhengzhou 450011, China)

  • Guoqi He

    (School of Civil Engineering and Communication, North China University of Water Resources and Electric Power, Zhengzhou 450011, China)

Abstract

Median U-turn intersection treatment (MUIT) has been considered as an alternative measure to reduce congestion and traffic conflict at intersection areas, but the required spacing between the U-turn opening and the intersection limits its applicability. In this paper, a U-turn design with Advance Left Turn (UALT) is proposed with the aim of addressing the disadvantages of insufficient intersection spacing and difficulty in the continuous vehicle lane change. UALT provides a dedicated lane to advance the turning vehicle out of the intersection and directly to the U-turn opening without interacting with through traffic. The effectiveness and traffic volume applicability of UALT was demonstrated through field data investigation, simulation and analysis with VISSIM software. The proposed design was evaluated in terms of three parameters: delay, queue length and the number of stops. The results show that when the traffic volume range of the main road is (1900, 2200) pcu/h and the traffic volume of the secondary road is more than 900 pcu/h, the optimization effect of UALT on both conventional intersections and MUIT is very significant. Taking a signal-controlled intersection in Zhengzhou City, China, as an example to build a simulation model, compared with the conventional intersection and MUIT, the delay drop is reduced by 73.48% and 41.48%, the queue length is reduced by 84.85% and 41.66%, and the operation efficiency is significantly improved.

Suggested Citation

  • Shengneng Hu & Zhen Jia & Anping Yang & Kui Xue & Guoqi He, 2022. "Evaluating the Sustainable Traffic Flow Operational Features of U-turn Design with Advance Left Turn," Sustainability, MDPI, vol. 14(11), pages 1-16, June.
    • Handle: RePEc:gam:jsusta:v:14:y:2022:i:11:p:6931-:d:832660
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/14/11/6931/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2071-1050/14/11/6931/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Carey, Malachy & McCartney, Mark, 2002. "Behaviour of a whole-link travel time model used in dynamic traffic assignment," Transportation Research Part B: Methodological, Elsevier, vol. 36(1), pages 83-95, January.
    2. Farahani, Reza Zanjirani & Miandoabchi, Elnaz & Szeto, W.Y. & Rashidi, Hannaneh, 2013. "A review of urban transportation network design problems," European Journal of Operational Research, Elsevier, vol. 229(2), pages 281-302.
    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. Mengmeng Shi & Xin Tian & Xiaowen Li & Binghong Pan, 2023. "The Impact of Parallel U-Turns on Urban Intersection: Evidence from Chinese Cities," Sustainability, MDPI, vol. 15(19), pages 1-23, September.

    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. Jang, Wonjae & Ran, Bin & Choi, Keechoo, 2005. "A discrete time dynamic flow model and a formulation and solution method for dynamic route choice," Transportation Research Part B: Methodological, Elsevier, vol. 39(7), pages 593-620, August.
    2. Liang, Jinpeng & Wu, Jianjun & Gao, Ziyou & Sun, Huijun & Yang, Xin & Lo, Hong K., 2019. "Bus transit network design with uncertainties on the basis of a metro network: A two-step model framework," Transportation Research Part B: Methodological, Elsevier, vol. 126(C), pages 115-138.
    3. Yanying Li, 2008. "Short-term prediction of motorway travel time using ANPR and loop data," Journal of Forecasting, John Wiley & Sons, Ltd., vol. 27(6), pages 507-517.
    4. Weckström, Christoffer & Mladenović, Miloš N. & Kujala, Rainer & Saramäki, Jari, 2021. "Navigability assessment of large-scale redesigns in nine public transport networks: Open timetable data approach," Transportation Research Part A: Policy and Practice, Elsevier, vol. 147(C), pages 212-229.
    5. Nayan, Ashish & Wang, David Z.W., 2017. "Optimal bus transit route packaging in a privatized contracting regime," Transportation Research Part A: Policy and Practice, Elsevier, vol. 97(C), pages 146-157.
    6. David Canca & Belén Navarro-Carmona & Gabriel Villa & Alejandro Zarzo, 2023. "A Multilayer Network Approach for the Bimodal Bus–Pedestrian Line Planning Problem," Mathematics, MDPI, vol. 11(19), pages 1-36, October.
    7. Ali Najmi & Taha H. Rashidi & Alireza Abbasi & S. Travis Waller, 2017. "Reviewing the transport domain: an evolutionary bibliometrics and network analysis," Scientometrics, Springer;Akadémiai Kiadó, vol. 110(2), pages 843-865, February.
    8. Wang, Jian & He, Xiaozheng & Peeta, Srinivas & Wang, Wei, 2022. "Globally convergent line search algorithm with Euler-based step size-determination method for continuous network design problem," Transportation Research Part B: Methodological, Elsevier, vol. 163(C), pages 119-144.
    9. Amirali Zarrinmehr & Mahmoud Saffarzadeh & Seyedehsan Seyedabrishami & Yu Marco Nie, 2016. "A path-based greedy algorithm for multi-objective transit routes design with elastic demand," Public Transport, Springer, vol. 8(2), pages 261-293, September.
    10. Malachy Carey & Y. E. Ge, 2005. "Alternative Conditions for a Well-Behaved Travel Time Model," Transportation Science, INFORMS, vol. 39(3), pages 417-428, August.
    11. Barahimi, Amir Hossein & Eydi, Alireza & Aghaie, Abdolah, 2021. "Multi-modal urban transit network design considering reliability: multi-objective bi-level optimization," Reliability Engineering and System Safety, Elsevier, vol. 216(C).
    12. Huang, Wentao & Jian, Sisi & Rey, David, 2024. "Non-additive network pricing with non-cooperative mobility service providers," European Journal of Operational Research, Elsevier, vol. 318(3), pages 802-824.
    13. Harshad Khadilkar, 2017. "Data-Enabled Stochastic Modeling for Evaluating Schedule Robustness of Railway Networks," Transportation Science, INFORMS, vol. 51(4), pages 1161-1176, November.
    14. Ahern, Zeke & Paz, Alexander & Corry, Paul, 2022. "Approximate multi-objective optimization for integrated bus route design and service frequency setting," Transportation Research Part B: Methodological, Elsevier, vol. 155(C), pages 1-25.
    15. 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.
    16. Bagloee, Saeed Asadi & Sarvi, Majid & Wolshon, Brian & Dixit, Vinayak, 2017. "Identifying critical disruption scenarios and a global robustness index tailored to real life road networks," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 98(C), pages 60-81.
    17. Li, Siqiao & Zhu, Xiaoning & Shang, Pan & Wang, Li & Li, Tianqi, 2024. "Scheduling shared passenger and freight transport for an underground logistics system," Transportation Research Part B: Methodological, Elsevier, vol. 183(C).
    18. Garijo, Delia & Márquez, Alberto & Rodríguez, Natalia & Silveira, Rodrigo I., 2019. "Computing optimal shortcuts for networks," European Journal of Operational Research, Elsevier, vol. 279(1), pages 26-37.
    19. Lebing Wang & Jian Gang Jin & Gleb Sibul & Yi Wei, 2023. "Designing Metro Network Expansion: Deterministic and Robust Optimization Models," Networks and Spatial Economics, Springer, vol. 23(1), pages 317-347, March.
    20. Konstantinos Gkiotsalitis & Nitin Maslekar, 2018. "Towards transfer synchronization of regularity-based bus operations with sequential hill-climbing," Public Transport, Springer, vol. 10(2), pages 335-361, August.

    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:gam:jsusta:v:14:y:2022:i:11:p:6931-:d:832660. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.