Study on Model and Optimization Algorithm of Multi-Vehicle and Multi-Depot Emergency Vehicle Dispatch Problem

Yang Wang, Fan Lin, Tiejun Wang, Kaijun Wu
{"title":"Study on Model and Optimization Algorithm of Multi-Vehicle and Multi-Depot Emergency Vehicle Dispatch Problem","authors":"Yang Wang, Fan Lin, Tiejun Wang, Kaijun Wu","doi":"10.14257/ijhit.2017.10.5.02","DOIUrl":null,"url":null,"abstract":"The multi-type vehicle and multi-depot emergency vehicle dispatch is a typical problem in emergency scheduling, and it is a NP puzzle. Under the constrains of transportation cost and carrying load, etc., a mathematical model concerning this problem was constructed in present study; and then it was solved by an improved gravitational search algorithm (GSA). Because the standard GSA is easily trapped in local optimum and appears “precocious phenomenon”, an improved GSA was proposed to modify gravity coefficient and velocity in selection formula, and to choose the updated particle’s positions according to the principle of survival of the fittest. The simulation results show that this proposed algorithm is feasible and effective, and is superior to differential evolution algorithm and the standard GSA in solving the problem of multi-type vehicle and multi-depot emergency vehicle dispatch.","PeriodicalId":170772,"journal":{"name":"International Journal of Hybrid Information Technology","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Hybrid Information Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.14257/ijhit.2017.10.5.02","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The multi-type vehicle and multi-depot emergency vehicle dispatch is a typical problem in emergency scheduling, and it is a NP puzzle. Under the constrains of transportation cost and carrying load, etc., a mathematical model concerning this problem was constructed in present study; and then it was solved by an improved gravitational search algorithm (GSA). Because the standard GSA is easily trapped in local optimum and appears “precocious phenomenon”, an improved GSA was proposed to modify gravity coefficient and velocity in selection formula, and to choose the updated particle’s positions according to the principle of survival of the fittest. The simulation results show that this proposed algorithm is feasible and effective, and is superior to differential evolution algorithm and the standard GSA in solving the problem of multi-type vehicle and multi-depot emergency vehicle dispatch.
多车多库应急车辆调度问题模型及优化算法研究
多车型多车辆段应急车辆调度是应急调度中的一个典型问题,是一个NP难题。在运输成本、载重量等约束下,建立了该问题的数学模型;然后用改进的引力搜索算法(GSA)求解。由于标准GSA容易陷入局部最优,出现“早熟现象”,提出了一种改进的GSA,修改选择公式中的重力系数和速度,并根据优胜劣汰原则选择更新后的粒子位置。仿真结果表明,该算法可行有效,在解决多车型、多车场应急车辆调度问题上优于差分进化算法和标准GSA算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信