基于硬时间窗的技术站解编方案综合协调优化

Comprehensive coordination optimization of train break-up and make-up scheme based on hard time windows at railway technical station

针对现有制定的解编方案无法有效地满足铁路技术站阶段计划配流工作,基于牵引质量和换长的不同硬时间窗满轴约束,并综合考虑车流接续和编组去向约束,以总车流量、满轴出发列车最多为目标,建立了技术站多目标动态配流模型。为实现解编方案综合协调优化,依据解体和编组顺序调整规则,并通过定义可解集合和改进蚁群算法的状态转移规律及信息素更新策略,设计了一种基于蚁群算法的辅助决策支持系统。算例表明该辅助决策支持系统可以缩小配流问题规模,帮助决策者选择满意的解编配流方案,同时可以考虑解编顺序的改变对配流结果带来的影响,做到解体照顾编组,从而为实现铁路技术站调度系统的综合协调优化提供理论支持。

Concerning the existing train break-up and make-up scheme cannot effectively meet the job of stage plan wagon-flow allocating at railway technical station, based on the different hard time window constraints of traction weight and converted length of train, considering constraints of the car flow joining and formation direction, the dynamic wagon-flow allocating model was established by constructing enable-break-up collection, improving the status transition regularity, and updating the pheromone in the ant colony algorithm. The objective of this model was set to maximize the number of vehicles departed and fully loaded departure train. To realize the comprehensive coordination optimization of train break-up and make- up scheme, a decision support system based on ant colony algorithm was designed on the basis of adjustment rules of train break-up and make-up sequence, and by defining a solvable set and improving the status transition regularity and the pheromone update strategy of ant colony algorithm. The result of numerical examples demonstrates that the decision support system can reduce the scale of the wagon-flow allocating problem, effectively help decision-makers choose a satisfactory solution of wagon-flow allocation scheme and get the result of sorting considering marshalling according to the impact of changes in the sequences of train break-up and make-up, so it provides theoretical support for the realization of comprehensive coordination optimization of dispatching system at railway technical station.