铁路客技站车底作业耦合窗时排序模型与算法

Coupled Due Windows Scheduling Model and Algorithm of Carriage Operations Arrangements in Railway Technology Stations

车底作业耦合问题是指如何统筹安排车底在站各项技术作业,解决行车及调车作业干扰问题,对实现CTC条件下铁路客技站分散自律控制具有重要意义。以车底和调机、股道、进路等可再生资源为研究对象,结合维修、到达和完工时间窗,建立车底停靠与取送作业窗时排序模型;通过构造车底作业到达时间和交货期的满意度隶属函数,以车底取送时间表为耦合因子,运用现代排序理论,构建车底作业耦合窗时排序模型。采用基本和合成分派规则,结合资源再生过程,提出自律耦合优化算法制订车底在站作业计划。实例表明,所提出的模型与算法能全面、合理地制订车底在站作业计划,有效解决行车及调车作业干扰问题,并充分运用车站各项设备。

The carriage operations coupling problem means how to make an overall arrangement of various technology operations of carriages to solve the disturbance problems among technical and shunting operations effectively,which has high guiding significance for realizing decentralized and self-regulated control in CTC-installed railway technology stations.Through taking carriages and renewable resources such as shunting locomotives,tracks,routes and etc as research objects and combining with maintenance,arrival and completion time windows,carriages stopping by tracks and placing-in and taking-out operation due windows scheduling models are both put forward.Then,satisfaction membership functions of the arrival time and due date of carriages are constructed,also,taking the carriage placing-in and taking-out operations timetable as the coupling factor and utilizing the modern scheduling theory,the coupled due windows scheduling model is put forward.Utilizing basic and composite dispatching rules and combining with regeneration processes of resources,the self-regulated and coupled optimal algorithm is designed to make carriage operations arrangements in railway stations.The instance demonstrates that the models and algorithm can make carriage operations arrangements quickly and reasonably.Besides,the disturbance problems among technical and shunting operations can be solved effectively and the equipments in railway stations can also be fully utilized.