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

Development of a Traffic Congestion Prediction and Emergency Lane Development Strategy Based on Object Detection Algorithms

Author

Listed:
  • Chaokai Zhang

    (College of Mathematics & Physics, Nanjing Tech University, Nanjing 211816, China
    College of Civil Engineering, Nanjing Tech University, Nanjing 211816, China
    Faculty of Architecture and Civil Engineering, Huaiyin Institute of Technology, Huaian 223001, China)

  • Hao Cheng

    (College of Mathematics & Physics, Nanjing Tech University, Nanjing 211816, China)

  • Rui Wu

    (College of Mathematics & Physics, Nanjing Tech University, Nanjing 211816, China
    College of Civil Engineering, Nanjing Tech University, Nanjing 211816, China)

  • Biyun Ren

    (College of Mathematics & Physics, Nanjing Tech University, Nanjing 211816, China
    School of Flexible Electronics (Future Technologies), Nanjing Tech University, Nanjing 211816, China)

  • Ye Zhu

    (Faculty of Architecture and Civil Engineering, Huaiyin Institute of Technology, Huaian 223001, China)

  • Ningbo Peng

    (College of Civil Engineering, Nanjing Tech University, Nanjing 211816, China
    Faculty of Architecture and Civil Engineering, Huaiyin Institute of Technology, Huaian 223001, China)

Abstract

With rapid economic development and a continuous increase in motor vehicle numbers, traffic congestion on highways has become increasingly severe, significantly impacting traffic efficiency and public safety. This paper proposes and investigates a traffic congestion prediction and emergency lane development strategy based on object detection algorithms. Firstly, the YOLOv11 object detection algorithm combined with the ByteTrack multi-object tracking algorithm is employed to extract traffic flow parameters—including traffic volume, speed, and density—from videos at four monitoring points on the Changshen Expressway in Nanjing City, Jiangsu Province, China. Subsequently, using an AdaBoost regression model, the traffic density of downstream road sections is predicted based on the density features of upstream sections. The model achieves a coefficient of determination R 2 of 0.968, a mean absolute error of 11.2 vehicles/km, and a root mean square error of 19.9 vehicles/km, indicating high prediction accuracy. Building on the interval occupancy rate model, this paper further analyzes the causes of traffic congestion and designs decision-making processes for the activation and deactivation of emergency lanes. By real-time monitoring and calculating the vehicle occupancy rate of the CD interval, threshold conditions for activating emergency lanes are determined. When the interval occupancy rate K C D ( t ) exceeds 80%, the emergency lane is proactively opened. This method effectively alleviates traffic congestion and reduces congestion duration. Quantitative analysis shows that after activating the emergency lane, the congestion duration in the CD section decreases from 58 min to 30 min, the peak occupancy rate drops from 1 to 0.917, and the congestion duration is shortened by 48.3%. Additionally, for the Changshen Expressway, this paper proposes two optimization points for monitoring point layout, including setting up monitoring points in downstream sections and in the middle of the CD section, to further enhance the scientific and rational management of emergency lanes. The proposed strategy not only improves the real-time extraction and prediction accuracy of traffic flow parameters but also achieves dynamic management of emergency lanes through the interval occupancy rate model, thereby alleviating highway traffic congestion. This has significant practical application value.

Suggested Citation

  • Chaokai Zhang & Hao Cheng & Rui Wu & Biyun Ren & Ye Zhu & Ningbo Peng, 2024. "Development of a Traffic Congestion Prediction and Emergency Lane Development Strategy Based on Object Detection Algorithms," Sustainability, MDPI, vol. 16(23), pages 1-25, November.
  • Handle: RePEc:gam:jsusta:v:16:y:2024:i:23:p:10232-:d:1527203
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/16/23/10232/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2071-1050/16/23/10232/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. H. W. Kuhn, 1955. "The Hungarian method for the assignment problem," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 2(1‐2), pages 83-97, March.
    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. András Frank, 2005. "On Kuhn's Hungarian Method—A tribute from Hungary," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(1), pages 2-5, February.
    2. Amit Kumar & Anila Gupta, 2013. "Mehar’s methods for fuzzy assignment problems with restrictions," Fuzzy Information and Engineering, Springer, vol. 5(1), pages 27-44, March.
    3. Parvin Ahmadi & Iman Gholampour & Mahmoud Tabandeh, 2018. "Cluster-based sparse topical coding for topic mining and document clustering," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 12(3), pages 537-558, September.
    4. Chenchen Ma & Jing Ouyang & Gongjun Xu, 2023. "Learning Latent and Hierarchical Structures in Cognitive Diagnosis Models," Psychometrika, Springer;The Psychometric Society, vol. 88(1), pages 175-207, March.
    5. Aidin Rezaeian & Hamidreza Koosha & Mohammad Ranjbar & Saeed Poormoaied, 2024. "The assignment of project managers to projects in an uncertain dynamic environment," Annals of Operations Research, Springer, vol. 341(2), pages 1107-1134, October.
    6. Tran Hoang Hai, 2020. "Estimation of volatility causality in structural autoregressions with heteroskedasticity using independent component analysis," Statistical Papers, Springer, vol. 61(1), pages 1-16, February.
    7. Caplin, Andrew & Leahy, John, 2020. "Comparative statics in markets for indivisible goods," Journal of Mathematical Economics, Elsevier, vol. 90(C), pages 80-94.
    8. Biró, Péter & Gudmundsson, Jens, 2021. "Complexity of finding Pareto-efficient allocations of highest welfare," European Journal of Operational Research, Elsevier, vol. 291(2), pages 614-628.
    9. Ana Viana & Xenia Klimentova & Péter Biró & Flip Klijn, 2021. "Shapley-Scarf Housing Markets: Respecting Improvement, Integer Programming, and Kidney Exchange," Working Papers 1235, Barcelona School of Economics.
    10. Michal Brylinski, 2014. "eMatchSite: Sequence Order-Independent Structure Alignments of Ligand Binding Pockets in Protein Models," PLOS Computational Biology, Public Library of Science, vol. 10(9), pages 1-15, September.
    11. Juan G. Carvajal-Patiño & Vincent Mallet & David Becerra & Luis Fernando Niño Vasquez & Carlos Oliver & Jérôme Waldispühl, 2025. "RNAmigos2: accelerated structure-based RNA virtual screening with deep graph learning," Nature Communications, Nature, vol. 16(1), pages 1-12, December.
    12. Chiwei Yan & Helin Zhu & Nikita Korolko & Dawn Woodard, 2020. "Dynamic pricing and matching in ride‐hailing platforms," Naval Research Logistics (NRL), John Wiley & Sons, vol. 67(8), pages 705-724, December.
    13. Fanrong Xie & Anuj Sharma & Zuoan Li, 2022. "An alternate approach to solve two-level priority based assignment problem," Computational Optimization and Applications, Springer, vol. 81(2), pages 613-656, March.
    14. Yan, Pengyu & Lee, Chung-Yee & Chu, Chengbin & Chen, Cynthia & Luo, Zhiqin, 2021. "Matching and pricing in ride-sharing: Optimality, stability, and financial sustainability," Omega, Elsevier, vol. 102(C).
    15. Vesal Kasmaeifar & Saya Sedighi & Anne-Claude Gingras & Kieran R. Campbell, 2025. "Computational design and evaluation of optimal bait sets for scalable proximity proteomics," Nature Communications, Nature, vol. 16(1), pages 1-17, December.
    16. Morrill, Thayer & Roth, Alvin E., 2024. "Top trading cycles," Journal of Mathematical Economics, Elsevier, vol. 112(C).
    17. Bo Cowgill & Jonathan M. V. Davis & B. Pablo Montagnes & Patryk Perkowski, 2025. "Stable Matching on the Job? Theory and Evidence on Internal Talent Markets," Management Science, INFORMS, vol. 71(3), pages 2508-2526, March.
    18. Guo, Yuhan & Zhang, Yu & Boulaksil, Youssef, 2021. "Real-time ride-sharing framework with dynamic timeframe and anticipation-based migration," European Journal of Operational Research, Elsevier, vol. 288(3), pages 810-828.
    19. Demetrescu, Camil & Lupia, Francesco & Mendicelli, Angelo & Ribichini, Andrea & Scarcello, Francesco & Schaerf, Marco, 2019. "On the Shapley value and its application to the Italian VQR research assessment exercise," Journal of Informetrics, Elsevier, vol. 13(1), pages 87-104.
    20. Christian Billing & Florian Jaehn & Thomas Wensing, 2020. "Fair task allocation problem," Annals of Operations Research, Springer, vol. 284(1), pages 131-146, January.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;

    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:gam:jsusta:v:16:y:2024:i:23:p:10232-:d:1527203. 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.