基于时间约束的铁路空车调配模型与算法
Time Restraint-BasedM odel and Algorithm for Railway EmptyW agon Distribution
-
摘要: 为弥补现有的调配方法没有考虑排空站重车运输资源的利用率和空车调配的时效性的不足,在传统空 车调配数学模型的基础上,提出了基于时间约束的空车调配模型和求解算法.通过合理利用排空站可利用的空 车,将空车和重车结合起来优化调配,达到减少空车走行距离的目的.算例分析表明了模型的正确性和算法的合 理性.Abstract: Traditionalmathematical optimalmodels for empty wagon distribution do not consider the time efficiency of emptywagon distribution and efficientusage ofemptywagons by loading them where they are or in the neighboring stations. To overcome the shortcomings of the traditionalmodels, a new model and its algorithm were proposed. In the proposedmode,l time restraintwas taken into accoun,t and the distribution ofboth loaded and emptywagons is calculated bymaking good use of the available emptywagons in the stations where they are to be delivered to decrease the delivering distances of emptywagons. The feasibility of the proposedmodel and algorithm was verifiedwith an example.
-
Key words:
- railway /
- distribution of emptywagons /
- time restraint /
- model /
- algorithm /
- optimization
点击查看大图
计量
- 文章访问数: 1646
- HTML全文浏览量: 70
- PDF下载量: 220
- 被引次数: 0