A Modified Pareto Ant Colony Optimization Approach to Solve Biobjective Weapon-Target Assignment Problem

Li, You; Kou, Yingxin; Li, Zhanwu; Xu, An; Chang, Yizhe

doi:https://doi.org/10.1155/2017/1746124

International Journal of Aerospace Engineering

On this page

Abstract Introduction Analysis Conclusion Conflicts of Interest References Copyright Related Articles

Research Article | Open Access

Volume 2017 | Article ID 1746124 | https://doi.org/10.1155/2017/1746124

A Modified Pareto Ant Colony Optimization Approach to Solve Biobjective Weapon-Target Assignment Problem

You Li,¹Yingxin Kou,¹Zhanwu Li,^1,2An Xu,^1,2and Yizhe Chang¹

Academic Editor: Linda L. Vahala

Received31 Dec 2016

Revised24 Feb 2017

Accepted28 Feb 2017

Published16 Mar 2017

Abstract

The weapon-target assignment (WTA) problem, known as an NP-complete problem, aims at seeking a proper assignment of weapons to targets. The biobjective WTA (BOWTA) optimization model which maximizes the expected damage of the enemy and minimizes the cost of missiles is designed in this paper. A modified Pareto ant colony optimization (MPACO) algorithm is used to solve the BOWTA problem. In order to avoid defects in traditional optimization algorithms and obtain a set of Pareto solutions efficiently, MPACO algorithm based on new designed operators is proposed, including a dynamic heuristic information calculation approach, an improved movement probability rule, a dynamic evaporation rate strategy, a global updating rule of pheromone, and a boundary symmetric mutation strategy. In order to simulate real air combat, the pilot operation factor is introduced into the BOWTA model. Finally, we apply the MPACO algorithm and other algorithms to the model and compare the data. Simulation results show that the proposed algorithm is successfully applied in the field of WTA which improves the performance of the traditional P-ACO algorithm effectively and produces better solutions than the two well-known multiobjective optimization algorithms NSGA-II and SPEA-II.

1. Introduction

Among air power, land power, and sea power, air power plays the most decisive role in the outcome of any war [1]. With the development of military air combat, the problem of WTA has received considerable attention [2–6]. Because the goal of air power is to maximize the military effectiveness, it becomes imperative to find a proper assignment of weapons to targets. From the perspective of the quantity of objective functions, the WTA problem can be classified into single-objective WTA problem and multiple-objective WTA problem. When taking the time factor into account, the WTA problem can be divided into dynamic WTA problem and static WTA problem. The current research status of various WTA is summarized in Table 1. In this paper, we mainly focus on the static biobjective WTA problem which aims at finding a proper static assignment of maximizing the expected damage of the enemy and minimizing the cost of missiles.

The WTA problem belongs to NP-complete problems (NP: nondeterministic polynomial), so the increment of weapons and targets will result in an explosive growth of the searching space. Although the enumeration method ensures a global solution, its computational requirement grows exponentially as the scale of WTA problem grows. Therefore, seeking better weapons for targets distribution scheme and improving the operational efficiency especially for the large-scale WTA problem are still an important issue in the command and control problem ().

The study of WTA problem can be traced back to the 1950s and 1960s when Manne [7] and Day [8] built the model of WTA problem. Hosein and Athans [9] classified the WTA problem into two classes: the single-objective WTA problem and the multiple-objective WTA problem. Genetic algorithm [10], ACO algorithm [11], auction algorithm [12], VLSN algorithm [13], Tabu search [14], and other hybrid algorithms [15–17] have been used to optimize single-objective WTA model by many scholars. In contrast to single-objective WTA, multiple-objective optimization can take different criterions into consideration and is more in line with the real combat decision-making. So, it has aroused wide attention from scholars. Liu et al. [18] proposed an improved multiobjective particle swarm optimization (MOPSO) algorithm to solve multiple-objective WTA problem and apply it to a simple example including 7 platforms and 10 targets. However, they did not apply the proposed algorithm to different scales WTA problems for contrastive study. Zhang et al. [19] designed a WTA mathematic model and proposed a decomposition-based evolutionary multiobjective optimization algorithm. But the algorithm has not been tested on large-scale WTA problem and it has a low convergence speed. Li et al. [20] adopted NSGA-II (domination-based) and MOEA/D (decomposition-based) to solve the multiple-objective WTA problem and carried out tests on three different BOWTA problems. They only applied the proposed adaptive mechanism to the WTA problems, but they did not verify the behavior of the proposed adaptive mechanism on standard problems.

