铁路集装箱空箱动态优化调度模型及求解算法

根据铁路集装箱空箱调度的业务优先原则,以最大限度地提高区域内空箱的利用率和减小空箱调度的成本为目标,建立了在一个计划期内的铁路集装箱空箱动态优化调度模型.综合运用优先等级法和遗传算法对模型进行求解,解决了在一个计划期内,如何最优化地对每个工作日的空箱进行区域性调度的问题.通过计算机仿真实验,并与现行的调度方法进行比较,证明了模型和算法的有效性.

Dynamic Dispatch Optimization Model and Solution Algorithm of Railway Empty Container

In order to enhance the utilization ratio to the maximum and reduce the dispatch cost of empty containers to the minimum in an area, a dynamic dispatch optimization model within a plan period was built based on the Operation First Principle. The dispatch problem was solved by using priority rating method and genetic algorithm synthetically. The computer simulation result proves the validity of the model and the algorithm by comparing the current dispatch method with the traditional dispatch method.