Mathematical Problems in Engineering
Volume 2017 (2017), Article ID 2936279, 17 pages
https://doi.org/10.1155/2017/2936279

Research Article

A New Approach to Weapon-Target Assignment in Cooperative Air Combat

Yi-zhe Chang,¹ Zhan-wu Li,¹ Ying-xin Kou,¹ Qing-peng Sun,¹ Hai-yan Yang,¹ and Zheng-yan Zhao²

¹Air Force Engineering University, Xi’an 710038, China
²93088 Unit of PLA, Chifeng 024400, China

Correspondence should be addressed to Yi-zhe Chang; 272884459@qq.com

Received 9 May 2017; Accepted 8 August 2017; Published 2 October 2017

Academic Editor: Jean Jacques Loiseau

Copyright © 2017 Yi-zhe Chang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract.

A new approach to solving weapon-target assignment (WTA) problem is proposed in this paper. Firstly, relative superiority that lays the foundation for assignment is calculated based on the combat power energy of the fighters. Based on the relative superiority, WTA problem is formulated. Afterwards, a hybrid algorithm consisting of improved artificial fish swarm algorithm (AFSA) and improved harmony search (HS) is introduced and furthermore applied to solve the assignment formulation. Finally, the proposed approach is validated by eight representative benchmark functions and two concrete cooperative air combat examples. The results show that the approach proposed in this paper achieves good performances in solving WTA problem in cooperative air combat.

1. Introduction

Weapon-target assignment (WTA) refers to an assignment of defensive weapons to engage or counter identified threats. The primary concern is minimizing the total expected survivability of the targets [1, 2].

Weapons are assigned to threats based on the detection outcomes within previous stages. Considering the short time of air combat, the problem must be solved as close to real time as possible. Another characteristic is quality of the derived solution, which causes critical effects on the following combat deployment ‎[3].

WTA is regarded as a crucial part in operation; therefore the achievements on that are rich. In the matter of problem formulation, multiple factors such as relative distance, relative angle, and relative velocity are taken into consideration. In domain of algorithms, several sophisticated search and heuristic algorithms have been proposed, such as genetic algorithms [4–7], simulated annealing ‎[8], discrete particle swarm optimizations [9–12], permutation and tabu search heuristics‎ [13], and other algorithms [14–16].

Concerned with the characteristics and developing tendency about air combat, an approach to WTA in cooperative air combat is proposed in this paper. Within the approach, relative superiority between fighters and targets, acting as the foundation of the formulation, is calculated in terms of combat power potential, and a hybrid algorithm combined with improved artificial fish swarm algorithm with improved harmony search for solving the formulation is introduced.

The concept of combat power potential is firstly introduced by Zhou et al. ‎[17]. As described in ‎[17], air combat space can be seen as a potential consisting of infinite points and each point is under effect by fighters. The effect, generated by fighters and equipment carried by them, is quantitatively defined as potential energy called combat power potential energy. Combat power potential energy reflects the impact on each point inside the air combat space by fighters.

The artificial fish swarm algorithm (AFSA) simulating the behavior of a fish inside water was proposed by Li‎ et al. [18] and has already been applied in engineering contexts [19–24]. The main artificial fish behaviors are random, chasing, swarming, and searching, which allows the algorithm to act better in global searching but poor in local searching.

Harmony search, mimicking the improvisation process of music players, is originated by Geem‎ et al. [25]. The HS performs excellently in quality of the solutions but with low search speed and is strongly dependent on initial solution.

This paper is organized as follows: In Section 2, the formulation of WTA is introduced. The design of hybrid algorithm is studied in Section 3. Section 4 presents the results of simulation. Section 5 concludes the paper.

2. WTA Problem Formulation

2.1. Analysis on Relative Superiority

Superiority relation acts as the critical ingredient in WTA formulation. In this paper, superiority relation is formulated in accordance with the descending velocity of combat power potential energy possessed by one side towards the other side.

2.1.1. Combat Power Potential Energy Model of Fighter

Due to the limitation on pages, combat power potential energy of fighter can be calculated by model of which in ‎[26].

2.1.2. Calculation on Descending Velocity

We get to know from the potential theory that potential energy will be descending while distance is getting larger. As a kind of potential, combat power potential has the same characteristics, which means combat power potential energy generated by fighters descends with more restriction, such as distance limits and angle limits. For calculating descending velocity, gradient is introduced in the paper. Assuming a function described as , , then gradient of function in point can be defined as

It is known from‎ [26] that combat power potential energy of fighter is a function with regard to coordinates of fighters and targets . Calculate the gradient of depicted in ‎[26] on , , and then we can get

