scholarly journals Optimization Algorithm for Multiple Phases Sectionalized Modulation Jamming Based on Particle Swarm Optimization

Electronics ◽  
2019 ◽  
Vol 8 (2) ◽  
pp. 160 ◽  
Author(s):  
Jiawei Jiang ◽  
Yanhong Wu ◽  
Hongyan Wang ◽  
Yakun Lv ◽  
Lei Qiu ◽  
...  
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Algorithm ◽  
Fitness Function ◽  
Particle Swarm ◽  
Random Parameters ◽  
Simulation Experiments ◽  
Swarm Optimization ◽  
Fitness Value ◽  
The Relationship ◽  
Jamming Effect

Due to the difficulty in deducing the corresponding relationship between results and parameter settings of multiple phases sectionalized modulation (MPSM) jamming, a problem occurs when obtaining the optimal local suppression jamming effect, which limits the practical application of MPSM jamming. The traditional method struggles to meet the requirements by setting fixed parameters or random parameters. Therefore, an optimization algorithm for MPSM jamming based on particle swarm optimization (PSO) is proposed in this study to produce the optimal local suppression jamming effect and determine its corresponding parameter settings. First, we analyzed the relationship between the degree of mismatch and local suppression jamming effect. Then, we set appropriate fitness function and fitness value. Finally, we used PSO to calculate parameter settings of a section situation and phase situation, which minimizes the fitness function and fitness value. The optimization algorithm avoids the tremendous computation of traversing all parameter settings, is stable, the results are repeatable, and the algorithm provides the optimal local suppression jamming effect under different conditions. The simulation experiments demonstrate the feasibility and effectiveness of the optimization algorithm.

scholarly journals Research on Timetabling Problems Based on Particle Swarm Optimization Algorithm

2012 ◽  
Vol 6-7 ◽  
pp. 736-741
Author(s):  
Xin Min Ma ◽  
Lin Li Wu
Keyword(s):  
Particle Swarm Optimization ◽  
Educational System ◽  
Optimization Algorithm ◽  
Particle Swarm Optimization Algorithm ◽  
Fitness Function ◽  
Particle Swarm ◽  
Swarm Optimization ◽  
Course Timetabling ◽  
Fitness Value ◽  
Course Timetabling Problem

A new algorithm for timetabling based on particle swarm optimization algorithm was proposed, and the key problems such as particle coding, fitness function fabricating, particle swarm initialization and crossover operation were settled. The fitness value declines when the evolution generation increases. The results showed that it was a good solution for course timetabling problem in the educational system.

scholarly journals Particle swarm optimization to produce optimal solution

2018 ◽  
Vol 7 (1.7) ◽  
pp. 210 ◽  
Author(s):  
C Saranya Jothi ◽  
V Usha ◽  
R Nithya
Keyword(s):  
Particle Swarm Optimization ◽  
Test Data ◽  
Fitness Function ◽  
Particle Swarm ◽  
Optimal Solution ◽  
Optimization Techniques ◽  
Optimal Test ◽  
Swarm Optimization ◽  
Test Information ◽  
Fitness Value

Search-Based Software Testing is the utilization of a meta-heuristic improving scan procedure for the programmed age of test information. Particle Swarm Optimization (PSO) is one of those technique. It can be used in testing to generate optimal test data solution based on an objective function that utilises branch coverage as criteria. Software under test is given as input to the algorithm. The problem becomes a minimization problem where our aim is to obtain test data with minimum fitness value. This is called the ideal test information for the given programming under test. PSO algorithm is found to outperform most of the optimization techniques by finding least value for fitness function. The algorithm is applied to various software under tests and checked whether it can produce optimal test data. Parameters are tuned so as to obtain better results.

scholarly journals Hybridization of Genetic Particle Swarm Optimization Algorithm with Symbiotic Organisms Search Algorithm for Solving Optimal Reactive Power Dispatch Problem

2020 ◽  
Vol 3 (1) ◽  
pp. 12-21
Author(s):  
Kanagasabai Lenin
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Algorithm ◽  
Particle Swarm Optimization Algorithm ◽  
Search Algorithm ◽  
Particle Swarm ◽  
Swarm Optimization ◽  
Symbiotic Organisms Search ◽  
Power Dispatch ◽  
Fitness Value ◽  
Symbiotic Organisms

In this work Hybridization of Genetic Particle Swarm Optimization Algorithm with Symbiotic Organisms Search Algorithm (HGPSOS) has been done for solving the power dispatch problem. Genetic particle swarm optimization problem has been hybridized with Symbiotic organisms search (SOS) algorithm to solve the problem. Genetic particle swarm optimization algorithm is formed by combining the Particle swarm optimization algorithm (PSO) with genetic algorithm (GA).  Symbiotic organisms search algorithm is based on the actions between two different organisms in the ecosystem- mutualism, commensalism and parasitism. Exploration process has been instigated capriciously and every organism specifies a solution with fitness value.  Projected HGPSOS algorithm improves the quality of the search.  Proposed HGPSOS algorithm is tested in IEEE 30, bus test system- power loss minimization, voltage deviation minimization and voltage stability enhancement has been attained.

scholarly journals An improved dynamic cooperative random drift particle swarm optimization algorithm based on search history decision

