Serial configuration of genetic algorithm and particle swarm optimization to increase the convergence speed and accuracy

2010 ◽  
Author(s):  
Gh. Alizadeh ◽  
M. Baradarannia ◽  
P. Yazdizadeh ◽  
Y. Alipouri
Keyword(s):  
Genetic Algorithm ◽  
Particle Swarm Optimization ◽  
Particle Swarm ◽  
Convergence Speed ◽  
Swarm Optimization ◽  
Speed And Accuracy

Review of Task Scheduling Algorithm Research in Cloud Computing

2014 ◽  
Vol 926-930 ◽  
pp. 3236-3239 ◽  
Author(s):  
Mei Geng Huang ◽  
Zhi Qi Ou
Keyword(s):  
Genetic Algorithm ◽  
Cloud Computing ◽  
Particle Swarm Optimization ◽  
Task Scheduling ◽  
Ant Colony Algorithm ◽  
Particle Swarm ◽  
Convergence Speed ◽  
Ant Colony ◽  
Swarm Optimization ◽  
Slow Convergence

The cloud computing task scheduling field representative algorithms was introduced and analyzed : genetic algorithm, particle swarm optimization, ant colony algorithm. Parallelism and global search solution space is the characteristic of genetic algorithm, genetic iterations difficult to proceed when genetic individuals are very similar; Particle swarm optimization in the initial stage is fast, slow convergence speed in the later stage ; Ant colony algorithm optimization ability is good, slow convergence speed in its first stage; Finally, the summary and prospect the future research direction.

scholarly journals Path planning of mobile robot based on particle swarm optimization algorithm

2021 ◽  
Vol 2093 (1) ◽  
pp. 012013
Author(s):  
Huimin Yang ◽  
Lei Jiang ◽  
Lijuan Wu
Keyword(s):  
Particle Swarm Optimization ◽  
Particle Swarm Optimization Algorithm ◽  
Particle Swarm ◽  
Population Diversity ◽  
Convergence Speed ◽  
Mean Deviation ◽  
Convergence Problem ◽  
Swarm Optimization ◽  
Induction Strategy ◽  
Speed And Accuracy

Abstract Aiming at the premature convergence problem of particle swarm optimization (PSO) due to the loss of population diversity in the late stage of search, this paper improves the traditional PSO and proposes the elite mean deviation induction strategy, which improves the convergence speed and accuracy of PSO. The experimental results show that the convergence speed and accuracy of the improved PSO are improved. The effectiveness of the improved algorithm is proved.

scholarly journals An Improved Particle Swarm Optimization Algorithm Using Eagle Strategy for Power Loss Minimization

2017 ◽  
Vol 2017 ◽  
pp. 1-11 ◽  
Author(s):  
Hamza Yapıcı ◽  
Nurettin Çetinkaya
Keyword(s):  
Genetic Algorithm ◽  
Particle Swarm Optimization ◽  
Power System ◽  
Power Loss ◽  
Particle Swarm Optimization Algorithm ◽  
Reactive Power ◽  
Particle Swarm ◽  
Power Losses ◽  
Swarm Optimization ◽  
Eagle Strategy

The power loss in electrical power systems is an important issue. Many techniques are used to reduce active power losses in a power system where the controlling of reactive power is one of the methods for decreasing the losses in any power system. In this paper, an improved particle swarm optimization algorithm using eagle strategy (ESPSO) is proposed for solving reactive power optimization problem to minimize the power losses. All simulations and numerical analysis have been performed on IEEE 30-bus power system, IEEE 118-bus power system, and a real power distribution subsystem. Moreover, the proposed method is tested on some benchmark functions. Results obtained in this study are compared with commonly used algorithms: particle swarm optimization (PSO) algorithm, genetic algorithm (GA), artificial bee colony (ABC) algorithm, firefly algorithm (FA), differential evolution (DE), and hybrid genetic algorithm with particle swarm optimization (hGAPSO). Results obtained in all simulations and analysis show that the proposed method is superior and more effective compared to the other methods.

scholarly journals A Modified NM-PSO Method for Parameter Estimation Problems of Models

2012 ◽  
Vol 2012 ◽  
pp. 1-12 ◽  
Author(s):  
An Liu ◽  
Erwie Zahara ◽  
Ming-Ta Yang
Keyword(s):  
Genetic Algorithm ◽  
Parameter Estimation ◽  
Particle Swarm Optimization ◽  
Differential Equations ◽  
Ordinary Differential Equations ◽  
Optimization Problems ◽  
Particle Swarm ◽  
Swarm Optimization ◽  
Wide Range ◽  
Estimation Problems

Ordinary differential equations usefully describe the behavior of a wide range of dynamic physical systems. The particle swarm optimization (PSO) method has been considered an effective tool for solving the engineering optimization problems for ordinary differential equations. This paper proposes a modified hybrid Nelder-Mead simplex search and particle swarm optimization (M-NM-PSO) method for solving parameter estimation problems. The M-NM-PSO method improves the efficiency of the PSO method and the conventional NM-PSO method by rapid convergence and better objective function value. Studies are made for three well-known cases, and the solutions of the M-NM-PSO method are compared with those by other methods published in the literature. The results demonstrate that the proposed M-NM-PSO method yields better estimation results than those obtained by the genetic algorithm, the modified genetic algorithm (real-coded GA (RCGA)), the conventional particle swarm optimization (PSO) method, and the conventional NM-PSO method.

Sign in / Sign up

Export Citation Format

Share Document