Optimal Path Choice in Railway Passenger Travel Network Based on Residual Train CapacityReportar como inadecuado

Optimal Path Choice in Railway Passenger Travel Network Based on Residual Train Capacity - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

The Scientific World Journal - Volume20142014, Article ID153949, 8 pages -

Research Article

School of Traffic and Transportation, Beijing Jiaotong University, Beijing 100044, China

State Key Laboratory of Rail Traffic Control and Safety, Beijing Jiaotong University, Beijing 100044, China

Received 17 January 2014; Revised 7 May 2014; Accepted 3 June 2014; Published 6 July 2014

Academic Editor: Dimitrios A.Karras

Copyright 2014 Fei Dou et al.
This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


Passengers 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.

Autor: Fei Dou,Kai Yan,Yakun Huang,Li Wang,and Limin Jia

Fuente: https://www.hindawi.com/


Documentos relacionados