技术站广义动态配流问题的遗传算法.pdfVIP

第32卷第3期 铁 道 学 报 V01．32 No．3 2 0 1 O年6月 JOURNAL OF THE CHINA RAILWAY SOCIETY June 2010 文章编号：1001—8360(2010)03—0009—07 技术站广义动态配流问题的遗传算法 赵 军， 彭其渊， 文 超， 徐 进 (西南交通大学交通运输学院，四川成都610031) 摘要：技术站广义动态配流问题是在综合考虑优先排空和优先发送较近编组去向车流的编组要求、欠轴列车 停运要求，以及到发列车在时间和车流接续关系的基础上，将静态配流和列车解编方案调整进行协同优化。分别 以阶段内出发列车数最多、出发车辆数最多，车辆在站平均中转时间最短为目标，考虑解体、编组调机能力限制， 到发列车车流接续，列车编组计划和列车运行图的影响约束，建立该问题的优化模型。针对问题机理，设计求解 这一问题的遗传算法：运用启发式规则生成初始群体；运用倒数算子计算适应度函数，对各目标进行无量纲化和 同向化处理；采用轮赌盘选择算子、基于顺序的杂交算子、逆转变异算子和精英保护策略。通过对算例的实验分 析，表明该算法的实用性和计算的高效性。 关键词：技术站；配流；优化模型；遗传算法；动态 中国分类号：U292．16 文献标志码：A doi：10．3969／j．issn．1001-8360．2010．03．002 Genetic Algorithm for Solution to Generalized Dynamic Wagon—flow Allocation Problem with Technical Railway Stations ZHAO Jun，PENG Qi—yuan， WEN Chao，XU Jin (College of Traffic and Transportation，Southwest Jiaotong University，Chengdu 610031，China) Abstract：The generalized dynamic wagon—flow allocation problem(GDWFAP)with technical railway stations is related to optimized design to get the static wagon—flow allocation process(SWFAP)in coordination with the train break—up and make—up sequence adjustment process，which takes into comprehensive consideration the train make—up rules，train stop rules，and relationships between arrival and departure trains．The train make—up rules give priority to sending of empty wagons and loaded wagon flows with near destinations．The relationships between arrival and departure trains are related to time and connection of wagon flows．The maximized number of departure trains and departure wagons and the shorted average transfer time per wagon at station are aimed at．Taking into account the capacity limit of the break—up and make—up shunting locomotive，the connection between arrival and departure trains，the train formation plan and the train diagram，the optimal GDWFAP model is established．The genetic algorithm is designed on the basis of the feature of the problem to be re— solved：the initialization population is produced by the heuristics rules；the fitness function is c