2020 ◽  
Vol 14 ◽  
pp. 174830262097353
Author(s):  
Ji Zhao ◽  
Yi Fu ◽  
Juan Mei
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Algorithm ◽  
Function Approximation ◽  
Particle Swarm Optimization Algorithm ◽  
Fitness Function ◽  
Particle Swarm ◽  
Random Drift ◽  
Swarm Optimization ◽  
Search History ◽  
Drift Particle

A novel dynamic cooperative random drift particle swarm optimization algorithm based on entire search history decision (CRDPSO) is reported. At each iteration, the positions and the fitness values of the evaluated solutions in the algorithm are stored by a binary space partitioning tree structure archive, which leads to a fast fitness function approximation. The mutation is adaptive and parameter-less because of the fitness function approximation enhancing the mutation strategy. The dynamic cooperation between the particles by using the context vector increases the population diversity helps to improve the search ability of the swarm and cooperatively searches for the global optimum. The performance of CRDPSO is tested on standard benchmark problems including multimodal and unimodal functions. The empirical results show that CRDPSO outperforms other well-known stochastic optimization methods.

A Novel Particle Swarm Optimization with Random Parameters

2013 ◽  
Vol 631-632 ◽  
pp. 1324-1329
Author(s):  
Shao Rong Huang
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Algorithm ◽  
Particle Swarm Optimization Algorithm ◽  
Particle Swarm ◽  
Iteration Process ◽  
Local Optimum ◽  
Random Parameters ◽  
Swarm Optimization ◽  
Standard Particle Swarm Optimization ◽  
Fast Convergence Rate

To improve the performance of standard particle swarm optimization algorithm that is easily trapped in local optimum, based on analyzing and comparing with all kinds of algorithm parameter settings strategy, this paper proposed a novel particle swarm optimization algorithm which the inertia weight (ω) and acceleration coefficients (c1 and c2) are generated as random numbers within a certain range in each iteration process. The experimental results show that the new method is valid with a high precision and a fast convergence rate.

Target Position Measurement Technology Based on Quantum-Behaved Particle Swarm Optimization

2013 ◽  
Vol 303-306 ◽  
pp. 403-406 ◽  
Author(s):  
Jin Jie Yao ◽  
Jing Yang ◽  
Jian Li ◽  
Li Ming Wang ◽  
Yan Han
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Algorithm ◽  
Particle Swarm Optimization Algorithm ◽  
Particle Swarm ◽  
Target Position ◽  
Measurement Technology ◽  
Position Measurement ◽  
Swarm Optimization ◽  
Standard Particle Swarm Optimization ◽  
Fitness Value

Quantum-behaved particle swarm optimization algorithm (QPSO) was proposed as a kind of swarm intelligence, which outperformed standard particle swarm optimization algorithm (PSO) in search ability. This paper presents an improved QPSO with nonlinear controlled parameter according to the fitness value of the particles. Simultaneously, we apply the improved QPSO to solve the problems of target position measurement. The experimental results show that the improved QPSO has faster convergence speed, higher measurement accuracy, and good localization performance.

A Novel Centroid Particle Swarm Optimization Algorithm Based on Two Subpopulations

2010 ◽  
Vol 29-32 ◽  
pp. 929-933
Author(s):  
Yong Sheng Wang ◽  
Jun Li Li ◽  
Yang Lou
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Algorithm ◽  
Particle Swarm Optimization Algorithm ◽  
Particle Swarm ◽  
Simulation Experiments ◽  
Swarm Optimization ◽  
System Of Particles ◽  
Speed Up ◽  
Better Than

This paper proposed the concept of centroid in particle swarm optimization which is similar to physical centroid properties of objects. Similarly, we may think of a particle swarm as a discrete system of particles and find the centroid representing the entire population. Usually, it has a more promising position than worse particles among the population. In order to verify the role of centroid which can speed up the convergence rate of the algorithm, and prevent the algorithm from being trapped into a local solution early as far as possible at the same time, A Novel Centroid Particle Swarm Optimization Algorithm Based on Two Subpopulations(CPSO) is proposed. Numerical simulation experiments show that CPSO by testing some benchmark functions is better than Linear Decreasing Weight PSO (LDWPSO) in convergence speed in the same accuracy of solution case.

An Adaptive Particle Swarm Optimization Algorithm Based on Cloud Model

2010 ◽  
Vol 129-131 ◽  
pp. 612-616
Author(s):  
Jin Rong Zhu
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Algorithm ◽  
Particle Swarm Optimization Algorithm ◽  
Cloud Model ◽  
Particle Swarm ◽  
Function Optimization ◽  
Swarm Optimization ◽  
Adaptive Particle Swarm Optimization ◽  
Fitness Value ◽  
Model C

In this paper, an adaptive particle swarm optimization algorithm based on cloud model (C-APSO) is proposed. In the suggested method, the velocities of the all particles are adjusted based on the strategy that a particle whose fitness value is nearer to the optimal particle will fly with smaller velocity. Considering the properties of randomness and stable tendency of a normal cloud model, a Y-conditional normal cloud generator is used to gain the inertial factors of the particles. The simulations of function optimization show that the proposed method has advantage of global convergence property and can effectively alleviate the problem of premature convergence.

Sign in / Sign up

Export Citation Format

Share Document