首页 | 本学科首页   官方微博 | 高级检索  
     

多受灾点应急救援车辆调度的优化遗传算法
引用本文:喻德旷,杨谊.多受灾点应急救援车辆调度的优化遗传算法[J].计算机系统应用,2016,25(11):201-207.
作者姓名:喻德旷  杨谊
作者单位:南方医科大学 生物医学工程学院, 广州 510515,南方医科大学 生物医学工程学院, 广州 510515
基金项目:广东省科技计划(2013B051000054,2014A020212545)
摘    要:在多个地区发生灾害后,迫切需要及时救援和物资的快速运输,从仓库调拨物资到受灾点,交通网络规模较大,运输货物类型多样,并且要满足各个受灾点的资源需求、实时路况、运抵时限要求等多个目标约束条件,车辆调度具有较大难度.为解决多重约束带来的困难,根据遗传算法的生物进化理论和群体遗传学机制,建立了车辆应急运输的多目标优化问题模型,设计合适的序列编码方式表示车辆行进路线及运输货物类型;建立了新的优化遗传算法,从编码方式的设计、适应度函数、选择、交叉和变异操作机制的设计三个方面做了创新改进,主动保持优良基因,根据阶段进展调节交叉和变异概率,有效提高好的新模式的产生几率,较好地克服了已有方法的早熟局部收敛所导致的结果偏差较大的不足.多个仿真实验结果表明,优化遗传算法比已有算法在满足送达时限以及送达时间的总长度等方面均有较大提高,对于复杂的调度任务,在保证运抵时限的前提下,可占用更少的车辆,花费更少的行进时间完成物资运输,从而满足多受灾点对物资的实时性需求.

关 键 词:多受灾点  多物资  应急救援  车辆调度  优化遗传算法
收稿时间:3/9/2016 12:00:00 AM
修稿时间:4/8/2016 12:00:00 AM

Optimized Genetic Algorithm for Vehicle Scheduling Problem in Emergency Rescue of Multiple Disaster Areas
YU De-Kuang and YANG Yi.Optimized Genetic Algorithm for Vehicle Scheduling Problem in Emergency Rescue of Multiple Disaster Areas[J].Computer Systems& Applications,2016,25(11):201-207.
Authors:YU De-Kuang and YANG Yi
Affiliation:School of Biomedical Engineering, Southern Medical University, Guangzhou 510515, China and School of Biomedical Engineering, Southern Medical University, Guangzhou 510515, China
Abstract:Disaster relief demands urgent need for rapid transport of supplies. Vehicle transportation scheduling is based on large-scaled and real-time traffic network with time limit constraints and various supplies for multiple destinations lay the difficult points. To attain the target, multi objective optimization model for vehicle emergency transportation is built, and an optimized genetic algorithm is put forward to solve the vehicle scheduling problem in emergency rescue with multiple constranins including road variation, arrival deadlines and multiple materials. Based on the theory of biological evolution and principles of population genetics, the optimized algorithm takes the multi spots and in-fact road conditions into consideration, makes focus on the multiple material demands and the precedence on the arrival time without delay, designed a new coding pattern which made new encoding mode design, adaptive function, new selection, crossover and variation operators, and new generation mechanism to produce more and better patterns in less time, so as to overcome the premature convergence of the classic genetic algorithm. Tests proved the better performance of the proposed algorithm in finding the global optimized solution than the traditional genetic algorithm in delivery time constrains and the total length of arrival time, with less vehicles involved and less solving time. The proposed method can improve the transportation efficiency of disaster relief and cut down the vehicle cost, and meet the demands of complex vehicle scheduling tasks.
Keywords:multiple disaster areas  multiple materials  emergency rescue  vehicle scheduling  optimized genetic algorithm
点击此处可从《计算机系统应用》浏览原始摘要信息
点击此处可从《计算机系统应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号