Different from other algorithms, ACO algorithm is a class of reactive search optimization (RSO) methods adopting the principle of “learning while optimizing” [21, 22]. Since it was introduced in 1992, many variant ACO algorithms have been presented, including ant colony system (ACS) [23] and MAX-MIN ant system (MMAS) [24]. Meanwhile, ACO algorithms have been intensively investigated and successfully applied to deal with multiobjective problems such as travelling salesmen problem (TSP) [25], scheduling problem [26], vehicle routing problem [27], portfolio selection problem [28], network optimization problem [29], and some others problems [30–32]. The main applications of ACO algorithms are shown in Figure 1. In 2004, Doerner et al. proposed the P-ACO algorithm [28] which combined traditional ant system with ant colony optimization. Because P-ACO has the ability to balance local search and global search, it will avoid premature convergence during the solution construction phase. The characteristic is especially suitable for solving portfolio selection problem. Therefore, we choose P-ACO as the approach for solving the BOWTA problem. However, to the best of our knowledge, there has not been any research conducted about P-ACO for BOWTA problem.

Basic multiobjective optimization algorithms have such shortcomings as slow convergence to the Pareto front, no efficient termination criterion, and a lack of theoretical convergence proof. In this paper, we have proposed a modified P-ACO for tackling the above problems. The proposed algorithm is used to seek better compromise solutions between maximizing the expected damage and minimizing the cost. Based on the framework of the traditional P-ACO, the proposed algorithm is devised with several attractive features to enhance the optimization performance, including a dynamic heuristic information calculation approach, an improved movement probability rule, a dynamic evaporation rate strategy, a global updating rule of pheromone, and a boundary symmetric mutation strategy.

Dynamic Heuristic Information Calculation Approach. Because heuristic information seriously affects the efficiency of ACO algorithm, the problem-specific heuristic information function is one of the most important problems that should be solve. Hence, we design a dynamic heuristic information calculation approach for providing necessary guidance for an efficient search.

Improved Movement Probability Rule. In order to avoid P-ACO plunge into the local optimum which is caused by the stagnation phenomenon, we proposed a dynamic movement probability rule to enhance local exploitation and alleviate the premature convergence.

Dynamic Evaporation Rate Strategy. When the algorithm is used to solve large-scale WTA problem, a static pheromone evaporation rate will reduce global searching ability and convergence speed. Therefore, a dynamic evaporation rate strategy is proposed in this paper.

Global Updating Rule of Pheromone. The traditional static pheromone updating rule makes the algorithm easy to fall into local optimum. Hence, a global pheromone updating rule is introduced to solve the conflict between expanding search and finding optimal solution.

Boundary Symmetric Mutation Strategy. When solving large-scale problem, the distributions of targets are complex. In order to avoid the search being stuck in local optimum and diversify the solutions, a boundary symmetric mutation strategy is proposed to improve the mutation efficiency and the quality of solutions.

The rest of this paper is organized as follows. In Section 2, a mathematical model of the BOWTA problem and a problem-specific assumption description are presented. Section 3 provides algorithmic descriptions of P-ACO algorithm and presents the application of ACO algorithm for solving WTA problem. Detailed improvements of the proposed algorithm are introduced in Section 4. In Section 5, experimental evaluation is carried out and the analysis of the results is presented. Firstly, in order to validate effectiveness and show performance, the proposed algorithm is applied in a specific instance. Secondly, the proposed algorithm and others, like NSGA-II [33], SPEA-II [34], and traditional P-ACO [28], are tested on several different scales WTA problems. Section 6 provides some conclusion of the paper.

2. Problem Formulation

The WTA problem focuses on how to allocate attack units to targets and can be illustrated in Figure 2. WTA assumptions and mathematical model are introduced as follows in this section.

2.1. Assumption Description

In order to establish a reasonable WTA mathematical model, the following assumptions can be defined.

Assumption 1. We assume that the mathematical model is composed of fighters, missiles, and targets. The fighters and targets are not necessarily equal in quantity (each fighter is equivalent to one platform which takes different kinds and quantities of missiles).

Assumption 2. Each fighter can use different missiles to attack one target (each missile can only attack one target).

Assumption 3. All allocated missiles cannot exceed the number of missiles resources in military air operation.

Assumption 4. We assume the probability of kill () between the missile (th unit of ) and the target (th unit of ).

Assumption 5. If the target is in work area, then a missile can be assigned effectively. On the other hand, the missile is not.

2.2. Mathematical Model

The multiobjective optimization is to make the number of weapons to targets reach the maximum and reduce missiles consumption as much as possible. The definitions about the optimization model are shown as follows.

Definition 6. The multiobjective functions of WTA are to maximize the total effectiveness of attack and minimize the cost of missiles. The optimization mathematical model is described as

Definition 7. represents the effectiveness of the missile unit. It is known as the probability of kill for each target () and missile ().

Definition 8. The decision table can be shown as Table 2.
Here, is a Boolean value () and represents whether missile is assigned to target. If the missile of fighter is assigned to the target, ; otherwise, is equal to 0.

Definition 9. denotes the cost of missile and is given a constant value in this paper.

