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.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Reimann, M.: Ant Based Optimization in Goods Transportation. Ph.D thesis, University of Vienna (2002)
Dorigo, M., Stützle, T.: Ant Colony Optimization. The MIT Press, Cambridge (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sabino, J.A., Stützle, T., Birattari, M., Leal, J.E. (2006). ACO Applied to Switch Engine Scheduling in a Railroad Yard. In: Dorigo, M., Gambardella, L.M., Birattari, M., Martinoli, A., Poli, R., Stützle, T. (eds) Ant Colony Optimization and Swarm Intelligence. ANTS 2006. Lecture Notes in Computer Science, vol 4150. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11839088_52
Download citation
DOI: https://doi.org/10.1007/11839088_52
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-38482-3
Online ISBN: 978-3-540-38483-0
eBook Packages: Computer ScienceComputer Science (R0)