A Greedy-Based Computer Algorithm for Train Stop Schedule in High-Speed Railway Network

Zhen Huan He; Lei  Nie; Hui Ling Fu

doi:10.4028/www.scientific.net/AMR.756-759.4073

Paper Titles

A New Fuzzing Technique Using Niche Genetic Algorithm
p.4050

The Improved MFCC Speech Feature Extraction Method and its Application
p.4059

Extraction and Classifier Design for Image Recognition of Insect Pests on Field Crops
p.4063

Context Quantization Based on the Modified K-Means Clustering
p.4068

A Greedy-Based Computer Algorithm for Train Stop Schedule in High-Speed Railway Network
p.4073

Research on a Kind of Algorithm Cell Search in TD-LTE System
p.4078

Study of the Non-Dominated Sorting Genetic Algorithm for the Optimal Structural Parameter of the Tooth-Arrangement Multi-Fingered Dextrous Hand
p.4082

Fast Image Positioning Based on Mark
p.4090

Fault Diagnosis of Grounding Grid Based on Genetic Algorithm and Neural Network
p.4095

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 756-759A Greedy-Based Computer Algorithm for Train Stop...

A Greedy-Based Computer Algorithm for Train Stop Schedule in High-Speed Railway Network

Abstract:

The study constructs a stop schedule model for high-speed railway. A greedy-based algorithm is proposed and the problem is divided into 3 stages to decrease its difficulty to an acceptable extent. Some greedy principles are applied and series of optimal models are constructed to solve the problem. The result of the sample shows that the models and algorithms in the study are effective.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 756-759)

Pages:

4073-4077

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.756-759.4073

Citation:

Cite this paper

Online since:

September 2013

Authors:

Zhen Huan He, Lei Nie, Hui Ling Fu

Keywords:

High-Speed Railway (HSR), Service Planning, Stop Schedule

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Huiling Fu, Lei Nie, Benjamin R. Sperry, Zhenhuan He, Train Stop Scheduling in a High-Speed Rail Network by Utilizing a Two-Stage Approach, Mathematical Problems in Engineering, Article ID 579130, pp.1-11, (2012).

DOI: 10.1155/2012/579130

Google Scholar

[2] Jian Huang, Qiyuan PENG, Two-Stage Optimization Algorithm for Stop Schedule Plan of High-Speed Train, Journal of Southeast Jiaotong University, vol. 47(3), pp.47-52, (2012).

Google Scholar

[3] Lianbo Deng, Feng SHI, Wenliang ZHOU, Stop Schedule Plan Optimization for Passenger Train, China Railway Science, vol. 30(4), (2009).

Google Scholar

[4] Jan-Willem Goossens, Stan van Hoesel, Leo Kroon, On solving multi-type railway line planning problems, European Journal of Operational Research, vol. 168(2), p.403–424, (2004).

DOI: 10.1016/j.ejor.2004.04.036

Google Scholar

[5] H.W. Hamacher, A. Liebers, A. Schöbel, D. Wagner, and F. Wagner, Locating new stops in a railway network, Electronic Notes in Theoretical Computer Science, vol. 50, no. 1, pp.1-11, (2001).

DOI: 10.1016/s1571-0661(04)00162-8

Google Scholar

[6] C. LEE and W. HSIEH, A demand oriented service planning process, The World Congress on Railway Research, Koln, Germany, (2001).

Google Scholar