基于均衡运用原则的列车运营日计划编配研究

摘要

科学进行列车运营日计划编配对提高列车运营效率具有重要意义.提出了一种基于改进的最优-最差蚁群算法 (BWAS) 的车次车号匹配算法.对列车运营日计划表进行分析并对列车运营日计划编配问题进行描述;以车组号与车次匹配度最高为优化目标, 以唯一性约束、早高峰指定车次约束、道岔转换最小时间约束、出库便捷性约束为约束条件, 建立基于改进BWAS的列车运营日计划编配模型;结合实际车组、车次及股道信息进行仿真分析, 结果表明, 该算法可在短时间内收敛并使车组运用均衡性得到显著提升.%Scientific arrangement of the daily allocation plan for train operation has important significance to improve the operation efficiency. In this paper, a new train number and trip matching algorithm based on the improved BWAS (best and worst ant colony algorithm) is presented. Firstly, the daily schedule of train operation is analyzed and the mathematical model of the train allocation problem is described; then, taking the highest matching degree between train unit number and trip matching number as the optimization target, taking the uniqueness constraint, the early peak and designated train order constraint, the minimum sw itching time constraint and the convenience constraint as the constrained conditions, a model of the train operation daily schedule based on the improved BWAS is established. Finally, the actual vehicle, trip and stock information are simulated, and the results show that the improved BWAS algorithm can converge in a short time to improve the balanced vehicle operation greatly.