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

DOI

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.

Copyright

© 2006, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Jen-yu Huang
PY  - 2006/10
DA  - 2006/10
TI  - Using Ant Colony Optimization to Solve Train Timetabling Problem of Mass Rapid Transit
BT  - Proceedings of the 9th Joint International Conference on Information Sciences (JCIS-06)
PB  - Atlantis Press
SP  - 155
EP  - 158
SN  - 1951-6851
UR  - https://doi.org/10.2991/jcis.2006.38
DO  - 10.2991/jcis.2006.38
ID  - Huang2006/10
ER  -