基于离散混合蛙跳算法的地震应急物资调度
Emergency Material Scheduling Based on Discrete Shuffled Frog Leaping Algorithm
申晓宁 1葛忠佩 2姚铖滨 2宋丽妍 3王玉芳1
作者信息
- 1. 南京信息工程大学 自动化学院,江苏 南京 210044;江苏省大气环境与装备技术协同创新中心,江苏 南京 210044;江苏省大数据分析技术重点实验室,江苏 南京 210044
- 2. 南京信息工程大学 自动化学院,江苏 南京 210044
- 3. 广东省类脑智能计算重点实验室(南方科技大学),广东 深圳 518055
- 折叠
摘要
建立震后应急物资调度数学模型.该模型根据各灾区的受灾情况评估其救援紧急程度,并设计一种需求拆分供应的运输机制,提高车辆的利用效率.为求解该模型,提出一种多源信息学习的离散混合蛙跳算法.所提算法引入多种信息源以扩展算法的搜索方向,降低种群的同化速度.同时,让子组最差个体学习种群中的有效信息,提高算法的收敛精度.实验结果表明,所提算法能够搜索到精度更优的调度方案,对问题规模具有良好的可扩展性.
Abstract
A mathematical model of emergency material scheduling after earthquakes is built.The model evaluates the emergency degree of each disaster area based on the disaster situation and designs a method to split the demand of the disaster area,improving the efficiency of vehicle utilization.To solve the model,this paper proposes a discrete shuffled frog leaping algorithm with multi-resource learning.The multiple information sources introduced by the proposed algorithm can expand the search direction and reduce the assimilation speed of the population in the algorithm.Second,the worst individual in each subgroup can learn the effective information in the population to improve the convergence accuracy of the algorithm.Experimental results show that the proposed algorithm can obtain a higher-quality scheduling scheme and has good scalability for the scale of emergency material scheduling.
关键词
应急物资调度/混合蛙跳算法/灾区紧急程度/需求拆分供应/车辆路径问题Key words
emergency material scheduling/shuffled frog leaping algorithm/emergency degree/split delivery/vehicle routing problem引用本文复制引用
基金项目
国家自然科学基金(61502239)
国家自然科学基金(51705260)
江苏省自然科学基金(BK20150924)
出版年
2024
NETL
NSTL
维普
万方数据