{"title":"An Air Defense Weapon Target Assignment Method Based on Multi-Objective Artificial Bee Colony Algorithm","authors":"Huaixi Xing, Qinghua Xing","doi":"10.32604/cmc.2023.036223","DOIUrl":null,"url":null,"abstract":"With the advancement of combat equipment technology and combat concepts, new requirements have been put forward for air defense operations during a group target attack. To achieve high-efficiency and low-loss defensive operations, a reasonable air defense weapon assignment strategy is a key step. In this paper, a multi-objective and multi-constraints weapon target assignment (WTA) model is established that aims to minimize the defensive resource loss, minimize total weapon consumption, and minimize the target residual effectiveness. An optimization framework of air defense weapon mission scheduling based on the multi-objective artificial bee colony (MOABC) algorithm is proposed. The solution for point-to-point saturated attack targets at different operational scales is achieved by encoding the nectar with real numbers. Simulations are performed for an imagined air defense scenario, where air defense weapons are saturated. The non-dominated solution sets are obtained by the MOABC algorithm to meet the operational demand. In the case where there are more weapons than targets, more diverse assignment schemes can be selected. According to the inverse generation distance (IGD) index, the convergence and diversity for the solutions ofthe non-dominated sorting genetic algorithm III (NSGA-III) algorithm and the MOABC algorithm are compared and analyzed. The results prove that the MOABC algorithm has better convergence and the solutions are more evenly distributed among the solution space.","PeriodicalId":93535,"journal":{"name":"Computers, materials & continua","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers, materials & continua","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.32604/cmc.2023.036223","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
With the advancement of combat equipment technology and combat concepts, new requirements have been put forward for air defense operations during a group target attack. To achieve high-efficiency and low-loss defensive operations, a reasonable air defense weapon assignment strategy is a key step. In this paper, a multi-objective and multi-constraints weapon target assignment (WTA) model is established that aims to minimize the defensive resource loss, minimize total weapon consumption, and minimize the target residual effectiveness. An optimization framework of air defense weapon mission scheduling based on the multi-objective artificial bee colony (MOABC) algorithm is proposed. The solution for point-to-point saturated attack targets at different operational scales is achieved by encoding the nectar with real numbers. Simulations are performed for an imagined air defense scenario, where air defense weapons are saturated. The non-dominated solution sets are obtained by the MOABC algorithm to meet the operational demand. In the case where there are more weapons than targets, more diverse assignment schemes can be selected. According to the inverse generation distance (IGD) index, the convergence and diversity for the solutions ofthe non-dominated sorting genetic algorithm III (NSGA-III) algorithm and the MOABC algorithm are compared and analyzed. The results prove that the MOABC algorithm has better convergence and the solutions are more evenly distributed among the solution space.