摘要
不确定情景下的应急物资配送和车辆路径优化问题是目前国内研究的一大热点,其中震后伤员运送车辆调度及路径优化问题随着近几年地震等自然灾害的频繁发生也逐渐引起人们的重视.本文采用聚合优化算法对灾区进行应急救援区域划分,建立了以总救援时间最短和相对综合救援权重值最大为目标的救援车辆两阶段数学规划模型,设计了带三角函数变异的离散型萤火虫优化算法进行求解,并与常规算法求解结果做了对比分析.通过算例进行模拟实验表明,所提出的模型和算法可以有效解决地震情景下的伤员救援车辆调度问题,且改进算法的全局搜索性能更优.
Emergency supplies distribution and vehicle routing optimization in the uncertain environment is a hot topic currently, and vehicle scheduling of transporting of the earthquake-wounded and path optimization are more attractive since earthquakes are frequent. This paper divides multi-depot vehicle routing into single- depot by using polymerization optimization algorithm, builds a two-phase mathematical programming model of rescue vehicles with the shortest total rescue time and maximum relatively comprehensive rescue weight, and designs adiscrete glowworm swarm optimization algorithm with trigonometric function variation to solve the problem. The simulation experiment shows that the proposed model and algorithm can effectively solve the res- cue vehicles scheduling of the earthquake-wounded.
作者
王付宇
叶春明
王涛
赵晶晶
WANG Fu-yu1,2, YE Chun-rning1, WANG Tao2 , ZHAO Jing-jing2(1. School of Management, University of Shanghai for Science and Technology, Shanghai 200093, China ; 2. School of Management Science and Engineering, Anhui University of Technology, Ma＇anshan 243032, Chin)
出处
《管理科学学报》
CSSCI
CSCD
北大核心
2018年第2期68-79,共12页
Journal of Management Sciences in China
基金
国家自然科学基金资助项目(71271138)
教育部人文社会科学青年基金资助项目(14YJC630119)
安徽省高校人文社科研究重大项目(SK2014ZD016)
住建部软科学研究项目(2015-R2-057)
关键词
地震救援
车辆调度
路径优化
改进萤火虫算法
earthquake rescue
vehicle scheduling
path optimization
glowworm swarm optimization algo-rithm