Take , for instance; through further derivation, we will obtain

For losing the burden of calculation, , , , are simplified as , , , , where . Substitute simplified , , , into (3); we will derive

and are yielded in the same way as follows:

Descending velocity of fighter in direction of target is got in the light of definition of gradient:

Similarly, descending velocity of target in direction of fighter is given as

2.1.3. Calculation on Relative Superiority

Calculation on relative superiority of fighter with respect to target is expressed as

where is the descending velocity of fighter in direction to location of target and is the descending velocity of target in direction to location of fighter .

2.2. WTA Formulation

In the paper, the problem is formulated as a combinatorial optimization problem, with the objective of minimizing the total lethality of the targets. The fundamental problem variable is relative superiority .

Consider the assignment problem of fighters to targets: let be the relative superiority, where and . The WTA is formulated as follows:

where is the decision value indicating if fighter is assigned to target ; if fighter is assigned to target and if fighter is not assigned to target .

In the above formulation, we minimize the sum of the weighted cumulative probabilities of threat lethality while ensuring that all constraints are satisfied. Two constraints, respectively, denote that each target must be assigned by one fighter and each fighter can be assigned to one target at most.

3. A Hybrid Algorithm for the Problem

3.1. Improvements on AFSA

To improve the performance of the algorithm, several modifications were introduced into the AFSA, including initialization, visual and movement strategy, and leap behavior. Concrete implementations are presented below.

3.1.1. Initialization

Initial solution causes crucial influences on convergence performance of the algorithm. The initial solution is randomly generated in the most existed study, by which it is difficult to get solution of high quality. Therefore a hybrid initialization method involving chaos, information entropy, and opposition-based learning methods is proposed and described in Figure 1.

Figure 1: Flow of initialization.

Assume that there are artificial fish in the swarm, each of which has variables. denotes the variable within fish , , . The pseudocode for two algorithms in Figure 1 is described in Algorithms 1 and 2.

() Initialize parameter: Set the maximum chaotic iteration

     number

() for do

() for do

() for do

()     % Update the chaotic factor

() end for

()     % Generate initial

     chaotic solution

()     % Generate initial

     opposition-based learning solution

() end for

() end for

Algorithm 1: Initialization based on logistic chaos and opposition-based learning [27, 28].

() Set the critical entropy

()

() while

()      for

()          for

()              for

()

()     % Difference ratio

     Between and , and are the maximum

     and minimum value of the variable respectively

()     % Entropy of variable in

     artificial fish swarm

()     % Entropy of the whole swarm

()             end for

()         end for

()     end for

() end while

Algorithm 2: Initialization based on information entropy ‎[29].

3.1.2. Pseudo-Parallel Evolution

In the late period of search, artificial fish will move more slowly and be misled to local optimums. A pseudo-parallel evolution strategy dividing the artificial fish swarm into multiple subswarms is introduced for solving the problem. Each subswarm executes search for optimum independently and exchanges the optimal solution with others at every iteration to maintain the search space and prevent prematurity.

3.1.3. Artificial Fish Moving Strategy

To improve the search ability of the artificial fish, a moving strategy combining maintaining the self-advantage with absorbing the advantage from others is proposed below:

where is the current iteration, is the maximum iteration, , are the position of artificial fish at iteration and , respectively, and is the position of artificial fish at iteration. The first part, , describes artificial fish keeping the self-superiority; the second part inspired by neighborhood search strategy, , indicates the absorbance of advantage from another artificial fish within visual range.

3.1.4. Self-Adaptive Visual Procedure

Visual, which has been deeply studied, determines the convergence speed and accuracy of AFSA. The modifications on visual have been proposed by many researches, as given in (11)~(13).‎ Reference [19] proposed an improved visual formulation:

where and stand for the visual at current iteration and previous iteration . and represent the upper and lower bounds of the visual, respectively.

The model utilizes a random number to control the visual change and to ensure the overall trend getting lower, whereas, due to stochastic factors existing during the evolution, it is incapable of precise adjustment to the visual.

Another modification on visual is presented in the following equation ‎[20]:

where is the global best solution by estimation and is the mean solution.

In accordance with (12), the mean solution is getting closer to the global best solution by estimation. During the approach to the optimal solution, difference between the current mean solution and the optimal one decreases, as well as the visual scope. However, is hard to estimate, which easily causes the algorithm to fall into local optimal or poor performance in convergence.

‎Reference [21] proposed another kind of improvement on visual:

where is the maximum iteration, is the initial value, is the previously set value at the last iteration, is a fixed value, and is a constant number.

