Optimization of weapon-target assignment problem by intuitionistic fuzzy genetic algorithm
Aiming at the shortcoming of precocity and slow convergence in the application of traditional algorithms to solve the Weapon-Target Assignment (WTA) problem, this paper proposed an intuitionistic fuzzy genetic algorithm that combined with simulated annealing Meta-Lamarckian learning strategy and ada...
Main Authors: | , , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
EDP Sciences
2017-01-01
|
Series: | MATEC Web of Conferences |
Online Access: | https://doi.org/10.1051/matecconf/201712802004 |
id |
doaj-68410e62057643cbb34b3b9c57fbddb5 |
---|---|
record_format |
Article |
spelling |
doaj-68410e62057643cbb34b3b9c57fbddb52021-02-02T02:12:43ZengEDP SciencesMATEC Web of Conferences2261-236X2017-01-011280200410.1051/matecconf/201712802004matecconf_eitce2017_02004Optimization of weapon-target assignment problem by intuitionistic fuzzy genetic algorithmJinshuai YangJin LiYi WangTong WenZhanqiang LiuAiming at the shortcoming of precocity and slow convergence in the application of traditional algorithms to solve the Weapon-Target Assignment (WTA) problem, this paper proposed an intuitionistic fuzzy genetic algorithm that combined with simulated annealing Meta-Lamarckian learning strategy and adaptive mutation to improve the efficiency and speed of solving WTA problem. Firstly, it considered the various constraint functions of WTA problem, in which make the threat of remaining targets minimum and the damage from attacks maximum, established the mathematical model. Next, it defined the membership and non-membership functions of object and constraint function, and built the intuitionistic fuzzy WTA model on the basis of the “min-max” operator. Then, this paper designed a strategy of Meta-Lamarckian learning for simulated annealing and adaptive mutation to enhance the capability of local search and the speed of upper convergence for the algorithm. Finally, this method is effective via the simulation and the analysis of comparison with GA, PSO.https://doi.org/10.1051/matecconf/201712802004 |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Jinshuai Yang Jin Li Yi Wang Tong Wen Zhanqiang Liu |
spellingShingle |
Jinshuai Yang Jin Li Yi Wang Tong Wen Zhanqiang Liu Optimization of weapon-target assignment problem by intuitionistic fuzzy genetic algorithm MATEC Web of Conferences |
author_facet |
Jinshuai Yang Jin Li Yi Wang Tong Wen Zhanqiang Liu |
author_sort |
Jinshuai Yang |
title |
Optimization of weapon-target assignment problem by intuitionistic fuzzy genetic algorithm |
title_short |
Optimization of weapon-target assignment problem by intuitionistic fuzzy genetic algorithm |
title_full |
Optimization of weapon-target assignment problem by intuitionistic fuzzy genetic algorithm |
title_fullStr |
Optimization of weapon-target assignment problem by intuitionistic fuzzy genetic algorithm |
title_full_unstemmed |
Optimization of weapon-target assignment problem by intuitionistic fuzzy genetic algorithm |
title_sort |
optimization of weapon-target assignment problem by intuitionistic fuzzy genetic algorithm |
publisher |
EDP Sciences |
series |
MATEC Web of Conferences |
issn |
2261-236X |
publishDate |
2017-01-01 |
description |
Aiming at the shortcoming of precocity and slow convergence in the application of traditional algorithms to solve the Weapon-Target Assignment (WTA) problem, this paper proposed an intuitionistic fuzzy genetic algorithm that combined with simulated annealing Meta-Lamarckian learning strategy and adaptive mutation to improve the efficiency and speed of solving WTA problem. Firstly, it considered the various constraint functions of WTA problem, in which make the threat of remaining targets minimum and the damage from attacks maximum, established the mathematical model. Next, it defined the membership and non-membership functions of object and constraint function, and built the intuitionistic fuzzy WTA model on the basis of the “min-max” operator. Then, this paper designed a strategy of Meta-Lamarckian learning for simulated annealing and adaptive mutation to enhance the capability of local search and the speed of upper convergence for the algorithm. Finally, this method is effective via the simulation and the analysis of comparison with GA, PSO. |
url |
https://doi.org/10.1051/matecconf/201712802004 |
work_keys_str_mv |
AT jinshuaiyang optimizationofweapontargetassignmentproblembyintuitionisticfuzzygeneticalgorithm AT jinli optimizationofweapontargetassignmentproblembyintuitionisticfuzzygeneticalgorithm AT yiwang optimizationofweapontargetassignmentproblembyintuitionisticfuzzygeneticalgorithm AT tongwen optimizationofweapontargetassignmentproblembyintuitionisticfuzzygeneticalgorithm AT zhanqiangliu optimizationofweapontargetassignmentproblembyintuitionisticfuzzygeneticalgorithm |
_version_ |
1724310288373645312 |