货物列车的编组调度问题

Problem of Grouping and Deploying of Cargo Trains

研究的是货物列车的编组和调度问题.通过对问题的深入研究,设计了一种车辆编组调度方案的算法.按照这种算法,在数据处理的基础上利用VC编写每个问题的处理程序,实现了对列车的快速安全高效的调度.对每个问题进行处理,都得到符合要求的结果.问题一首先对整个车辆编组调度的问题进行分析,在尽量保证新组装列车满载的基础上,使每班的中时尽可能少.为此,本文解决了两个关键问题:一是选车问题,二是拆解重组的问题.采用梯形方案对列车车辆进行编队重组,对选车问题主要采用按照时间先后顺序的选车方案,然后通过启发式算法配合遗传算法的选车方案对按时间先后顺序的方案进行检验.从编写的VC程序的运行结果来看,两种方案都可得到满意的结果,遗传算法得到的结果更为合理.另外,为了达到中时最短,采用双推双滑的方式利用驼峰线,提高了调度效率,并在驼峰线和编组道之间加入了碰撞检验模块,保证了列车调度时的安全性.问题二的求解是在问题一的基础上对待拆列车按优先级进行分类.对优先级高的列车先进行拆解.救灾车辆最高,其次是军列和发往S1的车辆,最后是一般车辆.问题三的处理主要是在问题二的基础上,通过提前获得列车的相关信息来决定编组场的列车离开编组场的时刻,从而缩短车辆的中时.问题四在原有模型基础上对编组方案进行了修改,利用编写的VC程序重新计算了每班的中时和列车的调度方案.问题五主要分析了整个系统瓶颈所在,分析了提高资源利用率的可行性.最后,通过对站名的调整,达到了对地质灾害等对铁路系统的破坏突发情况的有效处理,并且进一步分析了如何提高车站的效率的调度方案和建议.

This paper mainly researches into the problem of grouping and deploying of cargo trains. Based on thorough study, it comes up with an algorithm dealing with the problems. With datum processed, we can write some VC codes to solve the problem in order to deploy the trains swiftly, safely, and effectively. After all, we get satisfying results. Problem one carries out an analysis of the problem of deploying trains. On the foundation that all the new train groups are at their full capacity, we schedule as less mid-time as possible. For this, this paper worked out two key problems： one is chosing trains, the other is the problem of deploying. This paper used a trapezoid stragedy to carry on the grouping of the trains. In terms of chossing trains, this paper gives priority to time sequence. Also for comparison, another method is mentioned, which combines Heuristic Algorithm and Genetic Algorithm to examine the algorithm. Judging from the running result of the programme written in VC＋＋, boith two methods are satisfying, while Genetic Algorithm is more reasonable. In addition, this paper comes up with a double-push double-slide way making use of hump-line to improve efficiency and to shorten mid-time at most. A collision detection module is introduced to secure the safety of trains as well. Problem Two makes classificiatoins of the priority of different trains, based on Problem One. Our method sets dfifferent priorities for different trains, dizaster rescue trains highest, followed by military trains and trains headed for S1, ordinary lowest. Problem Three mainly deals with the time that trains leave the station in accordence with the informaiton Problem Two provides to achieve shortest mid-time. Problem Four makes some modificaton on the previous method by rewriting some VC codes to recalculate the mid-time and adjust the schedule. Problem Five is about the bottleneck of the system. By analysing the bottleneck can we make researches on the feasibility of improving the working rate. Last but not least, we make some adjustments of the name of the stations to effectively deal with the abrupt damages caused by geologic reasons and on. We also discuss some different methods and suggestions of improving efficiency.