An ACO Framework for Single Track Railway Scheduling Problem

  • G. S. Raghavendra
  • N Prasanna Kumar
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 201)


This work focus on application of ant algorithms to railway scheduling problem. The railway scheduling problem especially on a single track is considered to be NP hard problem with respect to number of conflicts in the schedule. The train scheduling is expected to satisfy several operational constraints, thus making the problem more complex. The ant algorithms have evolved as more suitable option to solve the NP hard problem. In this paper, we propose a mathematical model to schedule the trains that fits into ACO framework.The solution construction mechanism is inspired by orienteering problem. The proposed methodology has the capability to explore the complex search space and provides the optimal solution in reasonable amount of time. The proposed model is robust in nature and flexible enough to handle additional constraints without any modification to the model. The model assumes that set of trains will be scheduled in a zone, that covers several cities and they are optimized with respect to number of conflicts.


Ant Optimization Railway Schedules Train 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Caprara, A.M., Kroon, L.G., Monaci, M., Peeters, M.& Toth, P. (2007). Passenger railway optimization. Transportation Science. Elservier, 14:129–187.Google Scholar
  2. Kroon, L., Huisman, D., Abbink, E., Fioole, P., Fischetti, M., Maroti, G., Schrijver, A., Steenbeek, A.& Ybema, R. (2009). The new Dutch timetable: the OR revolution, Interfaces, 39(1): 6–17.Google Scholar
  3. Zwaneveld, P.J., Kroon, L.G.& van Hoesel, S.P.M. (2001). Routing trains through a railway station based on a node packing model. European Journal of Operational Research, 128:14–33.Google Scholar
  4. Cordeau, J., Toth, P.& Vigo, D. (1998). A survey of optimization models for train routing and scheduling. Transportation Science, Elservier, 32(4):380–404.Google Scholar
  5. Cai, X.& Goh, C. J. (1994) A fast heuristic for the train scheduling problem, Computers and Operation Research, 21(5):499–510.Google Scholar
  6. Kraay, D., Harker, P.& Chen, B. (1991), Optimal pacing of trains in freight railroads, Operation Research, 39(1):82–99.Google Scholar
  7. Higgins, A., Kozan, E.& Ferreira, L. (1997), Heuristic techniques for single line train scheduling, Journal of Heuristics, 3:43–62.Google Scholar
  8. Kwan, R. S. K.& Mistry, P (2003), A Co-evolutionary Algorithm for Train Timetabling, Research Report Series.13, School of Computing, University of Leeds, Leeds.Google Scholar
  9. Tormos, P., Lova, A., Barber, F., Ingolotti, L., Abril, M.,& Salido, M. A. (2008), A Genetic Algorithm for Railway Scheduling Problems, Studies in Computational Intelligence, 128:255–276.Google Scholar
  10. Dorigo, M., Maniezzo, V.& Colorni, A. (1996), Ant System: Optimization by a colony of cooperating agents. IEEE Transaction on Systems, Man and Cybernetics 26(1):29–41.Google Scholar
  11. Bullnheimer, Hartl, R.F.,& Strauss, C. (1999), A new rank based version of the Ant System: A computational study. Central European Journal for Operation Research and Economics 7(1):25–38.Google Scholar
  12. Blum, C., Roli, A.& Dorigo, M. (2004), HC-ACO: The Hypercube framework for Ant Colony Optimization. IEEE Transaction on Systems, Man and Cybernetics 34(2):1161–1172.Google Scholar
  13. Stutzle, T.& Hoos, H.H. (2000), MAX - MIN Ant System. Future Generation Computer, System (16)8:889–914.Google Scholar
  14. Maniezzo, V.& Colorni, A. (1999), The Ant System Applied to the Quadratic Assignment Problem, IEEE Transactions on Knowledge and Data Engineering, 11(5):769–778.Google Scholar
  15. Bullnheimer, B., Hartl, R.F.& Strauss, C. (1999), Applying the Ant System to the Vehicle Routing Problem, in S. Voss, S. Martello, I. H. Osman, and C. Roucairol (eds.), MetaHeuristics: Advances and Trends in Local Search Paradigms for Optimization, Kluwer, pp. 285–296.Google Scholar
  16. Di Caro, G.,& Dorigo, M. (1998), Ant Colonies for Adaptive Routing in Packet-Switched Communication Networks, Proceedings of the 5th International Conference on Parallel Problem Solving from Nature (PPSN V), pp. 673–682.Google Scholar
  17. Costa, D.& Hertz, A. (1997), Ants Can Colour Graphs, Journal of the Operational Research Society, 48, pp. 295–305.Google Scholar
  18. Vansteenwegen, P., Wouter, S.& Oudheusden, D.V. (2011), The Orienteering Problem: A Survey, European Journal of Operational Research, 209, pp. 1–10.Google Scholar

Copyright information

© Springer India 2013

Authors and Affiliations

  1. 1.BITS-PilaniGoaindia

Personalised recommendations