scholarly journals Solving the Dynamic Weapon Target Assignment Problem by an Improved Multiobjective Particle Swarm Optimization Algorithm

2021 ◽  
Vol 11 (19) ◽  
pp. 9254
Author(s):  
Lingren Kong ◽  
Jianzhong Wang ◽  
Peng Zhao
Keyword(s):  
Particle Swarm Optimization ◽  
Multiobjective Optimization ◽  
Optimization Algorithm ◽  
Particle Swarm Optimization Algorithm ◽  
Optimization Algorithms ◽  
Particle Swarm ◽  
Swarm Optimization ◽  
Multiobjective Particle Swarm Optimization ◽  
Conflicting Objectives ◽  
Target Assignment

Dynamic weapon target assignment (DWTA) is an effective method to solve the multi-stage battlefield fire optimization problem, which can reflect the actual combat scenario better than static weapon target assignment (SWTA). In this paper, a meaningful and effective DWTA model is established, which contains two practical and conflicting objectives, namely, maximizing combat benefits and minimizing weapon costs. Moreover, the model contains limited resource constraints, feasibility constraints and fire transfer constraints. The existence of multi-objective and multi-constraint makes DWTA more complicated. To solve this problem, an improved multiobjective particle swarm optimization algorithm (IMOPSO) is proposed in this paper. Various learning strategies are adopted for the dominated and non-dominated solutions of the algorithm, so that the algorithm can learn and evolve in a targeted manner. In order to solve the problem that the algorithm is easy to fall into local optimum, this paper proposes a search strategy based on simulated binary crossover (SBX) and polynomial mutation (PM), which enables elitist information to be shared among external archive and enhances the exploratory capabilities of IMOPSO. In addition, a dynamic archive maintenance strategy is applied to improve the diversity of non-dominated solutions. Finally, this algorithm is compared with three state-of-the-art multiobjective optimization algorithms, including solving benchmark functions and DWTA model in this article. Experimental results show that IMOPSO has better convergence and distribution than the other three multiobjective optimization algorithms. IMOPSO has obvious advantages in solving multiobjective DWTA problems.

scholarly journals Research on Multiaircraft Cooperative Suppression Interference Array Based on an Improved Multiobjective Particle Swarm Optimization Algorithm

2017 ◽  
Vol 2017 ◽  
pp. 1-12 ◽  
Author(s):  
Huan Zhang ◽  
Rennong Yang ◽  
Changyue Sun ◽  
Haiyan Han
Keyword(s):  
Particle Swarm Optimization ◽  
Multiobjective Optimization ◽  
Optimization Algorithm ◽  
Particle Swarm Optimization Algorithm ◽  
Particle Swarm ◽  
Swarm Optimization ◽  
Minimum Width ◽  
Air Defense ◽  
Radar Network ◽  
Multiobjective Particle Swarm Optimization

For the problem of multiaircraft cooperative suppression interference array (MACSIA) against the enemy air defense radar network in electronic warfare mission planning, firstly, the concept of route planning security zone is proposed and the solution to get the minimum width of security zone based on mathematical morphology is put forward. Secondly, the minimum width of security zone and the sum of the distance between each jamming aircraft and the center of radar network are regarded as objective function, and the multiobjective optimization model of MACSIA is built, and then an improved multiobjective particle swarm optimization algorithm is used to solve the model. The decomposition mechanism is adopted and the proportional distribution is used to maintain diversity of the new found nondominated solutions. Finally, the Pareto optimal solutions are analyzed by simulation, and the optimal MACSIA schemes of each jamming aircraft suppression against the enemy air defense radar network are obtained and verify that the built multiobjective optimization model is corrected. It also shows that the improved multiobjective particle swarm optimization algorithm for solving the problem of MACSIA is feasible and effective.

scholarly journals Multi/Many-Objective Particle Swarm Optimization Algorithm Based on Competition Mechanism

2020 ◽  
Vol 2020 ◽  
pp. 1-26
Author(s):  
Wusi Yang ◽  
Li Chen ◽  
Yi Wang ◽  
Maosheng Zhang
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Algorithm ◽  
Particle Swarm Optimization Algorithm ◽  
Optimization Problems ◽  
Optimization Algorithms ◽  
Particle Swarm ◽  
Benchmark Problems ◽  
Swarm Optimization ◽  
Competition Mechanism ◽  
Multiobjective Particle Swarm Optimization

The recently proposed multiobjective particle swarm optimization algorithm based on competition mechanism algorithm cannot effectively deal with many-objective optimization problems, which is characterized by relatively poor convergence and diversity, and long computing runtime. In this paper, a novel multi/many-objective particle swarm optimization algorithm based on competition mechanism is proposed, which maintains population diversity by the maximum and minimum angle between ordinary and extreme individuals. And the recently proposed θ-dominance is adopted to further enhance the performance of the algorithm. The proposed algorithm is evaluated on the standard benchmark problems DTLZ, WFG, and UF1-9 and compared with the four recently proposed multiobjective particle swarm optimization algorithms and four state-of-the-art many-objective evolutionary optimization algorithms. The experimental results indicate that the proposed algorithm has better convergence and diversity, and its performance is superior to other comparative algorithms on most test instances.

scholarly journals Dynamic Multiaircraft Cooperative Suppression Interference Array Optimization by Dynamic MOPSO Algorithm

2018 ◽  
Vol 2018 ◽  
pp. 1-12
Author(s):  
Huan Zhang ◽  
Rennong Yang ◽  
Changyue Sun
Keyword(s):  
Particle Swarm Optimization ◽  
Multiobjective Optimization ◽  
Optimization Algorithm ◽  
Optimization Problem ◽  
Particle Swarm Optimization Algorithm ◽  
Particle Swarm ◽  
Swarm Optimization ◽  
Air Defense ◽  
Multiobjective Particle Swarm Optimization ◽  
Dynamic Multiobjective Optimization

