Optimization of Bus Routes in Small Cities Based on Dijkstra's Algorithm (2024)

Abstract

In order to solve the problem of irrational planning of bus routes within a small city, which cannot meet the daily public travel demand of residents, a bus path optimization model considering passengers' travel time is proposed. Under the conditions of known passenger flow between bus stops, vehicle passenger capacity, frequency of departure, etc., the existing bus routes are optimized according to the passenger demand, and the minimization of the operating cost of vehicles (vehicle driving time, fuel consumption, etc.) and the time cost of passengers (time waiting for vehicles before boarding the bus, ride time, arrival time, etc.) is taken as the objective, the bus path optimization model considering passenger satisfaction is constructed, and the Dijkstra algorithm is used to solve the problem. Dijkstra algorithm for solving. Finally, the feasibility of the model and algorithm is verified through the example analysis of Fangchenggang Fangcheng District bus route. The results show that in the route optimization of 103 bus stops in Fangchenggang City, the number of routes is reduced by two, but the density of the line network is increased by 10.3%, the non-linear coefficient is reduced by 6.3%, and the passenger satisfaction is improved. Greater satisfaction of passenger demand, effective reduction of errors in planning paths, shortening of travel distance and passenger travel time, and increased passenger satisfaction. Compared to the original bus routes, the model results considering passenger satisfaction are better.