关键词: 铁路运输, 调车作业计划, 粒子群优化算法, 动车所, 整数规划, 一级修

Abstract:

It’s an urgent problem to develop and optimize the shunting schedule of electrical multiple units (EMU) depot through automatic computation since the schedule making process is extremely intractable. Based on the analysis of typical procedures of EMU first-level maintenance, this paper formulates the depot shunting schedule optimization problem as an integer programming model. The objective of the model is to minimize the total number of shunting movements and the constraints include track occupation conflicts, route (including shunting route, receiving route and departure route) conflicts and time duration of each maintenance process, etc. Then a PSO- based optimization algorithm is presented to solve the problem. Finally, a case study from Shanghai South EMU Depot is carried out to illustrate the validity of the proposed model and algorithm. The computational results show that an optimal shunting schedule can be obtained within a short solution time using our method. Moreover, both the making efficiency of dispatchers and the quality of schedules are improved.

Key words: railway transportation, shunting schedule, PSO algorithm, electrical multiple units depot, integer programming, first-level maintenance