Transportation and Planning Based on Network Expansion Optimization Algorithm

Abstract

The development of social economy has put forward higher and higher requirements for transportation, and the construction of transportation infrastructure has entered an important stage of rapid development. It is necessary to expand the network scale, improve the network level, and more importantly, accelerate the improvement of the network structure. Transportation network design is the most important issue in transportation planning, and it is also a hot issue in the field of transportation research. Traditional transportation network design usually ignores the uncertainty of transportation demand, which will bring risks to decision-making. When the expected traffic volume exceeds the capacity of the road network, how to choose an economical and reasonable expansion and optimization method to increase the capacity of the road network is an important issue that the transportation department needs to face. The purpose of this article is to use network capacity optimization algorithms to plan transportation. An optimization model for traffic network expansion is established, and a shortest path reconstruction and expansion cost progressive iterative algorithm is designed. The validity of the model and its algorithm can be verified, which can provide a reference for solving the optimization problem of transportation capacity expansion. Based on the maximum flow theory, a method for determining the capacity limit of the road network is proposed. In order to minimize transportation costs, a capacity optimization model is established and corresponding algorithms are designed. The experimental results show that the model and algorithm studied in this paper are effective, and the capacity expansion part of the capacity expansion optimization scheme is basically consistent with the capacity limitation part of the road network.