Urban public transport commuting path planning method based on dynamic programming algorithm

Lu Wang; Tongyu Zhang; Bosen Jiao; Xuewei Li

doi:10.1117/12.2684076

14 June 2023 Urban public transport commuting path planning method based on dynamic programming algorithm

Lu Wang, Tongyu Zhang, Bosen Jiao, Xuewei Li

Proceedings Volume 12708, 3rd International Conference on Internet of Things and Smart City (IoTSC 2023）; 1270810 (2023) https://doi.org/10.1117/12.2684076
Event: 3rd International Conference on Internet of Things and Smart City (IoTSC 2023）, 2023, Chongqing, China

Abstract

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.

Citation Download Citation

Lu Wang, Tongyu Zhang, Bosen Jiao, and Xuewei Li "Urban public transport commuting path planning method based on dynamic programming algorithm", Proc. SPIE 12708, 3rd International Conference on Internet of Things and Smart City (IoTSC 2023）, 1270810 (14 June 2023); https://doi.org/10.1117/12.2684076

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available

Members: $17.00

Non-members: $21.00 ADD TO CART

PROCEEDINGS
7 PAGES

DOWNLOAD PAPER SAVE TO MY LIBRARY

GET CITATION

RIGHTS & PERMISSIONS

Get copyright permission Get copyright permission on Copyright Marketplace

KEYWORDS

Transportation

Computer programming

Roads

Buildings

Computer simulations

Genetic algorithms

Lithium

Show All Keywords

Keywords/Phrases

Search In:

Publication Years