区段站到发线运用优化研究  

Study on the Optimization of the Application of the Section Station to the Hair Line

作　　者：刘源 LIU Yuan(Zhengzhou Railway Bureau Xinxiang Branch,Xinxiang Henan 45300)

机构地区：[1]郑州铁路局新乡车务段,河南新乡453000

出　　处：《河南科技》2018年第8期124-125,共2页Henan Science and Technology

摘　　要：在既有的站场技术设备、技术作业标准和列车运行图等条件确定的情况下,为提高铁路运输组织效率,通过构建整数规划模型,对到发线运用问题进行求解。以到发线占用时间最短为优化目标,以到发线占用满足时空冲突、单一列车占用单一到发线为约束,使用遗传算法进行求解。通过构建到发线占用时间片,疏解列车与到发线占用时空冲突。研究表明,本文建立的整数规划模型可行,并具有较高的求解效率,能较好地对到发线占用问题进行优化。In order to improve the efficiency of railway transportation organization, the integer programming model is applied to solve the problem of arrival and departure line operation under the condition that the existing station technology equipment, technical operation standard and train diagram and other conditions are determined. Taking the shortest occupation time of arrival line as the optimization objective, we use genetic algorithm to solve the problem of occupying line occupancy to meet the conflict of time and space, single train occupancy to single line. The time -space conflict between the train and the hair line is solved by building up the time slice of the hair line.

关 键 词：区段站 到发线运用 遗传算法 

分 类 号：O224[理学—运筹学与控制论]