Study of urban traffic planning model based on impedance matching of complex road networks
L.D. Niu, L.R. Xiong, G.J. Jim
Pages: 117-128
Abstract:
In the current urban traffic planning models, the impedance of complex road networks is not matched, resulting in relatively low model accuracy and failure to alleviate traffic congestion. In order to solve this problem, an urban traffic planning model based on impedance matching of complex road networks is constructed. Firstly, the impedance matching technology of a complex road network was studied; the weight coefficient of impedance feature information detection was calculated by sampling impedance feature information of the complex road network and considering the vehicle density in road segments in the complex road network, and the impedance feature information was detected according to the weight coefficient, so as to complete impedance matching of the complex road network. The total error rate during impedance matching of the complex road network was predicated, and optimal optimization was performed to the impedance matching results of the complex road network according to the detection results of impedance feature information to track the impedance matching results of the complex road network and ensure the matching accuracy, so as to construct a high-precision urban traffic planning model. The designed urban traffic planning model was applied to a main road section of a city for experiment. The experimental results showed that the model can provide a success rate close to 100% in urban traffic congestion detection and it only resulted in 41ms in time overhead when the number of urban traffic monitoring nodes was 100. It proves that the proposed model can effectively alleviate traffic congestion, improve the traffic capacity of road sections and effectively guide traffic planning and design.
Keywords: urban traffic; road network impedance matching; planning model; traffic situation detection
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