Definition 10. In combat, different fighters are equipped with different numbers of missiles, so one assumes that the number of missiles carried by each fighter is not necessarily equal (the number of missiles carried by each plane is no more than 4).

Definition 11. According to the talent, training time, and operation stability of the pilot, all the above factors may affect the attack performance of the missile. One assumes that is pilot operation factor .

Definition 12. There are some constraints that the above function variables must satisfy.
Missile Assignment Constraint. For simplicity, we assume that at least one missile unit is assigned to one target. This constraint can be expressed asQuantity Assignment Constraint. We assume that one missile can only attack one target. The corresponding constraint isParameters Constraint. In this paper, we will use some parameters like . The corresponding constraint is defined as follows:

3. Ant Colony Optimization Algorithm

3.1. Pareto Ant Colony Optimization Algorithm (P-ACO)

The ACO is a heuristic algorithm which has emerged in recent years and has been applied to solve hard combinatorial optimization problems [35]. Scientists have developed ACO by imitating the behaviors of real ant colonies in the process of searching for food. When ants in the colony find a short path for gathering food by frequently travelling between their nest and the food source, they deposit a chemical called pheromone trail on the path which can be followed by other ants to search for the food source [36].

Pareto ant colony optimization (P-ACO) algorithm is one of the multiple-objective ant colony optimization (MOACO) algorithms that was proposed by Doerner et al. [28] to be originally applied to optimize the multiobjective portfolio selection. The main objective of P-ACO algorithm is to find a set of solutions ordered by fronts under the concept of Pareto front. Although it is based on the classical ACS, the update process of global pheromone trail is implemented by using two different ants (the best and the second-best solutions) which are generated by each objective in current iteration. In P-ACO, denotes the pheromone matrices of objective . During each iteration, represents the weight of objective and is used to combine the pheromone information and heuristic information. In the route, an ant selects the next node to be visited from node , and it uses the ACS transition rule like formula (5). is a random number from 0 to 1. is a fixed parameter (). When , the available knowledge is exploited for selecting the best option through pheromone trail heuristic information. The formula is shown below: where is a set of objectives, represents the heuristic information of edge , and is a probabilistic node. is the weight coefficient of pheromone information and is the weight coefficient of heuristic information. and belong to . is the current feasible neighborhood of the ant.

When , is implemented for finding and the formula is expressed as

When an ant has travelled an edge in the algorithm, local pheromone update (online pheromone trail update) is implemented for each objective by the rulewhere is the pheromone evaporation rate () and is the value of initial pheromone trail. In this paper, we use the same method as the literature [37] to set the value of .

When each ant has constructed its solution, global pheromone update (offline pheromone trail update) is implemented for each objective . The update formula is shown below:where follows the problem-specific values:

In the process, the nondominated solutions are stored in an external set .

The pseudocode of the P-ACO algorithm can be demonstrated as shown in Algorithm 1.

() Pre-processing;
() Initialization: generate the number of ants , initialize pheromone vectors with ,
set the values of and ;
() repeat until Termination conditions has not been met
() for Ant = 1 to
determine the lifespan of the ant randomly of the interval ;
create /built empty assignment solution/;
determine the objective weight for each objective ;
indicates the number of targets to be selected ;
() while and with
select an assignment using formula (5) and add it to ;
update local pheromone information;
decrement ;

check feasibility ;
() if is feasible
check efficiency ;
() if is efficient
store and remove dominated ones;

() for each objective
determine best and second-best solution for each objective ;
update global pheromone information using best and second-best solution;
using formula (8);
.

3.2. Application of ACO Algorithm for Solving WTA Problem

At the beginning, each missile has a list of possible target assignments (Figure 3). The number of assignments is independent of the conditions which are set at first. Each ant builds a tour (WTA solution) while moving from one to another list until all of them have been visited. Figure 3 gives an example with two ants, four missiles, and six targets during an iteration. is a set of missiles. The size of each list is fixed to the number of targets (). To construct a WTA solution (a tour), the 1st ant visits Target 2 (missile 1), Target 5 (missile 2), Target 4 (missile 3), and Target 3 (missile 4) by using a transition rule which takes the pheromone trails of visited nodes and the heuristic information into account. On the contrary, the 2nd ant visits Target 4 (missile 1), Target 3 (missile 2), Target 6 (missile 3), and Target 1 (missile 4). If the 1st solution is better than the 2nd solution, then the 1st solution is the best solution at current iteration and the algorithm enters the next iteration.

4. Improvements of the MPACO Algorithm

4.1. Dynamic Heuristic Information Calculation Approach

