树枝形铁路专用线取送车作业模型及启发式算法  

Wagons' placing-in and taking-out model in branch-shaped railway and its heuristic algorithm

作　　者：郭垂江[1] 雷定猷[1] 

机构地区：[1]中南大学交通运输工程学院,湖南长沙410075

出　　处：《铁道科学与工程学报》2015年第1期208-213,共6页Journal of Railway Science and Engineering

摘　　要：合理安排铁路专用线取送车顺序,有利于提高调车机车作业效率、加速货车周转。以调车机车完成一批调车作业任务后所走行路程最短为优化目标;为便于区分,增设虚拟车站,并以各装卸作业点和车站为顶点;以根据作业情况不同调整后的作业点间距离为线段权,建立树枝形专用线取送车作业的哈密尔顿图模型,指出合理的取送车顺序为满足所有优先权关系的哈密尔顿回路。设计启发式算法进行求解,以不同作业的起点为始点,顺或逆时针确定机车下一访问作业点,从而形成不同的初始解,采用局部交换作业顺序规则对目前解进行改进,选择机车走行路程最短的路径为满意解。其他作业形式可认为是送调取结合作业形式的简化形式,所提出的模型及算法同样适用。Reasonable arrangement on sequence of wagons＇placing -in and taking -out in railway siding is ben- eficial to improve the efficiency of shunting locomotive, and is conductive to accelerate wagons turnover. It was taken as an objective to minimize the locomotive＇s running distance after completing a series of shunting opera- tions. In order to distinguish them with ease, virtual stations were added. Taking loading and unloading sites and stations as vertices, and considering the adjusted distance between operation sites according to different operation situations as weights, the graph model of wagons placing - in and taking - out in branch - shaped railway siding was formulated. Rational placing - in and taking - out sequences were Hamilton loops which satisfy all priorities. A heuristic algorithm was designed to solve it. Taking origination of different operation as the starting point, dif- ferent initial solutions were formulated through determining the next operating point according to clockwise or counterclockwise direction. The current solutions were improved with local exchange rules, and the route with shortest distance was selected as the satisfied solution. Other forms could be considered as simplified forms of wagons＇placing- in, taking- out and transferring combination. The model and algorithm proposed in this paper are also applicable for them.

关 键 词：铁路 树枝形专用线 取送车 启发式算法 

分 类 号：U292.13[交通运输工程—交通运输规划与管理]