Weapon-Target Assignment Problem by Multiobjective Evolutionary Algorithm Based on Decomposition

The weapon-target assignment (WTA) problem is a key issue in Command & Control (C2). Asset-based multiobjective static WTA (MOSWTA) problem is known as one of the notable issues of WTA. Since this is an NP-complete problem, multiobjective evolutionary algorithms (MOEAs) can be used to solve it e...

Full description

Saved in:
Bibliographic Details
Main Authors: Xiaoyang Li, Deyun Zhou, Qian Pan, Yongchuan Tang, Jichuan Huang
Format: Article
Language:English
Published: Wiley 2018-01-01
Series:Complexity
Online Access:http://dx.doi.org/10.1155/2018/8623051
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1832553399398170624
author Xiaoyang Li
Deyun Zhou
Qian Pan
Yongchuan Tang
Jichuan Huang
author_facet Xiaoyang Li
Deyun Zhou
Qian Pan
Yongchuan Tang
Jichuan Huang
author_sort Xiaoyang Li
collection DOAJ
description The weapon-target assignment (WTA) problem is a key issue in Command & Control (C2). Asset-based multiobjective static WTA (MOSWTA) problem is known as one of the notable issues of WTA. Since this is an NP-complete problem, multiobjective evolutionary algorithms (MOEAs) can be used to solve it effectively. The multiobjective evolutionary algorithm based on decomposition (MOEA/D) is a practical and promising multiobjective optimization technique. However, MOEA/D is originally designed for continuous multiobjective optimization which loses its efficiency to discrete contexts. In this study, an improved MOEA/D is proposed to solve the asset-based MOSWTA problem. The defining characteristics of this problem are summarized and analyzed. According to these characteristics, an improved MOEA/D framework is introduced. A novel decomposition mechanism is designed. The mating restriction and selection operation are reformulated. Furthermore, a problem-specific population initialization method is presented to improve the efficiency of the proposed algorithm, and a novel nondominated solution-selection method is put forward to handle the constraints of Pareto front. Appropriate extensions of four MOEA variants are developed in comparison with the proposed algorithm on some generated scenarios. Extensive experiments demonstrate that the proposed method is effective and promising.
format Article
id doaj-art-63dd4ff5926541f6b2ac8796171d3a75
institution Kabale University
issn 1076-2787
1099-0526
language English
publishDate 2018-01-01
publisher Wiley
record_format Article
series Complexity
spelling doaj-art-63dd4ff5926541f6b2ac8796171d3a752025-02-03T05:54:04ZengWileyComplexity1076-27871099-05262018-01-01201810.1155/2018/86230518623051Weapon-Target Assignment Problem by Multiobjective Evolutionary Algorithm Based on DecompositionXiaoyang Li0Deyun Zhou1Qian Pan2Yongchuan Tang3Jichuan Huang4School of Electronics and Information, Northwestern Polytechnical University, Xi’an, Shaanxi 710072, ChinaSchool of Electronics and Information, Northwestern Polytechnical University, Xi’an, Shaanxi 710072, ChinaSchool of Electronics and Information, Northwestern Polytechnical University, Xi’an, Shaanxi 710072, ChinaSchool of Electronics and Information, Northwestern Polytechnical University, Xi’an, Shaanxi 710072, ChinaSchool of Electronics and Information, Northwestern Polytechnical University, Xi’an, Shaanxi 710072, ChinaThe weapon-target assignment (WTA) problem is a key issue in Command & Control (C2). Asset-based multiobjective static WTA (MOSWTA) problem is known as one of the notable issues of WTA. Since this is an NP-complete problem, multiobjective evolutionary algorithms (MOEAs) can be used to solve it effectively. The multiobjective evolutionary algorithm based on decomposition (MOEA/D) is a practical and promising multiobjective optimization technique. However, MOEA/D is originally designed for continuous multiobjective optimization which loses its efficiency to discrete contexts. In this study, an improved MOEA/D is proposed to solve the asset-based MOSWTA problem. The defining characteristics of this problem are summarized and analyzed. According to these characteristics, an improved MOEA/D framework is introduced. A novel decomposition mechanism is designed. The mating restriction and selection operation are reformulated. Furthermore, a problem-specific population initialization method is presented to improve the efficiency of the proposed algorithm, and a novel nondominated solution-selection method is put forward to handle the constraints of Pareto front. Appropriate extensions of four MOEA variants are developed in comparison with the proposed algorithm on some generated scenarios. Extensive experiments demonstrate that the proposed method is effective and promising.http://dx.doi.org/10.1155/2018/8623051
spellingShingle Xiaoyang Li
Deyun Zhou
Qian Pan
Yongchuan Tang
Jichuan Huang
Weapon-Target Assignment Problem by Multiobjective Evolutionary Algorithm Based on Decomposition
Complexity
title Weapon-Target Assignment Problem by Multiobjective Evolutionary Algorithm Based on Decomposition
title_full Weapon-Target Assignment Problem by Multiobjective Evolutionary Algorithm Based on Decomposition
title_fullStr Weapon-Target Assignment Problem by Multiobjective Evolutionary Algorithm Based on Decomposition
title_full_unstemmed Weapon-Target Assignment Problem by Multiobjective Evolutionary Algorithm Based on Decomposition
title_short Weapon-Target Assignment Problem by Multiobjective Evolutionary Algorithm Based on Decomposition
title_sort weapon target assignment problem by multiobjective evolutionary algorithm based on decomposition
url http://dx.doi.org/10.1155/2018/8623051
work_keys_str_mv AT xiaoyangli weapontargetassignmentproblembymultiobjectiveevolutionaryalgorithmbasedondecomposition
AT deyunzhou weapontargetassignmentproblembymultiobjectiveevolutionaryalgorithmbasedondecomposition
AT qianpan weapontargetassignmentproblembymultiobjectiveevolutionaryalgorithmbasedondecomposition
AT yongchuantang weapontargetassignmentproblembymultiobjectiveevolutionaryalgorithmbasedondecomposition
AT jichuanhuang weapontargetassignmentproblembymultiobjectiveevolutionaryalgorithmbasedondecomposition