A Heuristic algorithm for fixed train runtime
Jia, W.Z., Chen, S.K., Ho, T.K., Mao, B.H., & Bai, Y. (2008) A Heuristic algorithm for fixed train runtime. In Proceedings of IET International Conference on Railway Engineering 2008 : Challenges for Railway Transportation in Information Age, IET, Hotel Miramar Hong Kong, Hong Kong.
This paper proposes a train movement model with fixed runtime that can be employed to find feasible control strategies for a single train along an inter-city railway line. The objective of the model is to minimize arrival delays at each station along railway lines. However, train movement is a typical nonlinear problem for complex running environments and different requirements. A heuristic algorithm is developed to solve the problem in this paper and the simulation results show that the train could overcome the disturbance from train delay and coordinates the operation strategies to sure punctual arrival of trains at the destination. The developed algorithm can also be used to evaluate the running reliability of trains in scheduled timetables.
Impact and interest:
Citation counts are sourced monthly from and citation databases.
Citations counts from theindexing service can be viewed at the linked Google Scholar™ search.
|Item Type:||Conference Paper|
|Keywords:||Train control, System simulation|
|Subjects:||Australian and New Zealand Standard Research Classification > INFORMATION AND COMPUTING SCIENCES (080000) > ARTIFICIAL INTELLIGENCE AND IMAGE PROCESSING (080100) > Expert Systems (080105)
Australian and New Zealand Standard Research Classification > ENGINEERING (090000) > CIVIL ENGINEERING (090500) > Transport Engineering (090507)
|Divisions:||Past > QUT Faculties & Divisions > Faculty of Built Environment and Engineering
Past > Schools > School of Engineering Systems
|Copyright Owner:||Copyright 2008 IET|
|Deposited On:||22 Nov 2010 22:24|
|Last Modified:||10 Aug 2011 15:54|
Repository Staff Only: item control page