ACO Applied to Switch Engine Scheduling in a Railroad Yard

  • Jodelson A. Sabino
  • Thomas Stützle
  • Mauro Birattari
  • José Eugênio Leal
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4150)

Abstract

This reasearch studies ACO algorithms for the switch engine scheduling in a Railroad Yard. The cars are moved individually or grouped into blocks by a set of locomotives called switch engines which are dedicated to moving around the cars in the yard. The need for moving comes from the fact that the arriving trains are disassembled into blocks of cars, undergo some operations like, loading, unloading and cleaning and finally are assembled into a new train. Each moving request is called a switch order. The decision of which switch engine will execute which switch order and the sequence of that executution is the core of our problem. The optimization of this schedule reduces the overall operational costs of the yard as weel as the time to assemble new trains, thus leading to a more productive railroad system.

References

  1. 1.
    Reimann, M.: Ant Based Optimization in Goods Transportation. Ph.D thesis, University of Vienna (2002)Google Scholar
  2. 2.
    Dorigo, M., Stützle, T.: Ant Colony Optimization. The MIT Press, Cambridge (2004)MATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Jodelson A. Sabino
    • 1
    • 2
  • Thomas Stützle
    • 2
  • Mauro Birattari
    • 2
  • José Eugênio Leal
    • 1
  1. 1.Departamento de Engenharia IndustrialPontifícia Universidade Católica do Rio de JaneiroRio de JaneiroBrazil
  2. 2.IRIDIA, CoDEUniversité Libre de BruxellesBrusselsBelgium

Personalised recommendations