A dynamic partitioning method for the multilayer boundary for urban oversaturated homogeneous traffic networks based on macroscopic fundamental diagrams in connected-vehicle network
X. Lin, J. Xu, W. Zhou
Pages: 47-62
Abstract:
Macroscopic fundamental diagrams (MFD) can be used to control the boundary of saturated traffic networks at the macroscopic level, and connected-vehicle network provides new technical means for real-time access to traffic parameters.Dividing sub-areas of homogeneous traffic networks is a prerequisite for effective boundary control. At present, most sub-areas of homogeneous traffic networks can get single-layer boundary, but queuing overflow may occur at the boundary under single-layer boundary control. Therefore, it is necessary to dynamically divide the homogeneous region into the same core multi-layer boundary, which lay a foundation for the follow-up implementation of multi-layer boundary control. A dynamic partitioning method based on MFD for the control boundary of over-saturated homogeneous connected-vehicle network is proposed in this study. This method utilises set theory. A traffic networks model based on road links is established and defined as the minimum unit of the traffic networks according to MFD correlation theory and historical data. A minimum unit MFD database of the traffic networks is also created. The weighted density and the weighted flow of the minimum unit of each traffic networks can be calculated based on the trajectory of networked vehicles in connected-vehicle networking.The smallest unit in the traffic networks with the maximum weighted traffic density is the key node of the network according to the MFD database. The central key node is extended to the peripheral nodes until the boundary of the congested area of the saturated traffic networks is determined. The control boundary of the multilayer traffic networks, including the congestion area, transition zone, and normal region, is established. A simulation model of the actual traffic networks in Tianhe District of Guangzhou is established using Vissim traffic simulation software, and the MFD database is set up. Another development method is realised by using C# language. The multi-layer control boundary of the traffic networks is obtained and compared with that in actual conditions of the traffic networks on a Baidu map to verify the validity of the proposed method.
Keywords: traffic engineering; connected-vehicle Network (CVN); macroscopic fundamental diagrams(MFD); the oversaturated traffic networks; the multilayer boundary; the dynamic partitioning method; traffic simulation
2025 ISSUES
2024 ISSUES
LXII - April 2024LXIII - July 2024LXIV - November 2024Special 2024 Vol1Special 2024 Vol2Special 2024 Vol3Special 2024 Vol4
2023 ISSUES
LIX - April 2023LX - July 2023LXI - November 2023Special Issue 2023 Vol1Special Issue 2023 Vol2Special Issue 2023 Vol3
2022 ISSUES
LVI - April 2022LVII - July 2022LVIII - November 2022Special Issue 2022 Vol1Special Issue 2022 Vol2Special Issue 2022 Vol3Special Issue 2022 Vol4
2021 ISSUES
LIII - April 2021LIV - July 2021LV - November 2021Special Issue 2021 Vol1Special Issue 2021 Vol2Special Issue 2021 Vol3
2020 ISSUES
2019 ISSUES
Special Issue 2019 Vol1Special Issue 2019 Vol2Special Issue 2019 Vol3XLIX - November 2019XLVII - April 2019XLVIII - July 2019
2018 ISSUES
Special Issue 2018 Vol1Special Issue 2018 Vol2Special Issue 2018 Vol3XLIV - April 2018XLV - July 2018XLVI - November 2018
2017 ISSUES
Special Issue 2017 Vol1Special Issue 2017 Vol2Special Issue 2017 Vol3XLI - April 2017XLII - July 2017XLIII - November 2017
2016 ISSUES
Special Issue 2016 Vol1Special Issue 2016 Vol2Special Issue 2016 Vol3XL - November 2016XXXIX - July 2016XXXVIII - April 2016
2015 ISSUES
Special Issue 2015 Vol1Special Issue 2015 Vol2XXXV - April 2015XXXVI - July 2015XXXVII - November 2015
2014 ISSUES
Special Issue 2014 Vol1Special Issue 2014 Vol2Special Issue 2014 Vol3XXXII - April 2014XXXIII - July 2014XXXIV - November 2014
2013 ISSUES
2012 ISSUES
2011 ISSUES
2010 ISSUES
2009 ISSUES
2008 ISSUES
2007 ISSUES
2006 ISSUES
2005 ISSUES
2004 ISSUES
2003 ISSUES