In initial iterations, the visual varies in accordance with the upper formulation for ensuring good performance in convergence speed and global searching, thereafter changing by means of the next one for better convergence accuracy. But there are two deficiencies that existed; the switch condition from the upper formulation to the one below is not quite clear and the visual at the last iteration is not easy to obtain.

The main purpose is to ensure the artificial fish searching with larger visual within initial iterations and with smaller visual afterwards, although the modified means are quite different such as (11) to (13). Whereas the above improvements on visual are insufficient for the research on the algorithm falling into the local optimum, therefore a modified visual model concerned with iteration and convergence speed is constructed as follows:

where measures the iterations at which the optimal solution stays unchanged, is the initial visual, is the solution at the last iteration before , is the solution at the previous iteration before , and is a constant number that could be 1, 3, 5, 10.

From (14) we can see that adjustment in visual changes one dimension at least and gets smaller as decreases, which helps improve the accuracy of the solutions. When , the visual obtained by (14) will get larger, by which artificial fish are capable of escaping from local optimal regions.

3.1.5. Improvements on Leap Behavior

For preventing the artificial fish from converging to local optimal solutions, leap behavior forcing the artificial fish to change its location is adopted in certain references [22, 23]. In this paper, artificial fish executes leap behavior when the optimal solution stands still after one iteration. Meanwhile, it is thought that the higher the number of iterations at which optimal solution stagnates is, the higher the extent the optimal solution varies and the higher the probability of leap behavior execution is. Accordingly, improvements on leap behavior probability and leap behavior strategy are designed as follows.

The leap behavior is modified as outlined in (15):

where is a bool vector; the quantity of 1 in vector is obtained from

Equation (16) makes it certain that one dimension at least, dimension at most in location of artificial fish , changes by leap behavior at each iteration. The bigger and are, the more dimension changes. By this way, leap behavior is able to adjust the location of artificial fish dynamically and to achieve the goal of avoiding premature convergence.

3.2. Improvement on HS

In this article, improvements on HS contains two domains: harmony memory consideration rate and new harmony generating strategy.

3.2.1. Improvements on Harmony Memory Consideration Rate

Modifications on harmony memory consideration rate have been studied in many researches [30, 31]. Through the reference, it can be concluded that harmony memory consideration rate should be given a small value to increase the diversity of the harmony memory and global search when solutions differ greatly. On the other hand, when the solutions are relatively resembled, harmony memory consideration rate should be raised for performing search more accurately and reducing the time for searching. In this paper, it is considered that iteration has effect on harmony memory consideration rate as solution does; particularly harmony memory consideration rate is supposed to increase gradually at final iterations for acting better in global search. The harmony memory consideration rate is formulated from the perspectives of current iteration and deviations between harmony vectors as follows:

where , , respectively, represent the best and worst solution in harmony memory at iteration . The harmony memory consideration rate in (17) utilizes dynamic mechanism to select the harmony vector under various circumstances. The larger is, the smaller the difference among the harmony vectors in harmony memory is, which indicates that becomes larger to converge to the optimum fastly. Likewise, the larger is, the larger is, and the algorithm is able to have a faster convergence to the optimum.

3.2.2. New Harmony Improvisation

New harmony improvisation deciding general performance in optimization is also seen as the key point in modifications on HS. A new method for harmony improvisation in terms of learning strategy is defined in this paper, which is described as follows:

where is the decision variable in harmony vector generated at iteration , , , are the decision variables in harmony vectors , and the optimal harmony vector in harmony memory generated at iteration , and , are learning coefficients, , .

The bigger one between and is selected to make sure that the harmony is affected by the neighborhood solution inside the harmony memory and avoid prematurity when . Otherwise, the harmony improvisation is more influenced by the optimal solution, which helps in converging to optimum more quickly.

3.3. Switch Condition

3.3.1. Switch Condition Analysis

Switch condition acting as a key part of the hybrid algorithm causes a great influence on speed and accuracy of convergence. Switch condition is discussed by two aspects as switching iteration and individual standard error of artificial fish.

(1) Switching Iteration. Switching iteration is to make the hybrid algorithm switch from improved AFSA to improved HS at a certain iteration, which is obtained by multiple concrete experiments.

(2) Individual Standard Error of Artificial Fish. This factor reflects the deviation among artificial fish in the swarm. It should be switched to the HS for the following search while the individual standard error of artificial fish gets smaller, which means the search space gets smaller. The model of individual standard error of artificial fish, with regard to location and fitness value, is proposed as follows.

The standard error of location on artificial fish is calculated by

