铁路客运站股道运用窗时排序模型与算法

股道运用计划是实现CTC条件下客运站分散自律控制的关键。以时刻表、股道和站台为研究对象,结合进路编排、维修和列车早晚点时间窗,在分析股道运用平行机排序和多目标排序问题的基础上,运用现代排序理论,以总费用最小和股道均衡使用为目标函数,建立股道运用第一类多目标窗时排序模型。采用基本和合成分派规则、解改进优化策略,设计自律优化算法和3步算法制订和调整股道运用计划。实例表明:软时间窗下的规则解、近似解平均比硬时间窗下的解优化17.8%、14.1%,硬时间窗解收敛速度较快,采用θ规则在两类时间窗下均能得到较优解;制订计划时,宜综合采用各种分派规则尤其是规则6和θ规则,调整时宜直接采用规则10、12。提出的模型及算法能快速、合理地制订股道运用计划,有效解决带有时间窗的股道运用问题,并充分运用车站的各项资源。

Due Windows Scheduling Model and Algorithm of Track Utilization in Railway Passenger Stations

Track utilization planning is the key point of realizing decentralized and self-regulated control in railway passenger stations under the condition of CTC.Taking timetables,tracks and platforms as research objects,combining with route arrangement,maintenance and train early and delay time windows,analyzing parallel processors scheduling and multicriteria scheduling of track utilization and applying the modern scheduling theory,the due windows and multicriteria scheduling I model is established with the minimum total costs and balanced track utilization as its objective functions.Adopting the basic and composite dispatching rules and local improvement strategies,the self-regulated optimization algorithm and three-step algorithm are designed to make and adjust plans of track utilization.Instance study demonstrates as follows: Averagely speaking,the rule and approximate solutions with soft time windows are better than those with hard time windows by 17.8% and 14.1% respectively;the convergence speed of solutions with hard time windows is much faster,so better solutions can be achieved by using Rule θ with both soft and hard time windows;it is suitable to integrate all dispatching rules,especially Rules 6 and θ,to make plans and to utilize Rules 10 and 12 directly to adjust the plans.It is seen that plans of track utilization can be made quickly and reasonably by use of the proposed model and algorithms.Track utilization with time windows can be accomplished effectively and all resources in stations can be fully utilized.