基于双重目标的树枝形专用线取送车优化  

Optimization of placing-in and taking-out wagons on branch-shaped siding considering bi-objective

作　　者：李冰[1] 张志宁 LI Bing;ZHANG Zhi-ning(School of Management Engineering,Zhengzhou University,Zhengzhou 450001,China)

机构地区：[1]郑州大学管理工程学院,河南郑州450001

出　　处：《计算机工程与设计》2020年第9期2460-2468,共9页Computer Engineering and Design

基　　金：国家自然科学基金项目(U1604150、U1804151)。

摘　　要：针对带时间窗的树枝形专用线取送车优化问题,组建基于总调运成本最小与货车总周转时间最小的双目标数学规划模型。鉴于双目标模型复杂,对双目标模型进行基于理想最大值-最小值的归一化处理,设计GA&SA融合求解策略。给出基于作业编号的取送车方案表述,设计嵌入参数自适应策略的GA解更新过程,设置SA算法进行二次寻优,找到较优取送车径路。设计仿真实验,对所提方法进行过程验证,验证结果表明,相对于GA、SA及ACA,融合求解策略GA&SA在解的质量方面表现更佳。Aiming at the optimization problem of placing-in and taking-out wagons on branch-shaped siding with time window,a bi-objective mathematical programming model based on the minimum shunting cost and the minimum turnover time of wagons was formulated.In view of the model complexity of the bi-objective model,the bi-objective model was normalized based on the ideal maximum-minimum value.The genetic algorithm&simulated annealing(GA&SA)strategy was designed.The description of the placing-in and taking-out wagons scheme based on job number was given,the self-adaptive adjustment strategy of genetic parameters in genetic algorithm(GA)was provided to avoid the early maturing of the algorithm,the search space was expanded,the re-optimization process of simulated annealing(SA)algorithm was completed for a better route.Experimental scenario was designed to test the proposed algorithm.The results show that compared with GA,SA and ant colony algorithm(ACA),the merged strategy GA&SA can find a better quality solution.

关 键 词：铁路枢纽 树枝形专用线 取送车 本地作业车 时间窗 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]