Abstract
The scientific arrangement of the train operation daily schedule allocation has important significance to improve the efficiency of train operation. This paper presents a new train number and trip number matching algorithm based on improved best–worst ant system. First, train operation daily schedule is analyzed and the mathematical model of the problem is described. Then, taking the highest degree of match between the train and the trip as the optimization target, uniqueness constraint, morning peak and designated train order constraint, turnout turn-off times minimum time constraint, and convenience constraint as the constraints, a model of the train operation daily schedule based on improved BWAS is established. Finally, the simulation experiment is carried out with the actual trains, trips, and tracks information, the experimental results show that the algorithm can converge in a short time and greatly improve the balanced use of train, and verify the effectiveness of the algorithm.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Zhongkai W, Tianyun S (2012) Model and algorithm for the integrative scheduling of EMU utilization plan and maintenance plan. China Railway Sci 33(3):104–110 (in Chinese)
Lu T (2009) Application of ant colony algorithm in train-set scheduling problem. J Transp Syst Eng Inf Technol 9(6):161–167 (in Chinese)
Chen L (2009) Application of genetic algorithms to electric multiple unit scheduling. J Transp Eng Info 7(2):67–71 (in Chinese)
Hong SP, Kim KM, Lee K et al (2009) A pragmatic algorithm for the train-set routing: the case of Korea high-speed railway. Omega 37(3):637–645
Abbink E, Van den Berg B, Kroon L et al (2004) Allocation of railway rolling stock for passenger trains. Transp Sci 38(1):33–41
Wen Y (2014) Ant colony optimization method for complex multi-stage dynamic decision making and its application in traffic system control. Zhejiang University. (in Chinese)
Hongbing L (2010) Static clustering routing algorithm based on best-worst ant system for wireless sensor networks. Telecommu Eng 50(4):96–101 (in Chinese)
Dorigo M, Birattari M, Stutzle T (2006) Ant colony optimization. IEEE Comput Intell Mag 1(4):28–39
Ghoseiri K, Nadjari B (2010) An ant colony optimization algorithm for the bi-objective shortest path problem. Appl Soft Comput 10(4):1237–1246
Acknowledgements
This work is supported by National Key R&D Program of China (2017YFB1201202).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Wu, B., Xing, Z., Zang, Y. (2018). Research on Train Operation Daily Schedule Based on Balanced Use. In: Jia, L., Qin, Y., Suo, J., Feng, J., Diao, L., An, M. (eds) Proceedings of the 3rd International Conference on Electrical and Information Technologies for Rail Transportation (EITRT) 2017. EITRT 2017. Lecture Notes in Electrical Engineering, vol 483. Springer, Singapore. https://doi.org/10.1007/978-981-10-7989-4_84
Download citation
DOI: https://doi.org/10.1007/978-981-10-7989-4_84
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-7988-7
Online ISBN: 978-981-10-7989-4
eBook Packages: EnergyEnergy (R0)