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
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.
Copyright
© The authors. This article is distributed under the terms of the Creative Commons Attribution License 4.0, which permits non-commercial use, distribution and reproduction in any medium, provided the original work is properly cited. See for details: https://creativecommons.org/licenses/by-nc/4.0/
Open Access | Under Creative Commons license CC BY-NC 4.0

Download article (PDF)

Cite this article
ris
enw
bib
@inproceedings{Huang2006,
  title={Using Ant Colony Optimization to Solve Train Timetabling Problem of Mass Rapid Transit},
  author={Huang, Jen-yu},
  year={2006},
  booktitle={9th Joint International Conference on Information Sciences (JCIS-06)},
  issn={1951-6851},
  isbn={978-90-78677-01-7},
  url={http://dx.doi.org/10.2991/jcis.2006.38},
  doi={10.2991/jcis.2006.38},
  publisher={Atlantis Press}
}
copy to clipboarddownload