Application of Improved Genetic Algorithm in Cruise Missile Route Planning

Ju Zhang, Yi-an Liu, Hailing Song
{"title":"Application of Improved Genetic Algorithm in Cruise Missile Route Planning","authors":"Ju Zhang, Yi-an Liu, Hailing Song","doi":"10.1109/DCABES57229.2022.00020","DOIUrl":null,"url":null,"abstract":"To address the shortcomings of the traditional genetic algorithm in cruise missile route planning, which is prone to “premature maturation” and premature convergence to a local optimal solution, an improved genetic algorithm is proposed that introduces an adaptive operator and a variation ratio strategy. The algorithm processes the individual fitness values in the population by ranking ratio technique, and then adopts a selection strategy combining elite selection and roulette algorithm to add the feasible routes with the best fitness values directly to the children at each evolution, and then roulette selects the remaining feasible routes, which improves the global optimal search performance of the algorithm in the trajectory planning. Meanwhile, an adaptive crossover operator is used to dynamically select the crossover probability based on the individual fitness values of the parents. Finally, the two algorithms are applied to the established map model for route planning separately, and the simulation results show that the path solved by the improved genetic algorithm reduces three planning waypoints and 10.74 % of the range compared with the traditional genetic algorithm, and the global search performance of the route planning process applying the improved genetic algorithm is significantly better than that of the traditional genetic algorithm.","PeriodicalId":344365,"journal":{"name":"2022 21st International Symposium on Distributed Computing and Applications for Business Engineering and Science (DCABES)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 21st International Symposium on Distributed Computing and Applications for Business Engineering and Science (DCABES)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DCABES57229.2022.00020","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

To address the shortcomings of the traditional genetic algorithm in cruise missile route planning, which is prone to “premature maturation” and premature convergence to a local optimal solution, an improved genetic algorithm is proposed that introduces an adaptive operator and a variation ratio strategy. The algorithm processes the individual fitness values in the population by ranking ratio technique, and then adopts a selection strategy combining elite selection and roulette algorithm to add the feasible routes with the best fitness values directly to the children at each evolution, and then roulette selects the remaining feasible routes, which improves the global optimal search performance of the algorithm in the trajectory planning. Meanwhile, an adaptive crossover operator is used to dynamically select the crossover probability based on the individual fitness values of the parents. Finally, the two algorithms are applied to the established map model for route planning separately, and the simulation results show that the path solved by the improved genetic algorithm reduces three planning waypoints and 10.74 % of the range compared with the traditional genetic algorithm, and the global search performance of the route planning process applying the improved genetic algorithm is significantly better than that of the traditional genetic algorithm.
改进遗传算法在巡航导弹航路规划中的应用
针对传统遗传算法在巡航导弹航路规划中容易出现“早熟”和过早收敛到局部最优解的缺点,提出了一种引入自适应算子和变化率策略的改进遗传算法。该算法通过排序比技术对种群中的个体适应度值进行处理,然后采用精英选择和轮盘赌算法相结合的选择策略,在每次进化时将适应度值最佳的可行路径直接添加到子代中,然后轮盘赌选择剩余的可行路径,提高了算法在轨迹规划中的全局最优搜索性能。同时,采用自适应交叉算子根据亲本个体适应度值动态选择交叉概率。最后,将两种算法分别应用于所建立的地图模型进行路线规划,仿真结果表明,与传统遗传算法相比,改进遗传算法求解的路径减少了3个规划路点,航程减少了10.74%,应用改进遗传算法进行路线规划过程的全局搜索性能明显优于传统遗传算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信