The heuristic information denotes the probability of the ant moving from to and is an optional weighting function calculated by heuristic approach. Because must be calculated for all ants in each iteration, it may seriously affect the efficiency of the ACO algorithm. How to design the problem-specific heuristic information function is one of the important problems that should be solved. There are two main calculation approaches of heuristic information at present: (1) is calculated at first and remains unchanged in each iteration until the algorithm finishes [23] and (2) compared with the first approach is given a dynamic value according to the current iteration [38]. In the first approach, is more efficient but cannot completely indicate the probability. The second approach can satisfy precise estimation of the probability but will relatively reduce the efficiency of computation. In order to solve the WTA problem, an improved calculating approach for heuristic information which considers the efficiency of calculation and the quality of solution is proposed. The values of biobjective functions are considered in the approach. The formulas can be shown as follows:where and dividedly denote the first objective function and the second one. is the total probability heuristic information which is represented as multiplied by . is a positive constant.

4.2. Improved Movement Probability Rule

In practice, ACO algorithm is easy to plunge into the local optimum which is caused by stagnation phenomenon. So, the dynamic movement probability rule based on essential selection () and random selection () is proposed to improve the strategy of global search in the process. The phenomenon of the paths which have been visited is enhanced. The selected probability of the paths will increase in the next iteration. Because few ants visit the path, some better solutions cannot be stored at the beginning iterations. If more ants can visit the path less traveled in the process, it will be beneficial to the solutions space and effectively perfect the P-ACO algorithm. The probability can be computed aswhere denotes the number of ants according to the specific problem, represents the current iteration, is a constant, is the total number of ants that have visited the same node so far, and is the maximum value of . The value of takes into account and simultaneously. If the current iteration tends to the sub-Pareto solution, the pheromone of sub-Pareto solution will be enhanced. But the number of increased and the value of decreased. This strategy can restrain the excessive growth of pheromone and escape from the local optimum.

4.3. Dynamic Evaporation Rate Strategy

In classical P-ACO algorithm, the pheromone evaporation rate is a fixed parameter (). The value of is one of the main factors which have an influence on global search ability and convergence speed. When P-ACO algorithm is applied to solve large-scale problem, the value of pheromone is close to 0 and global search ability declines. If the value of pheromone becomes very large, the selection probability of the passed nodes increases and global search ability is also directly affected. How to design the value of pheromone is crucial to the release and evaporation of pheromone. In order to improve the global search ability, the common strategy is to set a large value of at the beginning of the algorithm. But the evaporation rate will also decay in the process, so that the P-ACO algorithm can quickly fall into local optimum. Two advantages are brought about by the dynamic evaporation rate strategy: (1) better global search ability and (2) faster convergence speed. The mathematical expression of decay model is shown below:where is the maximum iteration and is set at the beginning and is the current iteration. denotes the maximum of pheromone and denotes the minimum of pheromone.

4.4. Global Updating Rule of Pheromone

A fixed pheromone update rule is mainly used in the classical P-ACO algorithm. The traditional strategy may flung the algorithm into local optimum and has three disadvantages: (1) the distribution features of solution are ignored; (2) there is the trend of stagnation; (3) the convergence rate is slow. In addition to the pheromone local updating rule, the proposed MPACO adopts an adaptive adjustment global updating rule which can effectively deal with the conflict between expanding search and finding Pareto solution. In this rule, the pheromone information of each objective is updated by the best and second-best solution. The rule also provides some instructive guidance to improve the quality of the solutions. The pheromone can be computed aswhere is an assignment of a population best (or second-best) ant according to objective . The strategy maintains the Pareto exploitation and balances the random search and the function about pheromone evaporation or augmentation. In order to reduce the otherness of pheromone on the local Pareto solution and expand the search scope, the positive feedback of P-ACO algorithm is restrained by adding a little amount of negative feedback pheromone in the process. If the algorithm falls into a local Pareto point during a period of iterations, then the adaptive adjustment strategy will be adopted to decrease the amount of pheromone for escaping from local Pareto front. The two expressions are similar in format, but the objective function is different.

4.5. Boundary Symmetric Mutation Strategy

Based on the mathematical statistics theory, the distribution of the samples will be close to the normal distribution when the number of samples tends to infinity. In solving WTA, targets coordinates according to the values are sorted. When a larger scale problem is solved, the distributions of targets are complex and a majority of targets are on the central region. The path of ants is boundary-center-boundary in the initial stage, so that all ants will follow the original track mode.

In order to solve the above problem, the mutation strategy is used for boundary mutation which can improve the mutation efficiency and the quality of solutions. Based on the quartile idea in probability theory, the mutation strategy is applied to mutate 1/4 solutions in both sides of the path. Due to the symmetry of the boundary, crossover and mutation only take place in the selected boundary which did not happen among others.

According to the above improvements, a modified Pareto ant colony optimization (MPACO) algorithm based on dynamic calculation approach of heuristic information, improved movement probability rules, improvement strategy of evaporation factor, improved global updating rules of pheromone, and boundary symmetric mutation strategy is proposed in this paper.

4.6. The Structure of MPACO Algorithm

