基于免疫算法的铁路危货运输径路优化  

Transportation Path Optimization of Railway Hazardous Goods Based on Immune Algorithm

作　　者：孔德扬 王梦杰 高磊 KONG Deyang;WANG Mengjie;GAO Lei(School of Traffic and Transportation,Xi'an Traffic Engineering Institute,Xi'an 710000,China)

机构地区：[1]西安交通工程学院交通运输学院,西安710300

出　　处：《西安交通工程学院学术研究》2021年第1期15-22,共8页Academic Research of Xi'an Traffic Engineering Institute

摘　　要：为保证铁路危险品运输安全,优化危险品运输径路,在深入分析运输整体流程的基础上,提出危险品运输可沿特定径路运行。在考虑运输径路长度、时间、人口密度等基本因素的基础上,加入列车对数、客车扣除系数、线路坡度等适应度较高的自变量,创建以安全风险、运输时间和运输收益为3个子目标的0-1非线性整数多目标规划模型。根据子目标函数涉及的准则层指标,使用层次分析法(AHP)确认子目标函数的权重值,将多目标模型线性转化单目标模型。利用各技术站到达其他车站的独立车流组号,确定网络中各点相互连接情况,构建带权邻接矩阵,选用免疫算法(IA)进行求解,并利用沈阳铁路局集团公司管内相关车站进行验证。结果表明:大虎山-吉林的危险品最优径路目标函数值F=15.162708,途中有调中转1次,相比距离最短的径路增加了47.569公里,免疫算法能够在40代以内快速收敛。In order to ensure the railway transportation safety of hazardous goods and optimize the transportation path of hazardous goods,based on the in-depth analysis of the overall transportation process,it is proposed that hazardous goods transportation should transport with a specific path.On the basis of considering the length,path,time,population density and other basic factors of transportation,the 0-1 non-linear integer multi-objective programming model with safety risk,transportation time and transportation revenue as three subgoals is established by adding the independent variables with high fitness such as train pairs,passenger train removal coefficient and line slope.According to the criterion layer indexes involved in the subgoal function,analytic hierarchy process(AHP)is used to confirm the weight value of the sub objective function,and the multi-objective model is transformed into a single objective model.Using the independent traffic flow number from each technical station to other stations,the interconnection of each point in the network is determined,the weighted adjacency matrix is constructed,and the immune algorithm(IA)is used to solve the problem,and the relevant stations in the Shenyang Railway Bureau Group Company are used for verification.The results show that the objective function value of Dahushan-a hazardous goods optimal path in Jilin is F=15.162708,there is one transit with resorting,which increases by 47.569 km compared with the shortest path,and the immune algorithm can converge quickly within 40 generations.

关 键 词：交通规划 危险品运输径路 特定径路 0-1非线性整数多目标规划模型 免疫算法隔开 

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