Research On Optimal Allocation And Scheduling Of Combat Effectiveness

With the rapid development of high-technology war, the confrontation between weapon systems has become the main form of the war. This proposes new requirements for the weapon-target assignment (WTA). The WTA problem is a typical optimization problem, which needs to find a reasonable weapons-target assignment in a short time to maximize the effectiveness of weapon systems. Reasonable assignment of weapons is crucial in military affairs. Because of the importance of the WTA problem, it has become a popular issue. Under such a background, this thesis studies the WTA problem by using the theories of the project called the research on the methods of process industry's pattern recognition, energy consumption optimization and scheduling in military affairs, which is a part of the key national natural science fund project (Project number: 60634020). In addition, the particle swarm optimization (PSO) algorithm is improved from the viewpoint of optimization scheduling. The main contents are summarized as follows:1. The contents of current research and the development trend of the WTA problem is introduced on the basis of referring to lots of literatures. Moreover, we concentrate on some typical models and algorithms. Besides, the deficiencies of each other are presented, respectively.2. Based on the description of the WTA problem, we designate them as static WTA problem or dynamic one by the factor of time. Furthermore, the concrete definitions and the models of each WTA problem are analyzed.3. We introduce the Particle Swarm Optimization (PSO) algorithm and analyze the advantages and disadvantages of the basic algorithm. In order to overcome the shortcomings of basic PSO algorithm to satisfy the demand of time limit, a improved PSO algorithm is structured by introducing the mutation operator and the rule of escape to enhance the ability of global exploration and changing the inertia weight with the generation to enhance the ability of local exploitation.4. The particular realized steps of the hybrid PSO algorithm to tackle the WTA problem are provided. Through the analysis of the simulation results of the static method and the concrete numerical example, the feasibility of the hybrid PSO algorithm is proved. A comparison of the capability to tackle the WTA problem has been made between the basic algorithm and the hybrid PSO algorithm, and it would be emphasized that the hybrid PSO algorithm has the higher precision and the faster convergence.After the review of the current main developments of the WTA problem, we introduce and ameliorate the PSO algorithm in terms of the characteristics of the problem. Moreover, the simulation results proved that the hybrid PSO algorithm is feasible to solve the WTA problem and the hybrid PSO algorithm has better performance than the basic PSO algorithm. The main work and contributions of this thesis have some reference to the studies of the WTA problem.