where is the average location of all artificial fish in dimension . The artificial fish are of high probability to gather in local optimal region while each fish gets closer, as well as being smaller.

The standard error of fitness value on artificial fish is calculated by

where is the average fitness value. Likewise, the artificial fish seems to get trapped in the local optimum area while fitness value of each fish is resembled, as well as being smaller.

From the information mentioned above, the individual standard error of artificial fish is derived by

where , , respectively, represent the coefficients about and . The switch to improved HS should be executed for global optimum if is smaller than the presented value , which means the stand error of fitness value and location fluctuate to a smaller extent; therefore the solution is weak.

3.3.2. Design for Switch Step

For the sake of fast convergence and quality of solutions, it is ruled in this paper that the switch is executed only if any condition is satisfied. Due to the different performances of the algorithms when facing various problems or benchmark functions, it is also regulated that the individual standard error of artificial fish is seen as the prior factor, and the switch flow is given in Figure 2.

Figure 2: Switch flow for algorithm.

It can be seen from Figure 2 that individual standard error of artificial fish is investigated at first; switch is executed if satisfied; otherwise checking whether the algorithm is qualified to switch from the perspective of switching iteration, the switch is carried on if satisfied, or else the algorithm runs back to the improved artificial fish swarm algorithm.

3.4. Flow for Hybrid Algorithm

The concrete flow for the proposed hybrid algorithm is depicted in Figure 3.

Figure 3: Flow for the proposed hybrid algorithm.

4. Simulation Results

4.1. Verification Tests by Benchmark Functions

The algorithms are always tested by benchmark functions. For thoroughly validating the performances of the proposed IAFSA-HIS, other three algorithms including IABHS, IBAFSA, and GDHS are introduced for comparison. Main properties of the selected benchmark functions used in the experiments are shown in Table 1.

Table 1: Benchmark functions.

Function
Equation
Range
Optimum
Property

Sphere

0
Unimodal

Quartic

0
Unimodal

Duadric

0
Unimodal

Rosenbrock

0
Unimodal

Schwefel

Multimodal

Rastrigin

0
Multimodal

Griewank

0
Multimodal

Ackley

0
Multimodal

Parameters are set as follows: , , , , , , , , , , , and ; for other parameters, refer to [24, 30, 32].

The algorithms were run 100 times independently to catch their stochastic properties and the results are depicted in Table 2 and Figures 4–11.

Table 2: Comparison of results with other algorithms.

IAFSA-IHS
IBAFSA
IABHS
GDHS

    Best

0

    Mean

0

    Worst

0

    Std.dev

0

    Best

    Mean

    Worst

    Std.dev

    Best

    Mean

    Worst

    Std.dev

    Best

    Mean

    Worst

    Std.dev

    Best

    Mean

    Worst

    Std.dev

    Best
0

    Mean
0

    Worst
0

    Std.dev
0

    Best
0

    Mean
0

    Worst
0

    Std.dev
0

    Best

    Mean

    Worst

    Std.dev

Figure 4: Sphere.

Figure 5: Quartic.

Figure 6: Duadric.

Figure 7: Rosenbrock.

Figure 8: Schwefel.

Figure 9: Rastrigin.

Figure 10: Griewank.

Figure 11: Ackley.

The parameters Best, Mean, Worst, and Std.dev are the best, mean, worst, and stand error of the optimum on average after 100 running times, where Mean reflects the precision of the results obtained by the algorithms within certain iterations and Std.dev reflects the robustness and stability of the algorithms.

As seen from Table 2 and Figures 4–11, the advantages in terms of best, median, worst, mean, and standard error of IAFSA-HIS are outstanding among the four algorithms in general. Particularly, IAFSA-IHS achieves the theoretical optimum while others fail still the termination in and . However, the proposed algorithm performs relatively poor with regard to , , , especially for . Compared with GDHS obtaining the theoretical optimum within fewer iterations in , IAFSA-IHS fails to get the satisfying solution, which seems to fall into the prematurity as IABHS and IBAFSA do.

It can be concluded that IAFSA-IHS exactly performs better on robustness, convergence speed, and precision with the improvements mentioned above synthetically. Taking , for instance, as a multimodal function, there exist a lot of local optima surrounding the global optimum which easily misguides the algorithm to stay in the local optimum. For solving the problem, GDHS sets HMCR, PAR, in dynamical mode, IBAFSA decodes the artificial fish into binary, sets the trial point, and reinitializes the artificial fish swarm regularly, and IABHS introduces the improvisation strategies with consideration of individual as well as dimension and self-adaptively adjusts HMCR, PAR, . All of those improvements are aimed at strengthening the convergence speed and accuracy, just as IAFSA-IHS does by means of the proposed modification in the paper. From the analysis of the result, these improvements indeed have effects as supposed.