According to the idea of the proposed MPACO algorithm, the structure of MPACO algorithm in solving BOWTA problem can be shown as follows.

Begin

Step 0 (preprocessing). These nodes of decision table are divided into center nodes and boundary nodes according to which represents the effectiveness of the missile. The classification result is saved and sorted in order to prepare for the subsequent run of the MPACO algorithm.

Step 1 (initialization of parameters for the proposed MPACO). These parameters include the colony of ants , the maximum iteration , the pheromone information factor , heuristic information factor , and initial uniform probability .

While (Termination conditions has not been met) do For . For .

Step 2. The ants randomly visit targets of each missile by constraints (2), (3), and (4), and these assignments are added into the decision list of the ant .

Step 3. Due to the dynamic calculation approach of heuristic information, formulas (10) are used to calculate coupling before Step 4.

Step 4. According to (11) of improved movement probability rules, the probability that the ant selects the next node is calculated (Section 4.2). Then, this node is added into the decision list, and the pheromone is locally updated.

Step 5. After the ants have completed a selection, the fitness function will be calculated. Then, the decision list is modified. Repeat Step 4 until the ant completed the tour (namely, all missiles are allocated). The current best and second-best solutions are saved and the global best solution is updated for the current iteration.

End for

Step 6. Based on (8) and (13), the pheromone is globally updated.

Step 7. Update Pareto optimal front set.

Step 8. Set the iterative counter for the iteration control. If , return to Step 2.

End while

Step 9. The proposed MPACO algorithm is terminated; output Pareto solutions.

5. Experiment Results and Analysis

5.1. Parameter Settings

In order to select the initial value of pheromone , we use the formula in the literature [39], which can be shown as follows:where is a solution of the th objective computed by a greedy algorithm, is the number of objectives in problem-specific function, and is the fitness function of the solution according to the th objective.

Based on the numbers of targets and missiles in a different BOWTA scale, the maximum number of iterations is set. Some parameters of MPACO algorithm are shown in Table 3.

We can see from Table 4 that the numerical experiments have been performed on a PC with Intel(R) Core(TM) i5-4460T CPU @ 1.90 GHz, with 8.00 GB of RAM, running Windows 7 64 bits as the operating system. The codes of all algorithms and optimization models have been written in C++ under Microsoft Visual C++ 6.0.

5.2. Numerical Experiments and Analysis

5.2.1. Computation Results on Specific Example

A specific example is designed to verify performances of the algorithm. Assume that there are 4 fighters that carry different numbers of missiles (12 missile units in total) and 10 targets in the simulation. Missiles damage probability , pilot operation factor , and cost of missiles are shown in Tables 5–7.

According to the literature [1], we present the missiles cost, as shown in Table 7.

Firstly, an enumeration method is employed to the specific example instance and a set of evenly distributed true Pareto solutions (PSs) are obtained. Secondly, the proposed algorithm is used to find PSs.

Figure 4 presents the distribution of the true PSs solved by enumeration method and final PSs obtained by the MPACO in the objective space. We can see from the figure that the MPACO can find close and even PSs in the objective space. It is evident that MPACO can guarantee the quality of solutions. So, the MPACO for optimizing the BOWTA is well verified to be feasible.

We can get some results from Figure 5 and Table 8 as follows: when funds of national defense are enough, we can choose Scheme which cost the most money and obtain the greatest expected damage of the enemy. When funds are insufficient, we should choose one scheme among Schemes , , and on the basis of threat coefficient of each target. Considering that all targets must be allocated and the cost of missiles should be minimized, we can only choose Scheme .

5.2.2. Comparison Study

In order to verify the applicability and feasibility of the proposed algorithm, we test MPACO, P-ACO, NSGA-II, and SPEA-II on Scale , Scale , and Scale instances. Three examples represent, respectively, small-, medium-, and large-scale BOWTA instances under the same condition. The quantitative indexes, such as Pareto figure and time performance, are chosen to evaluate the performance on C++. The value of three instances can be seen from Table 9.

In what follows, Scale instance is firstly taken as an example to illustrate the performance of MPACO, P-ACO, NSGA-II, and SPEA-II. Then, Scale and Scale instances are introduced to further demonstrate the performances of both algorithms. The statistical results are shown in Figures 5–7.

Figures 5–7 present the distribution of PSs obtained in 30 runs with the best performance of each algorithm for each test instance in objective space. When especially tested on Scale and Scale , the MPACO can obtain the best solutions among the four algorithms. Due to increments of dynamic calculation approach of heuristic information and improved movement probability rules, the calculation accuracy of MPACO algorithm is improved. Boundary symmetric mutation strategy is also good for the algorithm to solve large-scale BOWTA problem.

