A comparison of algorithms for minimising delay costs in disturbed railway traffic scenarios

Journal of Rail Transport Planning and Management

Volumn 2, Issue 1-2, 2012, Pages 23-33

  Fan, Bo ^a   Roberts, Clive ^a   Weston, Paul ^a  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

Algorithm application; Disturbed railway traffic; Junction; Minimising delay costs; Optimisation; Railway timetable rescheduling

Indexed keywords

ANT COLONY OPTIMIZATION; AUTOMATION; DECISION TREES; DYNAMIC PROGRAMMING; GENETIC ALGORITHMS; RAILROAD TRAFFIC CONTROL; RAILROADS; SCHEDULING; SIMULATED ANNEALING; TABU SEARCH;

DELAY COSTS; JUNCTION; OPTIMISATIONS; RAILWAY TIMETABLES; RAILWAY TRAFFIC;

RAILROAD TRANSPORTATION;

EID: 84870060742     PISSN: 22109706     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jrtpm.2012.09.002     Document Type: Article

References (31)

1. Balfe, N., Wilson, J.R., Sharples, S., Clarke, T., 2007. Analysis of current UK rail signalling systems. In: Human Factors and Ergonomics Society European Chapter conference on Human Factors for Assistance and Automation, Braunschweig, Germany, October 2007.
2. Bocharnikov Y.V., Tobias A.M., Roberts C., Hillmansen S., Goodman C.J. Optimal driving strategy for traction energy saving on DC suburban railways. IET Electric Power Applications 2007, 1:675-682.
3. Cacchiani V., Caprara A., Toth P " A column generation approach to train timetabling on a corridor" , 4OR. Journal of Operations Research 2008, 6:125-142.
4. Chen, L., Schmid, F., Dasigi, F., Ning, B., Roberts, C., Tang, T. 2010. Real-time train rescheduling in junction areas. In: Proceedings of the Institution of Mechanical Engineers, Part F: Journal of Rail and Rapid Transit, vol. 224, No. 6, pp. 547-557.
5. Corman F., D'Ariano A., Pacciarelli D., Pranzo M. A tabu search algorithm for rerouting trains during rail operations. Transportation Research, Part B 2010, 44(1):175-192.
6. Cormen T.H., Leiserson C.E., Rivest R.L., Stein C. Introduction to Algorithms 2001, The MIT Press, Cambridge. Second ed.
7. D'Ariano, A., 2008. Improving Real-Time Train Dispatching: Models, Algorithms and Applications, PhD, Department of Transport and Planning, Delft University of Technology, Delft.
8. D'Ariano A., Pacclarelli D., Pranzo M. A branch and bound algorithm for scheduling trains in a railway network. European Journal of Operational Research 2007, 183:643-657.
9. D'Ariano A., Corman F., Pacciarelli D., Pranzo M. Reordering and local rerouting strategies to manage train traffic in real-time. Transportation Science 2008, 42(4):405-419.
10. D'Ariano, A., D'Urgolo, P., Pacciarelli, D., Pranzo, M., 2010. Optimal sequencing of aircrafts take-off and landing at a busy airport. In: Proceedings of the 13th International IEEE Conference on Intelligent Transportation Systems, September 2010, pp. 1-6.
11. Dorigo, M., 1992. Optimization, Learning and Natural Algorithms, PhD Thesis, Politecnico di Milano, Milan.
12. Dorigo M., Stützle T. Ant colony optimization 2004, MIT Press, Cambridge, Mass.
13. Dreyfus S. Richard Bellman on the birth of dynamic programming. Operations Research 2002, 50:48-51.
14. Fan, B., Roberts, C., Weston, P., 2011. A hybrid algorithm for optimal junction traffic control. In: Fourth International Association of Railway Operations Research, Rome.
15. Fan, B., 2012. Novel Approaches for Minimising Railway Delays in Disturbed Conditions, PhD Thesis, University of Birmingham, UK.
16. Hillmansen, S., Roberts, C., McGordon, A., Jennings, P., 2008. Concept Validation for Hybrid Trains, Department of Transport Funded Project DfTRG/0078/2007 Report, Birmingham Research and Development Limited, Birmingham.
17. Hillmansen, S., Roberts, C., McGordon, A., Jennings, P., 2009. Final Report: DMU Hybrid Concept, Evolution - Follow on Work DfTRG/0078/2007, Birmingham Research and Development Limited, Birmingham.
18. Ho T.K., Yeung T.H. Railway junction conflict resolution by genetic algorithm. Electronics Letters 2000, 36:771-772.
19. Ho T.K., Yeung T.H. Railway junction traffic control by heuristic methods. IEE Proceedings - Electric Power Applications 2001, 148(1):77-84.
20. Ho T.K., Norton J.P., Goodman C.J. Optimal traffic control at railway junctions. IEE Proceedings Electric Power Applications 1997, 144:140-148.
21. Lew A., Mauch H. Dynamic Programming 2007, Springer.
22. Lockyer K., Gordon J. Critical Path Analysis and Other Project Network Techniques 1991, Financial Times/Prentice Hall. Fifth ed.
23. Lukaszewicz, P., 2007. Running resistance - results and analysis of full-scale tests with passenger and freight trains in Sweden, In: Proceedings of the Institution of Mechanical Engineers Part F - Journal of Rail and Rapid Transit, vol. 221, pp 183-193.
24. Rushton, J. N., 2004. Learning natural language using genetic algorithms. In: International Conference on Artificial Intelligence Proceedings, pp. 1092-1096.
25. Papageorgiou M., Diakaki C., Dinopoulou V., Kotsialos A., Wang Y. Review of road traffic control strategies. Proceedings of the IEEE 2003, 91:2043-2067.
26. Pham D.T., Karaboga D. Intelligent Optimisation Techniques 2000, Springer-Verlag, London.
27. Qi, M.Y., Miao, L.X., Zhang, L., Xu, H.Y., 2008. A new Tabu search heuristic algorithm for the vehicle routing problem with time windows. In: Fifteenth Management Science & Engineering Conference Proceedings, pp. 1648-1653.
28. Reeves C.R. Modern Heuristic Techniques for Combinatorial Problems 1993, Halsted Press, New York.
29. Schmid U., Blieberger J. Some investigations on FCFS scheduling in hard real-time applications. Journal of Computer and System Sciences 1992, 45:493-512.
30. Weston, P., Goodman, C.J., Takagi, R., Bouch, C., Armstrong, J., Preston, J., 2006. Minimising Train Delay in a Mixed-Traffic Railway Network with Consideration of Passenger Delay. In: Seventh World Congress on Railway Research, Montreal, Canada.
31. Xing W., Xie J. Modern Optimization Computational Methods 2005, Tsinghua University Press.