Skip to main content
SpringerLink
Log in
Book cover

European Conference on Evolutionary Computation in Combinatorial Optimization

EvoCOP 2013: Evolutionary Computation in Combinatorial Optimization pp 226–237Cite as

Single Line Train Scheduling with ACO

  • Conference paper

  • 1448 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7832))

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.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   49.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Blum, C., Dorigo, M.: The hyper-cube framework for ant colony optimization. IEEE Transactions on Systems, Man, and Cybernetics-Part B 34, 1161–1172 (2004)

    Article  Google Scholar 

  2. Burdett, R.L., Kozan, E.: A disjunctive graph model and framework for constructing new train schedules. European Journal of Operational Research (to appear)

    Google Scholar 

  3. Cai, X., Goh, C.J.: A fast heuristic for the train scheduling problem. Computers and Operations Research 21, 499–510 (1994)

    Article  MATH  Google Scholar 

  4. Caprara, A., Monaci, M., Toth, P., Guida, P.L.: A lagrangian heuristic algorithm for a real-world train timetabling problem. Discrete Applied Mathematics 154, 738–753 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  5. Carey, M., Lockwood, D.: A model, algorithms and strategy for train pathing. Journal of the Operational Research Society 46, 988–1005 (1995)

    MATH  Google Scholar 

  6. D’Ariano, A., Pacciarelli, D., Pranzo, M.: A branch and bound algorithm for scheduling trains in a railway network. European Journal of Operational Research 183, 643–657 (2007)

    Article  MATH  Google Scholar 

  7. Dorigo, M., Maniezzo, V., Colorni, A.: The ant system: optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics-Part B 26, 29–41 (1996)

    Article  Google Scholar 

  8. Dorigo, M., Stützle, T.: Ant Colony Optimization. MIT Press/Bradford Books, Cambridge, MA (2004)

    Book  MATH  Google Scholar 

  9. Gutjahr, W.J.: A graph-based ant system and its convergence. Future Generation Computing Systems 16, 873–888 (2000)

    Article  Google Scholar 

  10. Gutjahr, W.J.: ACO algorithms with guaranteed convergence to the optimal solution. Information Processing Letters 82, 145–153 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  11. Higgins, A., Kozan, E., Ferreira, L.: Optimal scheduling of trains on a single line track. Transportation Research B 30, 147–161 (1996)

    Article  Google Scholar 

  12. Higgins, A., Kozan, E., Ferreira, L.: Heuristic techniques for single line train scheduling. Journal of Heuristics 3, 43–62 (1997)

    Article  MATH  Google Scholar 

  13. Leal, J.E.: A heuristic approach to the problem of scheduling trains on single lines. Working paper, Department of Industrial Engineering, PUC-Rio (2008)

    Google Scholar 

  14. Oliveira, E., Smith, B.M.: A Combined Constraint-Based Search Method for Single-Track Railway Scheduling Problem. In: Brazdil, P., Jorge, A. (eds.) EPIA 2001. LNCS (LNAI), vol. 2258, pp. 371–378. Springer, Heidelberg (2001)

    Google Scholar 

  15. Reimann, M.: Combining an Exact Algorithm with an Ant System for Travelling Salesman Problems. Working paper, University of Vienna (2003)

    Google Scholar 

  16. Reimann, M., Leal, J.E.: Single line train scheduling with Ant Colony Optimization. Working paper, University of Graz (2011)

    Google Scholar 

  17. Sahin, I.: Railway traffic control and train scheduling based on inter-train conflict management. Transportation Research B 33, 511–534 (1998)

    Article  Google Scholar 

  18. Stützle, T., Dorigo, M.: A short convergence proof for a class of ACO algorithms. IEEE Transactions on Evolutionary Computation 6, 358–365 (2002)

    Article  Google Scholar 

  19. Stützle, T., Hoos, H.: The Max-Min Ant System and Local Search for Combinatorial Optimization Problems. In: Voß, S., Martello, S., Osman, I.H., Roucairol, C. (eds.) Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, pp. 313–329. Kluwer, Boston (1999)

    Chapter  Google Scholar 

  20. Szpigel, B.: Optimal train scheduling on a single track railway. In: Ross, M. (ed.) Proceedings of OR 1972, pp. 343–352. North-Holland, Amsterdam (1973)

    Google Scholar 

  21. Tormos, P., Lova, A., Barber, F., Ingolotti, L., Abril, M., Salido, M.A.: A Genetic Algorithm for Railway Scheduling Problems. In: Xhafa, F., Abraham, A. (eds.) Metaheuristics for Scheduling in Industrial and Manufacturing Applications. SCI, vol. 128, pp. 255–276. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  22. Zhou, X., Zhong, M.: Bicriteria train scheduling for high-speed passenger railroad planning applications. European Journal of Operational Research 167, 752–771 (2005)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Production and Operations Management, University of Graz, Universitätsstrasse 15, 8010, Graz, Austria

    Marc Reimann

  2. Department of Industrial Engineering, Pontificia Universidade Catolica do Rio de Janeiro, Rua Marques de Sao Vicente 225, Gavea, Rio de Janeiro, CEP 22453-900, Brazil

    Jose Eugenio Leal

Authors
  1. Marc Reimann
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jose Eugenio Leal
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Leipzig, Johannisgasse 26, 04103, Leipzig, Germany

    Martin Middendorf

  2. IKERBASQUE, Basque Foundation for Science, Department of Computer Science and Artificial Intelligence, University of the Basque Country, Paseo Manuel Lardizabal 1, 20018, Donostia, Spain

    Christian Blum

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Reimann, M., Leal, J.E. (2013). Single Line Train Scheduling with ACO. In: Middendorf, M., Blum, C. (eds) Evolutionary Computation in Combinatorial Optimization. EvoCOP 2013. Lecture Notes in Computer Science, vol 7832. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37198-1_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-37198-1_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-37197-4

  • Online ISBN: 978-3-642-37198-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation