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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