4.2. Simulation of WTA Problems

4.2.1. Example 1

There is red formation consisting of eight fighters confronting blue formation including six targets. Through calculation by (1)~(8), situation information referring to [17, 33] on both sides is given in Table 3 and Figures 12–14.

Table 3: Situation information on both sides.

/km
/km
/km
/(km/h)
/(km/h)
/(km/h)

Information on red formation

1
40
79
5
662
662
0
361.65
43.59
1973.9
225.82

2
44
76
6
662
662
0

3
48
76
5
662
662
0

4
50
70
5
662
662
0

5
54
66
6
662
662
0

6
58
66
5
662
662
0

7
59
60
5
662
662
0

8
62
56
6
662
662
0

Information on blue formation

1
130
170
8

154.99
43.59
1789.7
451.64

2
140
160
7

3
145
155
8

4
150
146
8

5
160
140
7

6
165
130
8

Figure 12: Air combat situation.

Figure 13: Distribution of combat power energy possessed by both formations in vertical plane.

Figure 14: Distribution of combat power energy possessed by both formations in horizontal plane.

Descending velocity of each side with respect to the other side is obtained by (6) and (7) and shown in Tables 4 and 5.

Table 4: Descending velocity of red formation with regard to blue formation.

F1
F2
F3
F4
F5
F6
F7
F8

T1
0.0094
0.0094
0.0098
0.0094
0.0093
0.0095
0.0090
0.0088

T2
0.0093
0.0094
0.0098
0.0095
0.0094
0.0098
0.0093
0.0091

T3
0.0092
0.0093
0.0097
0.0094
0.0095
0.0098
0.0093
0.0092

T4
0.0093
0.0095
0.0099
0.0097
0.0098
0.0102
0.0097
0.0096

T5
0.0086
0.0088
0.0092
0.0091
0.0092
0.0096
0.0093
0.0092

T6
0.0085
0.0088
0.0093
0.0091
0.0093
0.0098
0.0095
0.0095

Table 5: Descending velocity of blue formation with regard to red formation.

F1
F2
F3
F4
F5
F6
F7
F8

T1
0.0078
0.0079
0.0082
0.0078
0.0077
0.0080
0.0075
0.0073

T2
0.0077
0.0078
0.0082
0.0079
0.0079
0.0082
0.0077
0.0076

T3
0.0076
0.0078
0.0081
0.0079
0.0079
0.0082
0.0078
0.0077

T4
0.0077
0.0079
0.0083
0.0081
0.0081
0.0085
0.0081
0.0080

T5
0.0071
0.0073
0.0077
0.0075
0.0077
0.0080
0.0077
0.0077

T6
0.0071
0.0073
0.0077
0.0076
0.0078
0.0082
0.0079
0.0079

Relative superiority of red formation with regard to the blue one, , , , is derived by (8) and is given in Table 6.

Table 6: Relative superiority of red formation with regard to the blue one.

F1
F2
F3
F4
F5
F6
F7
F8

T1
0.5455
0.5454
0.5449
0.5455
0.5457
0.5452
0.5461
0.5464

T2
0.5456
0.5454
0.5448
0.5454
0.5454
0.5449
0.5456
0.5459

T3
0.5458
0.5455
0.5449
0.5454
0.5454
0.5448
0.5455
0.5457

T4
0.5457
0.5453
0.5447
0.5450
0.5449
0.5443
0.5450
0.5451

T5
0.5468
0.5464
0.5457
0.5460
0.5457
0.5451
0.5457
0.5457

T6
0.5469
0.5464
0.5457
0.5458
0.5455
0.5449
0.5453
0.5453

, , denotes fighter . , , is target . , , , , , , , , , and ; other parameters are set similarly as in verification tests.

Compared with three algorithms mentioned in verification tests, the optimization process containing four algorithms and the final assignment solution is shown in Figure 15 and Table 7.

Table 7: Results of four algorithms.

F1
F2
F3
F4
F5
F6
F7
F8
Fitness value

GDHS
T6
T1
T3
T4
T5
T2
T4
T1
2.2308

IABHS
T1
T1
T6
T4
T5
T3
T4
T2
2.2315

IBAFSA
T6
T3
T5
T2
T1
T2
T1
T4
2.2299

IAFSA-IHS
T6
T2
T3
T5
T4
T3
T1
T4
2.2298

