摘要
研究地铁终点站的实时调度问题,主要包括列车进站折返路线的安排和列车出站时间的调整.将该问题建模成一个带阻塞的车间作业调度的双目标优化问题,2个目标函数分别为最优化准时性和规律性,即最小化列车的早点/晚点时间和最优化连续两车的间隔.分2个阶段进行优化,首先,在只考虑准时性的前提下优化第一个目标函数,然后在不影响第一个目标函数的基础上优化第二个目标函数.提出了最小化早点/晚点时间的贪心算法和保证准时性前提下最优化连续两车间隔的分组迭代算法.采用C#技术实现了原型系统,对所提方案进行了验证.实验结果表明,所提算法能够出色完成实时调度的任务.
The real time scheduling problem of a metro rail terminus is researched, which includes routing incoming trains through the station and scheduling their departures. The problem is modeled as a bi-criteria blocking job shop scheduling problem, and two objective functions are optimizing punctuality and regularity, that is, minimization of tardiness/earliness and headway optimization. The problem is solved in two steps. Firstly, punctuality is optimized by considering the first objec- tive function only, then the regularity is optimized without affecting the first objective function. Tar- diness/earliness is minimized by introducing greedy algorithm, and a grouping iterative algorithm for optimizing the headway is presented without deteriorating the first objective. A prototype system is implemented using C# to verify the proposed methods. Experimental results show that the proposed algorithms perform well for the real-time trains scheduling.
出处
《东南大学学报（自然科学版）》
EI
CAS
CSCD
北大核心
2010年第1期47-51,共5页
Journal of Southeast University：Natural Science Edition
关键词
实时
准时性
规律性
车间作业调度
阻塞
real time
punctuality
regularity
job-shop scheduling
blocking
