A platform for research: civil engineering, architecture and urbanism
A platform for research: civil engineering, architecture and urbanism
The Depth-First Optimal Strategy Path Generation Algorithm for Passengers in a Metro Network
Passenger behavior analysis is a key issue in passenger assignment research, in which the path choice is a fundamental component. A highly complex transit network offers multiple paths for each origin–destination (OD) pair and thus resulting in more flexible choices for each passenger. To reflect a passenger’s flexible choice for the transit network, the optimal strategy was proposed by other researchers to determine passenger choice behavior. However, only strategy links have been searched in the optimal strategy algorithm and these links cannot complete the whole path. To determine the paths for each OD pair, this study proposes the depth-first path generation algorithm, in which a strategy node concept is newly defined. The proposed algorithm was applied to the Beijing metro network. The results show that, in comparison to the shortest path and the K-shortest path analysis, the proposed depth-first optimal strategy path generation algorithm better represents the passenger behavior more reliably and flexibly.
The Depth-First Optimal Strategy Path Generation Algorithm for Passengers in a Metro Network
Passenger behavior analysis is a key issue in passenger assignment research, in which the path choice is a fundamental component. A highly complex transit network offers multiple paths for each origin–destination (OD) pair and thus resulting in more flexible choices for each passenger. To reflect a passenger’s flexible choice for the transit network, the optimal strategy was proposed by other researchers to determine passenger choice behavior. However, only strategy links have been searched in the optimal strategy algorithm and these links cannot complete the whole path. To determine the paths for each OD pair, this study proposes the depth-first path generation algorithm, in which a strategy node concept is newly defined. The proposed algorithm was applied to the Beijing metro network. The results show that, in comparison to the shortest path and the K-shortest path analysis, the proposed depth-first optimal strategy path generation algorithm better represents the passenger behavior more reliably and flexibly.
The Depth-First Optimal Strategy Path Generation Algorithm for Passengers in a Metro Network
Kai Lu (author) / Tao Tang (author) / Chunhai Gao (author)
2020
Article (Journal)
Electronic Resource
Unknown
Metadata by DOAJ is licensed under CC BY-SA 1.0
Does crowding affect the path choice of metro passengers?
| Elsevier | 2015
Exploring Melbourne Metro Train Passengers’ Pre-Boarding Behaviors and Perceptions
| DOAJ | 2023
Analyzing detour behavior of metro passengers based on mobile phone data
| Taylor & Francis Verlag | 2022
Precise estimation of connections of metro passengers from Smart Card data
| Online Contents | 2015