Figure 15: Optimization figure containing four algorithms.

It is obviously observed from Figure 15 and Table 7 that solution obtained by IAFSA-IHS gets the lowest fitness value but in slower convergence speed. By comparison, the results derived by GDHS, IBAFSA, and IABHS achieve higher fitness value. GDHS only acts better than IABHS, and the result got by IBAFSA is similar to the one got by IAFSA-IHS. It is concluded that the proposed IAFSA-IHS outperforms the others in solving the example.

4.2.2. Example 2

To test its performance widely, another situation is chosen in simulation; the situation information is shown in Table 8 and Figures 16–18.

Table 8: Situation information on both sides.

/km
/km
/km
/(km/h)
/(km/h)
/(km/h)

Information on red formation

1
50
80
5
828
552
138
361.65
43.59
1973.9

2
51
76
6
828
552
138

3
52
72
5
828
552
138

4
53
69
6
828
552
138

5
56
65
6
552
828
138

6
60
64
5
552
828
138

7
63
63
6
552
828
138

8
68
62
5
552
828
138

Information on blue formation

1
155
143
7

154.99
43.59
1789.7

2
150
144
7

3
140
146
8

4
135
150
7

5
132
160
8

6
130
170
8

Figure 16: Air combat situation.

Figure 17: Distribution of combat power energy possessed by both formations in vertical plane.

Figure 18: Distribution of combat power energy possessed by both formations in horizontal plane.

Descending velocity of each side with respect to the other side is gained by (6) and (7) and shown in Tables 9 and 10.

Table 9: Descending velocity of red formation with regard to blue formation.

F1
F2
F3
F4
F5
F6
F7
F8

T1
0.0104
0.0100
0.0097
0.0095
0.0093
0.0095
0.0096
0.0098

T2
0.0113
0.0110
0.0106
0.0104
0.0102
0.0104
0.0106
0.0109

T3
0.0121
0.0117
0.0114
0.0112
0.0111
0.0114
0.0116
0.0120

T4
0.0118
0.0115
0.0112
0.0110
0.0110
0.0113
0.0115
0.0120

T5
0.0106
0.0104
0.0102
0.0101
0.0100
0.0104
0.0106
0.0111

T6
0.0101
0.0099
0.0097
0.0096
0.0096
0.0099
0.0102
0.0106

Table 10: Descending velocity of blue formation with regard to red formation.

F1
F2
F3
F4
F5
F6
F7
F8

T1
0.0087
0.0084
0.0081
0.0079
0.0078
0.0079
0.0089
0.0082

T2
0.0095
0.0092
0.0089
0.0087
0.0085
0.0088
0.0089
0.0092

T3
0.0102
0.0099
0.0096
0.0094
0.0093
0.0096
0.0098
0.0101

T4
0.0100
0.0097
0.0095
0.0093
0.0092
0.0095
0.0097
0.0101

T5
0.0089
0.0087
0.0086
0.0084
0.0084
0.0087
0.0089
0.0093

T6
0.0084
0.0083
0.0081
0.0080
0.0080
0.0083
0.0085
0.0089

Relative superiority of red formation with regard to the blue one, , , , is derived by (8) and is given in Table 11.

Table 11: Relative superiority of red formation with regard to the blue one.

F1
F2
F3
F4
F5
F6
F7
F8

T1
0.5440
0.5445
0.5450
0.5453
0.5456
0.5453
0.5452
0.5448

T2
0.5428
0.5432
0.5437
0.5440
0.5442
0.5439
0.5437
0.5433

T3
0.5419
0.5423
0.5427
0.5429
0.5431
0.5427
0.5425
0.5420

T4
0.5422
0.5425
0.5429
0.5431
0.5432
0.5428
0.5425
0.5420

T5
0.5437
0.5439
0.5442
0.5444
0.5445
0.5440
0.5437
0.5431

T6
0.5444
0.5447
0.5449
0.5451
0.5451
0.5446
0.5443
0.5437

Parameters remain unchanged as in Example , and the result can be seen in Figure 19 and Table 12.

Table 12: Results of four algorithms.

F1
F2
F3
F4
F5
F6
F7
F8
Fitness value

GDHS
T6
T5
T1
T2
T4
T1
0
T3
2.4894

IABHS
T6
T4
T2
T2
T5
T1
T3
T5
2.2415

IBAFSA
T3
T5
T6
T6
T4
T1
T2
T1
2.2413

IAFSA-IHS
T6
T5
T4
T6
T2
T1
T3
T5
2.2408

Figure 19: Optimization figure containing four algorithms.

