期刊文献+

基于多目标遗传算法的灾后可靠路径选择 被引量:5

Reliable path selection after disaster based on multi-objective genetic algorithm
下载PDF
导出
摘要 为了尽快运出灾民、运进物资,灾后需要选择最短的运输路径;考虑到灾害对道路的损毁,安全的路径是道路选择中的重要因素,基于灾后道路的损毁状况,采用3种方法定义道路可靠性,以最小化路径长度、最大化路径可靠性为目标建立双目标优化模型,采用多目标遗传算法求解.分别求得3种情形下的解,开展2个目标的Pareto分析;分析交叉概率和变异概率对结果的影响:交叉概率增大,覆盖范围波动式变化,理想积波动式下降;变异概率增大,覆盖范围波动式变化,理想积缓慢增长后逐渐下降.采用遗传算法能够有效地解决最短和最可靠路径的搜索问题. The shortest path is needed to transport victims and materials as soon as possible.Safe path becomes the critical factor in road selection considering the road damage in the disaster.Three means were adopted to define the road reliability based on the damage condition of roads after a disaster,and a bi-objective optimization model was established.The model tries to minimize the length of road and maximize the roads' reliability.The priority-based multi-objective genetic algorithm was used to handle the problem.The solutions were respectively got under three situations.Pareto analysis was conducted.The impacts of crossover rate and mutation rate on the results were analyzed.With the crossover ratio increases,the coverage fluctuates and the fluctuated ideal volume decreases.With the mutation ratio increases,the coverage fluctuates and the ideal volume grows slowly and then gradually declines.The genetic algorithm can effectively solve the shortest and most reliable path problem.
作者 李清 胡志华
出处 《浙江大学学报(工学版)》 EI CAS CSCD 北大核心 2016年第1期33-40,47,共9页 Journal of Zhejiang University:Engineering Science
基金 国家自然科学基金青年资助项目(71101088) 国家自然科学基金面上项目(71171129) 国家自然科学基金资助项目(71390521) 上海市曙光计划资助项目(13SG48) 教育部博士点基金资助项目(20113121120002 20123121110004) 上海市科委资助项目(11510501900 12510501600 12ZR1412800) 上海市教委科研创新资助项目(14YZ100) 上海海事大学研究生学术新人培育项目(YXR2014075)
关键词 最短路问题 多目标遗传算法 优先权 可靠性 shortest path problem multi-objective genetic algorithm priority reliability
  • 相关文献

参考文献19

  • 1闫化海,徐寅峰.不完全信息下交通网络最短路径关键边问题[J].系统工程,2006,24(2):37-40. 被引量:17
  • 2NAZEMI A, OM1DI F. An efficient dynamic model for solving the shortest path problem [J]. Transportation Research Part C, 2013, 26(2013) : 1 - 19.
  • 3FESTA P, GUERRIERO F, LAGANA D, et al. Sol- ving the shortest path tour problem [J]. European Jour- nal of Operational Research, 2013, 230(2013): 464- 474.
  • 4AMIRTEIMOORI A. An extended shortest path prob- lem: a data envelopment analysis approach [J]. Applied Mathematics Letters, 2012, 25(2012) : 1839 - 1843.
  • 5ASAKURA Y, KASHIWADANI M. Road network re- liability caused by daily fluctuation of traffic flow [C]// Proceedings of the 19th PTRC Summer Annual Meeting. Brighton: rs. n., 1991: 73-84.
  • 6CHEN A, YANG H, LO H. Capacity reliability of a road network: an assessment methodology and numeri- cal results [J]. Transportation Research Part B: Meth- odological, 2002, 36(3): 225-252.
  • 7ARDAKANI M K, TAVANA M. A decremental approach with the A algorithm for speeding-up the optimization process in dynamic shortest path problems [J]. Measurement, 2015, 60(2015) .. 299-307.
  • 8靳凯文,李春葆,秦前清.基于蚁群算法的最短路径搜索方法研究[J].公路交通科技,2006,23(3):128-130. 被引量:41
  • 9LOZANO L, MEDAGLIA A S L. On an exact method for the constrained shortest path problem [J]. Comput- ers and Operations Research, 2013, 40 ( 2013 ): 378 - 384.
  • 10CHENG J, LISSER A. Maximum probability shortest path problem [J ]. Discrete Applied Mathematics, 2015, 192(2015): 40-48.

二级参考文献43

共引文献146

同被引文献36

引证文献5

二级引证文献11

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部