A Method for Increasing the Flow of Streets Network Based on the Theory of Maximum Flow in Graphs

With the increase in population and vehicles in metropolitan areas, the streets face heavy traffic congestion in some areas. There are many solutions to address this problem, which are generally done with simulating urban traffic. In this paper, a model is proposed to increase the network throughput of streets, using simulation. Here, the throughput defined as the distance traveled by all vehicles across the entire streets network, which this paper aims to increase this indicator in a network of streets. In the developed model, the paths are modeled and processed as a graph. In this study, two issues were addressed to achieve the goal: street saturation and disproportion in the number of outbound vehicles at intersections. In this model, to solve the first problem, the threshold for the density of cars in the streets is calculated to prevent excessive saturation of the streets by cars and, consequently, to avoid over slow-down of vehicles average speed. To solve the second problem, the number of outbound vehicles from the intersection is calculated based on the ratio of the demand for inputs to the intersection. Due to the high volume of computations, simulated network used for processing. The simulation results show the proper performance of the proposed model, with street throughput, 2.38 times higher than normal.