From Figure 19 and Table 12, it is concluded that IAFSA-IHS finds the best solution in highest convergence speed among the four algorithms. Besides, the initial solutions generated by IAFSA-IHS are far better than the ones of others. Among the other three algorithms, IBAFSA performs better in fitness value. IABHS presents a slightly inferior performance than the ones above. GDHS gets the worst results in fitness value as well as in convergence speed. From the example mentioned above, the proposed IAFSA-IHS achieves a general better performance in both simulations that indeed demonstrates the effectiveness of IAFSA-IHS for WTA.

5. Conclusion and Future Works

A new approach to weapon-target assignment in cooperative air combat is proposed. Firstly, assignment model is constructed based on the concept of combat power potential. On the other hand, a hybrid algorithm combining improved AFSA with improved HS is proposed. Finally, the algorithm is tested by eight benchmark functions and two concrete WTA problems in air combat; the results validate the superiority of the proposed approach.

In the future, we will pay more attention to details about the combat power potential energy model of fighter in order to accurately reflect the practical cooperative air combat.

Conflicts of Interest

The authors declare that there are no conflicts of interest regarding the publication of this article.

Acknowledgments

This work was supported by the National Natural Science Foundation of China (61472441).

References

O. Karasakal, “Air defense missile-target allocation models for a naval task group,” Computers and Operations Research, vol. 35, no. 2, pp. 1759–1770, 2008.

Z. R. Bogdanowicz, “A new efficient algorithm for optimal assignment of smart weapons to targets,” Computers and Mathematics with Applications, vol. 58, no. 4, pp. 1965–1969, 2009.

A. Mehmet, “Approximating the optimal mapping for weapon target assignment by fuzzy reasoning,” Information Sciences, vol. 25, no. 5, pp. 30–44, 2014.

Z. R. Bogdanowicz, “Advanced input generating algorithm for effect-based weapon–target pairing optimization,” IEEE Transactions on Systems, Man, and Cybernetics Part A: Systems and Humans, vol. 42, no. 1, pp. 276–280, 2012.

I. H. Toroslu and Y. Arslanoglu, “Genetic algorithm for the personnel assignment problem with multiple objectives,” Information Sciences. An International Journal, vol. 177, no. 3, pp. 787–803, 2007.

Z.-J. Lee, S.-F. Su, and C.-Y. Lee, “Efficiently solving general weapon-target assignment problem by genetic algorithms with greedy eugenics,” IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, vol. 33, no. 1, pp. 113–121, 2003.

F. Bai, T. Q. Chang, and Y. Li, “An improved niche-based adaptive genetic algorithm for WTA problem solving,” in Proceedings of the 2010 1st International Conference on Computational Problem-Solving, ICCP 2010, pp. 27–30, December 2010.

A. R. McKendall Jr., J. Shang, and S. Kuppusamy, “Simulated annealing heuristics for the dynamic facility layout problem,” Computers & Operations Research, vol. 33, no. 8, pp. 2431–2444, 2006.

X. Zeng, Y. Zhu, L. Nan, K. Hu, B. Niu, and X. He, “Solving weapon-target assignment problem using discrete particle swarm optimization,” in Proceedings of the 6th World Congress on Intelligent Control and Automation, WCICA 2006, pp. 3562–3565, IEEE, Dalian, China, June 2006.

R. Thangaraj, M. Pant, and A. K. Nagar, “Maximization of expected target damage value using quantum particle swarm optimization,” in Proceedings of the International Conference on Developments in eSystems Engineering, DeSE 2009, pp. 329–334, IEEE, Abu Dhabi, UAE, December 2009.

M.-C. Su, S.-C. Lai, S.-C. Lin, and L.-F. You, “A new approach to multi-aircraft air combat assignments,” Swarm and Evolutionary Computation, vol. 6, pp. 39–46, 2012.

Y. Li and Y. N. Dong, “Weapon-target assignment based on simulated annealing and discrete particle swarm optimization in cooperative air combat,” Acta Aeronautica et Astronautica Sinica, vol. 31, no. 3, pp. 626–631, 2010.

B. Xin, J. Chen, J. Zhang, L. Dou, and Z. Peng, “Efficient decision makings for dynamic weapon-target assignment by virtual permutation and tabu search heuristics,” IEEE Transactions on Evolutionary Computation, vol. 40, no. 6, pp. 649–662, 2010.

W. D. Song, C. W. Zhao, and J. X. Huo, “Improved differential evolution algorithm for solving WTA problem,” Energy Procedia, vol. 11, pp. 1348–1353, 2011.

