Weapon target assignment problem: multi-objective formulation, optimisation using MOPSO and TOPSIS

B. P. Mishra, Eui-Whan Kim, Guck-Cheol Bang, Satchidananda Dehuri, Sung-Bae Cho
{"title":"Weapon target assignment problem: multi-objective formulation, optimisation using MOPSO and TOPSIS","authors":"B. P. Mishra, Eui-Whan Kim, Guck-Cheol Bang, Satchidananda Dehuri, Sung-Bae Cho","doi":"10.1504/IJIDSS.2015.075483","DOIUrl":null,"url":null,"abstract":"In this paper, a static weapon target assignment problem is studied by optimising the conflicting criteria like shooting failure and number of weapons used to destroy the targets. The inherent intractability and conflicting objectives of this problem motivated us to use multi-objective particle swarm optimisation (MOPSO) to uncover the true Pareto front. We first employ the MOPSO to uncover the Pareto front. Secondly, a ranking method called techniques for order preference by similarity to ideal solution (TOPSIS) is used to sort the non-dominated solutions by the preference of decision maker (DM). A numerical experiment on two test cases has been conducted to realise the efficacy of the method. The experimental work is offering large number of solutions in the Pareto front, which may create problem to DM for effective decision. Therefore, by TOPSIS a prioritised set of non-dominated solutions is provided to DM, which fits the preference under different situations.","PeriodicalId":311979,"journal":{"name":"Int. J. Intell. Def. Support Syst.","volume":"64 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Intell. Def. Support Syst.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/IJIDSS.2015.075483","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

In this paper, a static weapon target assignment problem is studied by optimising the conflicting criteria like shooting failure and number of weapons used to destroy the targets. The inherent intractability and conflicting objectives of this problem motivated us to use multi-objective particle swarm optimisation (MOPSO) to uncover the true Pareto front. We first employ the MOPSO to uncover the Pareto front. Secondly, a ranking method called techniques for order preference by similarity to ideal solution (TOPSIS) is used to sort the non-dominated solutions by the preference of decision maker (DM). A numerical experiment on two test cases has been conducted to realise the efficacy of the method. The experimental work is offering large number of solutions in the Pareto front, which may create problem to DM for effective decision. Therefore, by TOPSIS a prioritised set of non-dominated solutions is provided to DM, which fits the preference under different situations.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
武器目标分配问题:多目标公式,使用MOPSO和TOPSIS进行优化
本文通过优化射击失败和摧毁目标的武器数量等冲突准则,研究了静态武器目标分配问题。这个问题固有的难解性和相互冲突的目标促使我们使用多目标粒子群优化(MOPSO)来揭示真正的帕累托前沿。我们首先使用MOPSO来揭开帕累托前线。其次,利用与理想解相似度排序技术(TOPSIS)对非支配解进行排序。在两个测试用例上进行了数值实验,验证了该方法的有效性。实验工作是在Pareto前沿提供大量的解决方案,这可能会给DM带来问题,从而进行有效的决策。因此,通过TOPSIS,为DM提供了一组符合不同情况下偏好的非支配解的优先集。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Deep learning-based approach for malware classification A novel approach to design a digital clock triggered modified pulse latch for 16-bit shift register Program viewer - a defence portfolio capability management system Archival solution API to upload bulk file and managing the data in cloud storage Face recognition under occlusion for user authentication and invigilation in remotely distributed online assessments
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1