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.