Limits...
Optimal path choice in railway passenger travel network based on residual train capacity.

Dou F, Yan K, Huang Y, Wang L, Jia L - ScientificWorldJournal (2014)

Bottom Line: However, travelers cannot avoid being confused when they hope to choose a perfect travel plan based on various travel time and cost constraints before departure.In this study, railway passenger travel network is constructed based on train timetable.The railway passenger travel network topology is analyzed based on residual train capacity.

View Article: PubMed Central - PubMed

Affiliation: School of Traffic and Transportation, Beijing Jiaotong University, Beijing 100044, China.

ABSTRACT
Passenger's optimal path choice is one of the prominent research topics in the field of railway passenger transport organization. More and more different train types are available, increasing path choices from departure to destination for travelers are unstoppable. However, travelers cannot avoid being confused when they hope to choose a perfect travel plan based on various travel time and cost constraints before departure. In this study, railway passenger travel network is constructed based on train timetable. Both the generalized cost function we developed and the residual train capacity are considered to be the foundation of path searching procedure. The railway passenger travel network topology is analyzed based on residual train capacity. Considering the total travel time, the total travel cost, and the total number of passengers, we propose an optimal path searching algorithm based on residual train capacity in railway passenger travel network. Finally, the rationale of the railway passenger travel network and the optimal path generation algorithm are verified positively by case study.

Show MeSH

Related in: MedlinePlus

© Copyright Policy - open-access
Related In: Results  -  Collection


getmorefigures.php?uid=PMC4109079&req=5

Mentions: Search the optimal path by Dijkstra's algorithm and then assign passenger flow to this path according to the capacity of the optimal path until a running arc of this path is disabled. A new passenger travel network is formed after the disable arc is deleted. Continue to search the optimal path and assign the remaining passengers until all passengers are assigned or all paths have no residual capacity. TOPSA is shown in Algorithm 2.


Optimal path choice in railway passenger travel network based on residual train capacity.

Dou F, Yan K, Huang Y, Wang L, Jia L - ScientificWorldJournal (2014)

© Copyright Policy - open-access
Related In: Results  -  Collection

Show All Figures
getmorefigures.php?uid=PMC4109079&req=5

Mentions: Search the optimal path by Dijkstra's algorithm and then assign passenger flow to this path according to the capacity of the optimal path until a running arc of this path is disabled. A new passenger travel network is formed after the disable arc is deleted. Continue to search the optimal path and assign the remaining passengers until all passengers are assigned or all paths have no residual capacity. TOPSA is shown in Algorithm 2.

Bottom Line: However, travelers cannot avoid being confused when they hope to choose a perfect travel plan based on various travel time and cost constraints before departure.In this study, railway passenger travel network is constructed based on train timetable.The railway passenger travel network topology is analyzed based on residual train capacity.

View Article: PubMed Central - PubMed

Affiliation: School of Traffic and Transportation, Beijing Jiaotong University, Beijing 100044, China.

ABSTRACT
Passenger's optimal path choice is one of the prominent research topics in the field of railway passenger transport organization. More and more different train types are available, increasing path choices from departure to destination for travelers are unstoppable. However, travelers cannot avoid being confused when they hope to choose a perfect travel plan based on various travel time and cost constraints before departure. In this study, railway passenger travel network is constructed based on train timetable. Both the generalized cost function we developed and the residual train capacity are considered to be the foundation of path searching procedure. The railway passenger travel network topology is analyzed based on residual train capacity. Considering the total travel time, the total travel cost, and the total number of passengers, we propose an optimal path searching algorithm based on residual train capacity in railway passenger travel network. Finally, the rationale of the railway passenger travel network and the optimal path generation algorithm are verified positively by case study.

Show MeSH
Related in: MedlinePlus