The primary aim of solving BOWTA problems is to lay the foundation for the DWTA problems whose goal is to provide a set of near-optimal or acceptable real-time decisions in air combat. So, in practice, the time performance of algorithms is also an important index. In the end, we test four algorithms on three instances in 30 runs and record the literation time of each algorithm. The statistical results of time performances are shown in Figures 8–10.

Although MPACO does not have time advantage in solving Scale and Scale compared with other algorithms, it runs as fast as SPEA-II with the same number of function evaluations on Scale . Boundary symmetric mutation strategy improves the mutation efficiency and the quality of solutions and new evaporation factor is good for solving large-scale problems, but dynamic heuristic information and probability rules affect the iteration rate. In real air combat situations, pilots often make deadly decisions within seconds or even within milliseconds. Although the algorithm structure and implementation process are relatively complex and increase the computational complexity, high-performance hardware platform can be adopted to reduce the processing time and satisfy the real-time requirement.

In this section, we do some work as follows. Firstly, we test the MPACO on a specific example. We verify the feasibility after comparing two kinds of PSs and show the corresponding distribution results. Secondly, to give a comparison study among the four algorithms, three different scale instances are introduced to evaluate each algorithm. Plots of the best PSs in 30 runs of each algorithm are presented to have an intuitive comparison. Lastly, we show the time performance of the four algorithms on each instance. To summarize, MPACO has been proven to be an effective technique for BOWTA optimization problem and obviously is the best among the four algorithms.

6. Conclusion

We apply ACO to WTA problem and propose the MPACO to solve BOWTA in this paper. The main contributions of the thesis are summarized as follows. On the one hand, the expected damage of enemy and the cost of missiles are taken into account from a practical viewpoint; on the other hand, pilot operation factor and missiles constraints are introduced to make the model in line with the real air combat. In this aspect, five strategies are proposed and embedded into traditional P-ACO algorithm to improve performances of MPACO algorithm. The experiments have shown that MPACO can find better Pareto solutions than the other three algorithms for all instances. More importantly, MPACO is more suitable for solving large-scale problems from the time performance viewpoint.

However, we mainly have studied the static WTA problem; few researches focused on dynamic problems which are more instructive to real combat. In recent years, more and more researches began to pay attention to DWTA problems. A further study on this topic is one of our future tasks.

Conflicts of Interest

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

References

