Optimal Collaborative Scheduling of Multi-Aircraft Types for Forest Fires General Aviation Rescue

IF 0.1 4区 工程技术 Q4 ENGINEERING, AEROSPACE
Weijun Pan, Yuanjing Huang, Zirui Yin, Liru Qin
{"title":"Optimal Collaborative Scheduling of Multi-Aircraft Types for Forest Fires General Aviation Rescue","authors":"Weijun Pan, Yuanjing Huang, Zirui Yin, Liru Qin","doi":"10.3390/aerospace10090741","DOIUrl":null,"url":null,"abstract":"The scheduling of rescue aircraft needs to be studied in depth because of its criticality for the general aviation rescue of forest fires. This paper constructs a collaborative schedule optimization model for general aviation rescue under the condition of multiple aircraft, from multiple rally points to multiple fire points, targeting the shortest rescue time and the lowest rescue cost in the context of forest fires based on the simulation verification of a forest fire that broke out simultaneously in multiple locations in Liangshan Prefecture, Sichuan Province, China. The Non-dominated Sorting Genetic Algorithm II (NSGA-II) algorithm was used to find the optimal set of solutions satisfying the objective function: four feasible solutions. Then, the optimal solution was solved based on the weighted TOPSIS method, which was the optimal solution for this rescue task. The simulation results show that unnecessary flight times can be reduced by optimizing the schedule plan. Under the premise of ensuring rescue timeliness, the utilization rate of rescue aircraft was improved, and rescue costs were further reduced. The presented work provides a theoretical reference for the efficient development of general aviation rescue.","PeriodicalId":50845,"journal":{"name":"Aerospace America","volume":"3 1","pages":""},"PeriodicalIF":0.1000,"publicationDate":"2023-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Aerospace America","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.3390/aerospace10090741","RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"ENGINEERING, AEROSPACE","Score":null,"Total":0}
引用次数: 0

Abstract

The scheduling of rescue aircraft needs to be studied in depth because of its criticality for the general aviation rescue of forest fires. This paper constructs a collaborative schedule optimization model for general aviation rescue under the condition of multiple aircraft, from multiple rally points to multiple fire points, targeting the shortest rescue time and the lowest rescue cost in the context of forest fires based on the simulation verification of a forest fire that broke out simultaneously in multiple locations in Liangshan Prefecture, Sichuan Province, China. The Non-dominated Sorting Genetic Algorithm II (NSGA-II) algorithm was used to find the optimal set of solutions satisfying the objective function: four feasible solutions. Then, the optimal solution was solved based on the weighted TOPSIS method, which was the optimal solution for this rescue task. The simulation results show that unnecessary flight times can be reduced by optimizing the schedule plan. Under the premise of ensuring rescue timeliness, the utilization rate of rescue aircraft was improved, and rescue costs were further reduced. The presented work provides a theoretical reference for the efficient development of general aviation rescue.
森林火灾通用航空救援多机型协同调度优化
由于救援飞机调度对森林火灾通用航空救援至关重要,因此需要深入研究。以四川凉山地区多地点同时发生的森林火灾为例,以救援时间最短、救援成本最低为目标,构建了多架飞机、从多个集结点到多个火点的通用航空救援协同调度优化模型。采用非支配排序遗传算法II (non - dominant Sorting Genetic Algorithm II, NSGA-II)寻找满足目标函数的最优解集:4个可行解。然后,基于加权TOPSIS法求解最优解,得到该救援任务的最优解。仿真结果表明,通过优化调度计划可以减少不必要的飞行时间。在保证救援及时性的前提下,提高了救援飞机的利用率,进一步降低了救援成本。为通用航空救援的高效开展提供了理论参考。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Aerospace America
Aerospace America 工程技术-工程:宇航
自引率
0.00%
发文量
9
审稿时长
4-8 weeks
×
引用
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学术官方微信