Abstract
Abstract
In this study, max flow analysis processes are carried out with a graph theory-based approach that can be used in optimizing the traffic load in transportation networks. The data used in the study consists of 2 years of vehicle number data consisting of 438 million vehicle passes of a real city. Bottleneck points affecting traffic flow, maximum flow values, and effectiveness values of traffic generating and attracting locations were determined in the uniquely created transportation network. The Ford-Fulkerson algorithm was used to determine the maximum flow and bottleneck road connections in the designed transportation network. According to the maximum traffic flow to the junction point, the most effective junction points were determined by the PageRank algorithm. In addition, a unique algorithm is presented in the study that determines the effective intersection points that transfer vehicle traffic at maximum capacity to all junction points according to the maximum demand capacity data.
Publisher
Research Square Platform LLC
Reference36 articles.
1. Siddiqui S, Eren ŞG (2022) The Analysis of the Sustainability Pillars of Karachi City’s Transportation System. Journal of Architectural Sciences and Applications, MBUD 2022, 7, 181–190. https://10.30785/mbud.1023391
2. Öztemiz F, Karci A (2022) Topluluk Tespiti Yöntemi ile Ulaşım Ağında Verimli Yeşil Dalga Koridorlarının Belirlenmesi. Polytechnic, 1–1. https://dergipark.org.tr/en/pub/politeknik/issue/33364/1074962
3. Graph-Theoretical Analysis of the Swiss Road and Railway Networks Over Time;Erath A;Netw Spat Econ,2009
4. Inferencing hourly traffic volume using data-driven machine learning and graph theory. Computers, Environment and Urban Systems;Yi Z,2020
5. Granata D, Cerulli R, Grazia Scutellà M, Raiconi A (2013) Maximum Flow Problems and an NP-Complete Variant on Edge-Labeled Graphs, Handbook of Combinatorial Optimization, 1913–1948, https://doi.org/10.1007/978-1-4419-7997-1_64