R. N. Rai and N. Bolia, “Optimal decision support for air power potential,” IEEE Transactions on Engineering Management, vol. 61, no. 2, pp. 310–322, 2014.
View at: Publisher Site | Google Scholar
S. Matlin, “A review of the literature on the missile-allocation problem,” Operations Research, vol. 18, no. 2, pp. 334–373, 1970.
View at: Publisher Site | Google Scholar
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.
View at: Publisher Site | Google Scholar
E. Çetin and S. T. Esen, “A weapon-target assignment approach to media allocation,” Applied Mathematics and Computation, vol. 175, no. 2, pp. 1266–1275, 2006.
View at: Publisher Site | Google Scholar
X.-Y. Wang, C.-Z. Hou, J.-M. Yuan, F. Guo, and W. Hao, “Modeling and optimization method on antiaircraft firepower allocation,” Control & Decision, vol. 21, no. 8, pp. 913–917, 2006.
View at: Google Scholar
B. Alidaee, H. Wang, and F. Landram, “A note on integer programming formulations of the real-time optimal scheduling and flight path selection of UAVs,” IEEE Transactions on Control Systems Technology, vol. 17, no. 4, pp. 839–843, 2009.
View at: Publisher Site | Google Scholar
A. S. Manne, “A target-assignment problem,” Operations Research, vol. 6, pp. 346–351, 1958.
View at: Publisher Site | Google Scholar | MathSciNet
R. H. Day, “Allocating weapons to target complexes by means of nonlinear programming,” Operations Research, vol. 14, no. 6, pp. 992–1013, 1966.
View at: Publisher Site | Google Scholar
P. A. Hosein and M. Athans, Preferential Defense Strategies. Part I: The Static Case, MIT Laboratory for Information and Decision Systems, Cambridge, Mass, USA, 1990.
Z. R. Bogdanowicz, A. Tolano, K. Patel, and N. P. Coleman, “Optimization of weapon-target pairings based on kill probabilities,” IEEE Transactions on Cybernetics, vol. 43, no. 6, pp. 1835–1844, 2013.
View at: Publisher Site | Google Scholar
S. Chen, J. He, and H. Liu, “Realization and simulation of parallel ant colony algorithm to solve WTA problem,” in Proceedings of the International Conference on Systems and Informatics (ICSAI '12), May 2012.
View at: Publisher Site | Google Scholar
A.-G. Fei, L.-Y. Zhang, and Q.-J. Ding, “Multi-aircraft cooperative fire assignment based on auction algorithm,” Systems Engineering & Electronics, vol. 34, no. 9, pp. 1829–1833, 2012.
View at: Publisher Site | Google Scholar
M.-Z. Lee, “Constrained weapon–target assignment: enhanced very large scale neighborhood search algorithm,” IEEE Transactions on Systems, Man, and Cybernetics Part A:Systems and Humans, vol. 40, no. 1, pp. 198–204, 2010.
View at: Publisher Site | Google Scholar
D. G. Galati and M. A. Simaan, “Effectiveness of the Nash strategies in competitivemulti-team target assignment problems,” IEEE Transactions on Aerospace & Electronics System, vol. 43, no. 1, pp. 126–134, 2007.
View at: Google Scholar
Z.-J. Lee and W.-L. Lee, “A Hybrid search algorithm of ant colony optimization and genetic algorithm applied to weapon-target assignment problems,” in Intelligent Data Engineering and Automated Learning, vol. 2690 of Lecture Notes in Computer Science, pp. 278–285, Springer, Berlin, Germany, 2003.
View at: Publisher Site | Google Scholar
Y. Li and Y. 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.
View at: Google Scholar
H.-D. Chen, S.-Z. Wang, and H.-Y. Wang, “Research of firepower assignment with multi-launcher and multi-weapon based on a hybrid particle swarm optimization,” Systems Engineering & Electronics, vol. 30, no. 5, pp. 880–883, 2008.
View at: Google Scholar
X. Liu, Z. Liu, W.-S. Hou, and J.-H. Xu, “Improved MOPSO algorithm for multi-objective programming model of weapon-target assignment,” Systems Engineering & Electronics, vol. 35, no. 2, pp. 326–330, 2013.
View at: Publisher Site | Google Scholar
Y. Zhang, R.-N. Yang, J.-L. Zuo, and X.-N. Jing, “Weapon-target assignment based on decomposition-based evolutionary multi-objective optimization algorithms,” Systems Engineering & Electronics, vol. 36, no. 12, pp. 2435–2441, 2014.
View at: Publisher Site | Google Scholar
J. Li, J. Chen, B. Xin, and L. Dou, “Solving multi-objective multi-stage weapon target assignment problem via adaptive NSGAII and adaptive MOEA/D: A Comparison Study,” in Proceedings of the IEEE Congress on Evolutionary Computation (CEC '15), pp. 3132–3139, May 2015.
View at: Publisher Site | Google Scholar
R. Battiti, M. Brunato, and F. Mascia, “Reactive search and intelligent optimization,” Operations Research, vol. 45, no. 1, pp. 74–89, 2008.
View at: Google Scholar
R. Battiti and G. Tecchiolli, “The reactive tabu search,” ORSA Journal on Computing, vol. 6, no. 2, pp. 126–140, 1994.
View at: Publisher Site | Google Scholar
M. Dorigo and L. M. Gambardella, “Ant colony system: a cooperative learning approach to the traveling salesman problem,” IEEE Transactions on Evolutionary Computation, vol. 1, no. 1, pp. 53–66, 1997.
View at: Publisher Site | Google Scholar
T. Stützle and H. H. Hoos, “Max-min ant system,” Future Generation Computer Systems, vol. 16, no. 9, pp. 889–914, 1999.
View at: Google Scholar
S. Iredi, D. Merkle, and M. Middendorf, “Bi-criterion optimization with multi colony ant algorithms,” in Evolutionary Multi-Criterion Optimization: First International Conference, EMO 2001 Zurich, Switzerland, March 7–9, 2001 Proceedings, vol. 1993 of Lecture Notes in Computer Science, pp. 359–372, Springer, Berlin, Germany, 2001.
View at: Publisher Site | Google Scholar
D. Merkle, M. Middendorf, and H. Schmeck, “Ant colony optimization for resource-constrained project scheduling,” IEEE Transactions on Evolutionary Computation, vol. 6, no. 4, pp. 333–346, 2002.
View at: Publisher Site | Google Scholar
J. E. Bell and P. R. McMullen, “Ant colony optimization techniques for the vehicle routing problem,” Advanced Engineering Informatics, vol. 18, no. 1, pp. 41–48, 2004.
View at: Publisher Site | Google Scholar
K. Doerner, W. J. Gutjahr, R. F. Hartl, C. Strauss, and C. Stummer, “Pareto ant colony optimization: a metaheuristic approach to multiobjective portfolio selection,” Annals of Operations Research, vol. 131, pp. 79–99, 2004.
View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet
P. Cardoso, M. Jesus, and A. Márquez, “MONACO-multi-objective network optimisation based on an ACO,” in Proceedings of the X Encuentros de Geometrıa Computacional, vol. 1, no. 1, pp. 1–10, Seville, Spain, 2013.
View at: Google Scholar
P. R. McMullen, “An ant colony optimization approach to addressing a JIT sequencing problem with multiple objectives,” Artificial Intelligence in Engineering, vol. 15, no. 3, pp. 309–317, 2001.
View at: Publisher Site | Google Scholar
T. Stützle and M. Dorigo, “ACO algorithms for the quadratic assignment problem,” New Ideas in Optimization, vol. 3, no. 1, pp. 33–50, 2000.
View at: Google Scholar
A. Baykasoglu, T. Dereli, and I. Sabuncu, “A multiple objective and colony ant colony optimization approach to assembly line balancing problems,” in Proceedings of the 35th International Conference on Computers and Industrial Engineering, pp. 263–268, IEEE, Istanbul, Turkey, June 2005.
View at: Google Scholar
K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan, “A fast and elitist multiobjective genetic algorithm: NSGA-II,” IEEE Transactions on Evolutionary Computation, vol. 6, no. 2, pp. 182–197, 2002.
View at: Publisher Site | Google Scholar
E. Zitzler, M. Laumanns, and L. Thiele, “SPEA2: improving the strength pareto evolutionary algorithm,” in Proceedings of the Conference on Evolutionary Methods for Design, Optimisation and Control with Applications to Industrial Problems, pp. 95–100, Athens, Greece, September 2001.
View at: Google Scholar
M. Dorigo and T. Tzle, “Ant colony optimization,” in Wiley Encyclopedia of Operations Research and Management Science, pp. 1155–1173, John Wiley & Sons, New York, NY, USA, 2004.
View at: Google Scholar
I. D. I. D. Ariyasingha and T. G. I. Fernando, “Performance analysis of the multi-objective ant colony optimization algorithms for the traveling salesman problem,” Swarm & Evolutionary Computation, vol. 23, pp. 11–26, 2015.
View at: Publisher Site | Google Scholar
B. Baran and M. Schaerer, “A multiobjective ant colony system for vehicle routing problem with time windows,” in Proceedings of the 21th IASTED International Conference on Applied Informatics, pp. 97–102, DBLP, February 2003.
View at: Google Scholar
V. Maniezzo and A. Colorni, “The ant system applied to the quadratic assignment problem,” IEEE Transactions on Knowledge and Data Engineering, vol. 11, no. 5, pp. 769–778, 1999.
View at: Publisher Site | Google Scholar
C. García-Martínez, O. Cordón, and F. Herrera, “A taxonomy and an empirical analysis of multiple objective ant colony optimization algorithms for the bi-criteria TSP,” European Journal of Operational Research, vol. 180, no. 1, pp. 116–148, 2007.
View at: Publisher Site | Google Scholar
Z.-J. Lee, C.-Y. Lee, and S.-F. Su, “An immunity-based ant colony optimization algorithm for solving weapon-target assignment problem,” Applied Soft Computing Journal, vol. 2, no. 1, pp. 39–47, 2002.
View at: Publisher Site | Google Scholar
Z.-J. Lee, S.-F. Su, and C.-Y. Lee, “A genetic algorithm with domain knowledge for weapon‐target assignment problems,” Journal of the Chinese Institute of Engineers, vol. 25, no. 3, pp. 287–295, 2002.
View at: Google Scholar
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 Systems, Man and Cybernetics Part C: Applications and Reviews, vol. 40, no. 6, pp. 649–662, 2010.
View at: Publisher Site | Google Scholar
B. Xin, J. Chen, Z. Peng et al., “An efficient rule-based constructive heuristic to solve dynamic weapon-target assignment problem,” IEEE Transactions on Systems Man & Cybernetics, Part A: Systems & Humans, vol. 41, no. 3, pp. 598–606, 2011.
View at: Google Scholar
P. Chen, Y. Zheng, and W. Zhu, “Optimized simulated annealing algorithm for thinning and weighting large planar arrays in both far-field and near-field,” Frontiers of Information Technology & Electronic Engineering, vol. 11, no. 4, pp. 261–269, 2010.
View at: Google Scholar
D. K. Ahner and C. R. Parson, “Optimal multi-stage allocation of weapons to targets using adaptive dynamic programming,” Optimization Letters, vol. 9, no. 8, pp. 1689–1701, 2015.
View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet
N. Dirik, S. N. Hall, and J. T. Moore, “Maximizing strike aircraft planning efficiency for a given class of ground targets,” Optimization Letters, vol. 9, no. 8, pp. 1729–1748, 2015.
View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet
H. Liang and F. Kang, “Adaptive chaos parallel clonal selection algorithm for objective optimization in WTA application,” Optik, vol. 127, no. 6, pp. 3459–3465, 2016.
View at: Publisher Site | Google Scholar
N. Li, W. Huai, and S. Wang, “The solution of target assignment problem in command and control decision-making behavior simulation,” Enterprise Information Systems, vol. 1, no. 1, pp. 1–19, 2016.
View at: Google Scholar

Copyright

Copyright © 2017 You Li 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.

PDF Download Citation

Download other formats

Order printed copies

Views

2587

Downloads

1737

Citations