J. Zhang, Z.-X. Wang, L. Chen, Z.-B. Wu, and J.-F. Lu, “Modeling and optimization on antiaircraft weapon-target assignment at multiple interception opportunity,” Acta Armamentarii, vol. 35, no. 10, pp. 1644–1650, 2014.

L. Chen, Z. X. Wang, Z. B. Wu et al., “A kind of antiaircraft weapon-target optimal assignment under earlier damage principle,” Acta Aeronautica et Astronautica Sinica, vol. 35, no. 9, pp. 2574–2582, 2014.

T. Zhou, B. Ren, and L. Yu, “Modeling of air combat analysis based on combat power field,” Journal of System Simulation, vol. 20, no. 3, pp. 738–745, 2008.

X. L. Li, Z. J. Shao, and J. X. Qian, “An optimizing method based on autonomous animals: fish swarm algorithm,” Systems Engineering Theory and Practice, vol. 22, no. 11, pp. 32–38, 2002.

D. Yazdani, H. Nabizadeh, E. Mohamadzadeh Kosari, and A. Nadjaran Toosi, “Color quantization using modified artificial fish swarm algorithm,” Lecture Notes in Computer Science, vol. 7106, no. 1, pp. 382–391, 2011.

P. Xue, “Adaptive hybrid artificial fish school algorithm for solving the real roots of polynomials,” in Proceedings of the International Conference on Intelligent Computing (ICIC 2014), Intelligent Computing Theory, vol. 8588 of Lecture Notes in Computer Science, pp. 48–54, Springer.

S. A. El-Said, “Image quantization using improved artificial fish swarm algorithm,” Soft Computing-A Fusion of Foundations,Methodologies and Applications, vol. 19, no. 9, pp. 2667–2679, 2015.

C.-R. Wang, C.-L. Zhou, and J.-W. Ma, “An improved artificial fish-swarm algorithm and its application in feed-forward neural networks,” in Proceedings of the 4th International Conference on Machine Learning and Cybernetics, pp. 2890–2894, 2005.

M. Jiang, Y. Wang, F. Rubio, and D. Yuan, “Spread spectrum code estimation by artificial fish swarm algorithm,” in Proceedings of the IEEE International Symposium on Intelligent Signal Processing (WISP '07), pp. 1–6, October 2007.

M. A. K. Azad, A. M. A. C. Rocha, and E. M. G. P. Fernandes, “Improved binary artificial fish swarm algorithm for the 0-1 multidimensional knapsack problems,” Swarm and Evolutionary Computation, vol. 14, pp. 66–75, 2014.

Z. W. Geem, J. H. Kim, and G. V. Loganathan, “A new heuristic optimization algorithm: harmony search,” Simulation, vol. 76, no. 2, pp. 60–68, 2001.

Y. Z. Chang, Z. W. Li, Y. X. Kou et al., “Method for formation selection in air combat under uncertain information condition,” Systems Engineering and Electronics, vol. 11, no. 38, pp. 2552–2560, 2016.

B. Liu, L. Wang, Y.-H. Jin, F. Tang, and D.-X. Huang, “Improved particle swarm optimization combined with chaos,” Chaos, Solitons and Fractals, vol. 25, no. 5, pp. 1261–1271, 2005.

S. Rahnamayan, H. R. Tizhoosh, and M. M. A. Salama, “Opposition-based differential evolution,” IEEE Transactions on Evolutionary Computation, vol. 12, no. 1, pp. 64–79, 2008.

J.-S. Chun, M.-K. Kim, H.-K. Jung, and S.-K. Hong, “Shape optimization of electromagnetic devices using immune algorithm,” IEEE Transactions on Magnetics, vol. 33, no. 2, pp. 1876–1879, 1997.

L. Wang, R. Yang, Y. Xu, Q. Niu, P. M. Pardalos, and M. Fei, “An improved adaptive binary harmony search algorithm,” Information Sciences. An International Journal, vol. 232, pp. 58–87, 2013.

R.-P. Li, H.-B. Ouyang, L.-Q. Gao, and D.-X. Zou, “Learned harmony search algorithm and its application to 0-1 knapsack problems,” Control and Decision, vol. 28, no. 2, pp. 205–210, 2013.

M. Khalili, R. Kharrat, K. Salahshoor, and M. H. Sefat, “Global dynamic harmony search algorithm: GDHS,” Applied Mathematics and Computation, vol. 228, pp. 195–219, 2014.

B. L. Zhu, R. C. Zhu, and X. F. Xiong, Battle Plane Effectiveness Evaluation, Aviation Industry Press, Beijing, China, 1993.