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

Railway passenger travel network.
© Copyright Policy - open-access
Related In: Results  -  Collection


getmorefigures.php?uid=PMC4109079&req=5

fig1: Railway passenger travel network.

Mentions: Railway passenger travel network G(V, E) is constructed based on the schedule-based transfer network by two kinds of nodes and five kinds of arcs, where V and E are the set of nodes and the set of arcs, respectively. Define the set of nodes as V = V1 ∪ V2 and the set of arcs as E = E1 ∪ E2 ∪ E3 ∪ E4 ∪ E5. There are two kinds of nodes in this network, one kind of nodes is transition node which is original node vO or destination node vD. The other kind of nodes is train arrival nodes or train departure nodes. There are five kinds of arcs in this network: the boarding arcs, running arcs, stopping arcs, transferring arcs, and alighting arcs. To illustrate, Figure 1 presents a railway passenger travel network with four cities and four trains. Clearly, a passenger travel path from the origin node to the destination node includes a series of boarding, running, stopping, transferring, and alighting arcs in the passenger travel network (V, E).


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)

Railway passenger travel network.
© Copyright Policy - open-access
Related In: Results  -  Collection

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

fig1: Railway passenger travel network.
Mentions: Railway passenger travel network G(V, E) is constructed based on the schedule-based transfer network by two kinds of nodes and five kinds of arcs, where V and E are the set of nodes and the set of arcs, respectively. Define the set of nodes as V = V1 ∪ V2 and the set of arcs as E = E1 ∪ E2 ∪ E3 ∪ E4 ∪ E5. There are two kinds of nodes in this network, one kind of nodes is transition node which is original node vO or destination node vD. The other kind of nodes is train arrival nodes or train departure nodes. There are five kinds of arcs in this network: the boarding arcs, running arcs, stopping arcs, transferring arcs, and alighting arcs. To illustrate, Figure 1 presents a railway passenger travel network with four cities and four trains. Clearly, a passenger travel path from the origin node to the destination node includes a series of boarding, running, stopping, transferring, and alighting arcs in the passenger travel network (V, E).

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