A Method for Generating the Timetable of Double-Track Railway Line

Yan Zhang; Yan Ping Cui; Wen Tao Yang

doi:10.4028/www.scientific.net/AMM.347-350.2501

Paper Titles

An Approach of Web Page Information Extraction
p.2479

The Research and Application of Heterogeneous Database Based on XML in Distance Education
p.2483

Protecting the Security and Privacy of the Virtual Machine through Privilege Separation
p.2488

A New Scale Free Evolving Network Model with Community Structure
p.2495

A Method for Generating the Timetable of Double-Track Railway Line
p.2501

Design and Implementation of Distributed Crawler System for Opinion Mining
p.2506

Internet of Things Key Technologies and Architectures Research in Information Processing
p.2511

Methods of Predicting the Brain Activity Based on Noun
p.2516

Optimization of History Tree in 3DR-Tree Index Structure
p.2521

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 347-350A Method for Generating the Timetable of...

A Method for Generating the Timetable of Double-Track Railway Line

Abstract:

Passenger and freight train scheduling problem on double-track railway line is considered by using Ant Colony Optimization (ACO) algorithm. The aim is to reasonably arrange the dispatch sequence of the trains to minimize the total run time. The constrains in train scheduling problem are considered and the model is established. Due to the complexity of train scheduling problem, this problem is solved by ACO and implemented by programming. A case study is presented to illustrate the solution. The results illustrate that the proposed method is effective to solve the scheduling problem on double-track railway line.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 347-350)

Pages:

2501-2505

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.347-350.2501

Citation:

Cite this paper

Online since:

August 2013

Authors:

Yan Zhang, Yan Ping Cui, Wen Tao Yang

Keywords:

ACO, Double-Track Railway, Timetable

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] M. C. Van Wezel, J. N. Kok, J. N. Van den Berg, and W. Van Kampen, Genetic Improvement of Railway Timetables, Computer Science, vol. 866, 1994, pp.566-574.

DOI: 10.1007/3-540-58484-6_299

Google Scholar

[2] R. D. Martinelli and H. Teng, Optimization of Railway Operations using Meural Networks, Transportation Research, vol. 4, 1996, pp.33-49.

Google Scholar

[3] D. Pacciarelli and M. Pranzo, A Tabu Search Algorithm for the Railway Scheduling Problem, Procdings of the 4th Metaheuristic International Conference, Porto, 2001, p.16–20.

Google Scholar

[4] C. L. Huntley, D. E. Brown, D. E. Sappington, and B. P. Markowicz, Freight Routing and Scheduling at CSX, Transportation Interfaces, vol. 25, 1995, pp.58-71.

DOI: 10.1287/inte.25.3.58

Google Scholar

[5] K. Ghoseiri, A new Idea for Train Scheduling using Ant Colony Optimization, Computers in Railways X, WIT Press, 2006, 601-609.

DOI: 10.2495/cr060591

Google Scholar

[6] C. E. Noon and J. C. Bean, A Lagrangian based Approach for the Asymmetric Generalized Traveling Salesman Problem, Operations Research, vol. 39, 1991, p.623–632.

DOI: 10.1287/opre.39.4.623

Google Scholar

[7] M. Dorigo and L. M. Gambardella, Ant colonies for the traveling salesman problem, BioSystems, vol. 43, 1997, p.73–81.

DOI: 10.1016/s0303-2647(97)01708-5

Google Scholar