Studying the rational allocation of urban space and public transportation resources to meet the daily activity needs of commuters is a major topic to solve urban traffic problems for a long time. In response to the above problems, this paper designs a dynamic path planning algorithm for urban residents' public transportation aiming at the shortest commuting time. First, the shortest path between residential nodes and office nodes via bus lines is calculated through the shortest path algorithm; then the optimal bus ride scheme in the shortest path is calculated through the dynamic programming algorithm. The dynamic programming algorithm in this paper simulates the public transportation commuting of residents in the main urban area of Beijing. The simulation results show that the path planning algorithm can provide path planning for residents in the main urban area of Beijing to commute using public transportation. The path planning results include the bus stops and bus lines that residents pass through. In addition, the simulation experiment also obtained that the average commute time of the road network used by Beijing residents using public transportation is 47.24min, and the average waiting time of the road network is 19.44min, which can clearly and intuitively represent the status of the public transportation road network in the main urban area of Beijing.
Urban public transport commuting path planning method based on dynamic programming algorithm
3rd International Conference on Internet of Things and Smart City (IoTSC 2023) ; 2023 ; Chongqing, China
Proc. SPIE ; 12708
2023-06-14
Conference paper
Electronic Resource
English
Urban bus commuting path planning method based on dynamic planning algorithm
European Patent Office | 2023
|Urban commuting path identification method and equipment
European Patent Office | 2020
|Urban commuting regular bus planning method based on buses
European Patent Office | 2022
|Comparative Emissions of Public Transport and Private Cars for Urban Commuting
British Library Conference Proceedings | 1996
|