9th Joint International Conference on Information Sciences (JCIS-06)

Using Ant Colony Optimization to Solve Train Timetabling Problem of Mass Rapid Transit

Authors
Jen-yu Huang 0
Corresponding Author
Jen-yu Huang
0National Taiwan University
Available Online undefined NaN.
DOI
https://doi.org/10.2991/jcis.2006.38How to use a DOI?
Keywords
ant colony optimization, train timetabling problem, mass rapid transit
Abstract
The purpose of this research is to using ant colony optimization (ACO) to develop a heuristic algorithm to solve the train timetabling problem. This algorithm takes into consideration the trains scheduling in the transit period between peak period and off-peak period, the conflict resolving and the balance of in and out trains for each depot. A case study using the Taipei MRT is giving to demonstrate the algorithm and its potential applications. The result indicates that the algorithm can generate the feasible train timetable and solve the conflicts effectively.
Open Access
This is an open access article distributed under the CC BY-NC license.

Download article (PDF)

Proceedings
9th Joint International Conference on Information Sciences (JCIS-06)
Publication Date
undefined NaN
ISBN
978-90-78677-01-7
DOI
https://doi.org/10.2991/jcis.2006.38How to use a DOI?
Open Access
This is an open access article distributed under the CC BY-NC license.

Cite this article

TY  - CONF
AU  - Jen-yu Huang
PY  - NaN/NaN
DA  - NaN/NaN
TI  - Using Ant Colony Optimization to Solve Train Timetabling Problem of Mass Rapid Transit
BT  - 9th Joint International Conference on Information Sciences (JCIS-06)
PB  - Atlantis Press
UR  - https://doi.org/10.2991/jcis.2006.38
DO  - https://doi.org/10.2991/jcis.2006.38
ID  - HuangNaN/NaN
ER  -