Dynamic multiaircraft cooperative suppression interference array (MACSIA) optimization problem is a typical dynamic multiobjective optimization problem. In this paper, the sum of the distance between each jamming aircraft and the enemy air defense radar network center and the minimum width of the safety area for route planning are taken as the objective functions. The dynamic changes in the battlefield environment are reduced to two cases. One is that the location of the enemy air defense radar is mobile, but the number remains the same. The other is that the number of the enemy air defense radars is variable, but the original location remains unchanged. Thus, two dynamic multiobjective optimization models of dynamic MACSIA are constructed. The dynamic multiobjective particle swarm optimization algorithm is used to solve the two models, respectively. The optimal dynamic MACSIA schemes which satisfy the limitation of the given suppression interference effect and ensure the safety of the jamming aircraft themselves are obtained by simulation experiments. And then verify the correctness of the constructed dynamic multiobjective optimization model, as well as the feasibility and effectiveness of the dynamic multiobjective particle swarm optimization algorithm in solving dynamic MACSIA problem.

Task Allocation and Path Planning of a Multi-Robot System Using Heuristic Coupled Particle Swarm Optimization Algorithm

2020 ◽  
pp. 194-209
Author(s):  
Arindam Majumder ◽  
Rajib Ghosh
Keyword(s):  
Particle Swarm Optimization ◽  
Path Planning ◽  
Optimization Algorithm ◽  
Task Allocation ◽  
Particle Swarm Optimization Algorithm ◽  
Particle Swarm ◽  
A Algorithm ◽  
Swarm Optimization ◽  
Multiobjective Particle Swarm Optimization ◽  
Multi Robot

This study deals with a plant layout where there were ninety predefined locations which have to be inspected by using three multiple robots in such a way that there would not be any collisions between the robots. A heuristic integrated multiobjective particle swarm optimization algorithm (HPSO) is developed for allocating tasks to each robot and planning of path while moving from one task location to another. For optimal path planning of each robot the research utilized A* algorithm. The task allocation for each robot is carried out using a modified multiobjective particle swarm optimization algorithm where the earliest completion time (ECT) inspired technique is used to make the algorithm applicable in multi robot task allocation problems. At the later stage of this study, in order to test the capability of HPSO an instance is solved by the algorithm and is compared with the existing solutions of a genetic algorithm with the A* algorithm. The computational results showed the superiority of the proposed algorithm over existing algorithms.

An Improved Particle Swarm Optimization Algorithm for Dynamic Power Allocation Problem

2014 ◽  
Vol 687-691 ◽  
pp. 1380-1384
Author(s):  
Jian Jun Zhao ◽  
Wen Jie Zhao
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Algorithm ◽  
Particle Swarm Optimization Algorithm ◽  
Dynamic Environment ◽  
Particle Swarm ◽  
Case Based Reasoning ◽  
Optimal Solutions ◽  
Swarm Optimization ◽  
Multiobjective Particle Swarm Optimization ◽  
Case Based

In this paper, we propose a fast multiobjective particle swarm optimization algorithm (called CBR-fMOPSO for short). In the algorithm, a case-based reasoning (CBR) technique is used to retrieve history optimization results and experts’ experience and add them into the population of multiobjective particle swarm optimization algorithm (MOPSO) in dynamic environment. The optimal solutions found by CBR-fMOPSO are used to mend the case library to improve the accuracy of solving based on CBR in next solving. The results from a suit of experiments in electric furnaces show that the proposed algorithm maintains good performances however the environment changes.

scholarly journals A Dynamic Model for Imputing Missing Medical Data: A Multiobjective Particle Swarm Optimization Algorithm

2021 ◽  
Vol 2021 ◽  
pp. 1-9
Author(s):  
Peyman Almasinejad ◽  
Amin Golabpour ◽  
Mohammad Reza Mollakhalili Meybodi ◽  
Kamal Mirzaie ◽  
Ahmad Khosravi
Keyword(s):  
Particle Swarm Optimization ◽  
Missing Data ◽  
Prediction Model ◽  
Optimization Algorithm ◽  
Expectation Maximization ◽  
Particle Swarm Optimization Algorithm ◽  
Prediction Models ◽  
Particle Swarm ◽  
Swarm Optimization ◽  
Multiobjective Particle Swarm Optimization

Missing data occurs in all research, especially in medical studies. Missing data is the situation in which a part of research data has not been reported. This will result in the incompatibility of the sample and the population and misguided conclusions. Missing data is usual in research, and the extent of it will determine how misinterpreted the conclusions will be. All methods of parameter estimation and prediction models are based on the assumption that the data are complete. Extensive missing data will result in false predictions and increased bias. In the present study, a novel method has been proposed for the imputation of medical missing data. The method determines what algorithm is suitable for the imputation of missing data. To do so, a multiobjective particle swarm optimization algorithm was used. The algorithm imputes the missing data in a way that if a prediction model is applied to the data, both specificity and sensitivity will be optimized. Our proposed model was evaluated using real data of gastric cancer and acute T-cell leukemia (ATLL). First, the model was then used to impute the missing data. Then, the missing data were imputed using deletion, average, expectation maximization, MICE, and missForest methods. Finally, the prediction model was applied for both imputed datasets. The accuracy of the prediction model for the first and the second imputation methods was 0.5 and 16.5, respectively. The novel imputation method was more accurate than similar algorithms like expectation maximization and MICE.

Sign in / Sign up

Export Citation Format

Share Document