Abstract
In this paper we study a train scheduling problem on a single line that may be traversed in both directions by trains with different priorities travelling with different speeds. We propose an ACO approach to provide decision support for tackling this problem. Our results show the strong performance of ACO when compared to optimal solutions provided by CPLEX for small instances as well as to other heuristics on larger instances. © 2013 Springer-Verlag.
Cite
CITATION STYLE
Reimann, M., & Leal, J. E. (2013). Single line train scheduling with ACO. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7832 LNCS, pp. 226–237). https://doi.org/10.1007/978-3-642-37198-1_20
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
