Optimization of Shunting Operation Plan for Detaching and Attaching Trains Based on Q-Learning Algorithm

被引:0
|
作者
Shi J. [1 ,2 ]
Chen L. [1 ]
Lin B. [3 ]
Meng G. [1 ]
Xia S. [1 ]
机构
[1] College of Engineering, Zhejiang Normal University, Jinhua
[2] Key Laboratory of Urban Rail Transit Intelligent Operation and Maintenance Technology & Equipment of Zhejiang Province, Zhejiang Normal University, Jinhua
[3] School of Traffic and Transportation, Beijing Jiaotong University, Beijing
来源
Zhongguo Tiedao Kexue/China Railway Science | 2022年 / 43卷 / 01期
关键词
Detaching and attaching trains; Q-learning algorithm; Railway transportation; Reinforcement learning; Shunting operation;
D O I
10.3969/j.issn.1001-4632.2022.01.19
中图分类号
学科分类号
摘要
For the formulation of shunting operation plan of detaching and attaching trains marshalling, an optimization method for shunting operation plan was proposed based on the reinforcement learning technology and Q-learning algorithm. The shunting operation plan was divided into fall and restructure based on the tabulation method. The reinforcement learning model of the shunting operation problem was constructed by three elements including action, state, and reward. Taking the shunting locomotive as the agent, the track number of train group fall-down as the action, and the fall-down condition of the train group waiting to be marshaled as the state, the specific conditions of detaching and attaching trains and the restructuring process of the train group were established. The reward function was designed according to the connecting state of the train group fall-down and the total shunting distance after restructuring the trains. The Q-learning algorithm was improved to solve the model. The mapping relationship of the trains waiting to be marshaled and the optimal shunting operation plan was established with the goal of minimizing the shunting distance. The optimal shunting operation plan could be obtained with the adequate learning of agents. The proposed method was verified by comparing three sets of examples. The results show that compared with the overall planning and coordinating method and the binary search tree algorithm, the proposed method can get a better shunting operation plan with fewer tracks. Compared with the branch-and-bound algorithm, this method can solve the shunting operation plan with approximate quality in a shorter time. Therefore, the proposed method serves to improve the intelligent decision-making level of the shunting operation planning for stations. © 2022, Editorial Department of China Railway Science. All right reserved.
引用
收藏
页码:163 / 170
页数:7
相关论文
共 16 条
  • [1] (2011)
  • [2] On the Mathematical Foundation of the Tabulation Method for Marshalling Railway Cars into a Train i-‍Ⅱ, Journal of Shandong University: Natural Science, 14, 4, pp. 1-15, (1979)
  • [3] pp. 59-83, (1980)
  • [4] SONG Jianye, A Research on Optimizing the Cut Plan Schemes of Forming Pick-Up and Set-Out Trains, Journal of Lanzhou Railway Institute, 15, 2, pp. 54-63, (1996)
  • [5] GAO Siwei, ZHANG Dianye, Elimination of Inverse-Order-a New Model of Shunting Operation, Journal of the China Railway Society, 25, 5, pp. 1-7, (2003)
  • [6] LIU Yanhu, Research on Model and Arithmetic of Making-up Shunting Operation Plan, (2008)
  • [7] WANG Yalin, XIAO Yuan, LEI Youcheng, Et al., Automatic Compilation Method for Marshalling Coupler Plan of Trains Detaching and Attaching Based on Binary Search Tree, China Railway Science, 33, 3, pp. 116-122, (2012)
  • [8] ZHAO Liang, Research on Optimization of Classifying Shunting Operation Plan for District Local Train, (2012)
  • [9] ZHANG Bojian, PENG Qiyuan, LI Li, Et al., Train Shunting Operation Scheduling with Number of Wagon Moves Oriented Optimization, Journal of the China Railway Society, 42, 3, pp. 11-20, (2020)
  • [10] WATKINS C J C H, DAYAN P., Technical Note: Q-Learning [J], Machine Learning, 8, 3, pp. 279-292, (1992)