双向编组站列车调度调整的优化模型及算法  

Optimal Model and Algorithm for Adjusting the Dispatching Plan of Trains Operated at Double-Direction Classification Yards

作　　者：牛惠民[1] 

机构地区：[1]兰州交通大学交通运输学院,甘肃兰州730070

出　　处：《中国铁道科学》2007年第6期102-108,共7页China Railway Science

基　　金：甘肃省自然科学基金资助项目(ZS031-A25-023G);兰州交通大学青蓝人才基金资助项目

摘　　要：研究双向编组站调度优化问题,以解决到达列车接入系统和出发列车编组系统的实时调度调整。在分析双向编组站作业机理和规律的基础上,以列车的编成辆数、编组内容、接续时间、集结地点和作业能力为约束条件,以列车的走行距离、所产生的交换车数为综合优化目标,构造双向编组站列车调度调整的非线性优化模型。根据模型NP-Hard性和变量高度相关性的特点,建立基于网络流技术的遗传算法求解理论。算法的主要思想是在假定0-1变量已经确定的条件下,将整数变量的确定归结为求解网络最小费用流问题。以郑州北编组站为背景,给出算法的实际求解过程。求解算例表明,提出的方法能够有效解决到达列车和出发列车作业地点的实时选择问题。This paper studies the dispatching optimization problem for double-direction classification yards, the aim is to adjust the operation systems of arriving and departing trains at real time level. Based on the analysis of operation mechanism and regularity, a nonlinear optimal model for adjusting the dispatching plan of trains operated at double-direction classification yards is constructed, where the objective is to min- imize the running distances and the number of exchange cars, subject to the constraints of the number, the makeup, the joining time and the accumulating location for operated trains. A hybrid genetic algorithm based on the network flow technique is developed according to the characteristics associated with the NPHard and the variable relationship. The main idea is to calculate the integer variables using the network algorithm of minimum cost flow considering that the zero and one variables are already determined. A real example applied to Zhengzhou North Classification Yards is achieved successfully by the method built in this paper. The study indicates that the proposed method can effectively solve the selecting problem of operation sites for arriving and departing trains at real time level.

关 键 词：双向编组站 接发系统 调度调整 网络流方法 遗传算法 

分 类 号：U292.16[交通运输工程—交通运输规划与管理] U292.22[交通运输工程—道路与铁道工程]