Application Of Bi-level Programming To Task Assignment Problem

With the development of new technology, new theory of Modern information warfare, Cyberspace and Cyber warfare are proposed. With the widely application of task assignment in the military field and the increasing importance of command and control system in Cyberspace operations, this proposes new requirements on how to achieve rapid command and rational allocation of resources in cyberspace. The WTA problem is a typical optimization, which needs to find a reasonable weapon-target assignment in a short time to maximize the effectiveness of the operation. Reasonable assignment of weapons is crucial in military affairs. Because of the importance of the WTA problems, it has become a popular issue at home and abroad. Under such a background, we study the WTA problem on the basis of existing research results. The main contents are summarized as follows:1.We combine the weapon target assignment problem and aerial platform weapon mounting problem and construct a new WTA model-bi-level WTA model. The new model has better applicability for modern air combat.2.In order to over the shortcomings of basic PSO, we propose two improvement strategies. We make the flight time of particles changing dynamically to increase the convergence rate. Besides, we introduce the rule of escape based on Levy flight to enhance the ability of global exploration. A Bi-Level Modified Particle Swarm Optimization(BLMPSO) algorithm is structured on the base of bi-level hierarchical optimization.3.Through the simulation of the concrete numerical example and the analysis of the simulation results, the feasibility of bi-level WTA model and the availability of BLMPSO algorithm are proved. We use the BLPSO algorithm which based on standard PSO algorithm to solve the same instance, the results show the superiority of the improved algorithm. A comparison of the capability to tackle the WTA problem of different scale has been made between the BLPSO algorithm and BLMPSO algorithm, and it would be emphasized the BLMPSO algorithm has the faster convergence and higher precision.After the review of the current main developments of the WTA problem,we construct a new bi-level WTA model. In terms of the characteristics of the problem, we improve the baisc PSO algorithm. Moreover, the sumulation results proved that the modified algorithm has better performance.