Asset Details
Do you wish to reserve the book?
The Depth-First Optimal Strategy Path Generation Algorithm for Passengers in a Metro Network
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
The Depth-First Optimal Strategy Path Generation Algorithm for Passengers in a Metro Network
Do you wish to request the book?
The Depth-First Optimal Strategy Path Generation Algorithm for Passengers in a Metro Network
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
The Depth-First Optimal Strategy Path Generation Algorithm for Passengers in a Metro Network
2020
Overview
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.
Publisher
MDPI AG
Subject
