Order-2 Stability Analysis of Particle Swarm Optimization

2015 ◽  
Vol 23 (2) ◽  
pp. 187-216 ◽  
Author(s):  
Qunfeng Liu

Several stability analyses and stable regions of particle swarm optimization (PSO) have been proposed before. The assumption of stagnation and different definitions of stability are adopted in these analyses. In this paper, the order-2 stability of PSO is analyzed based on a weak stagnation assumption. A new definition of stability is proposed and an order-2 stable region is obtained. Several existing stable analyses for canonical PSO are compared, especially their definitions of stability and the corresponding stable regions. It is shown that the classical stagnation assumption is too strict and not necessary. Moreover, among all these definitions of stability, it is shown that our definition requires the weakest conditions, and additional conditions bring no benefit. Finally, numerical experiments are reported to show that the obtained stable region is meaningful. A new parameter combination of PSO is also shown to be good, even better than some known best parameter combinations.

2009 ◽  
Vol 05 (02) ◽  
pp. 487-496 ◽  
Author(s):  
WEI FANG ◽  
JUN SUN ◽  
WENBO XU

Mutation operator is one of the mechanisms of evolutionary algorithms (EAs) and it can provide diversity in the search and help to explore the undiscovered search place. Quantum-behaved particle swarm optimization (QPSO), which is inspired by fundamental theory of PSO algorithm and quantum mechanics, is a novel stochastic searching technique and it may encounter local minima problem when solving multi-modal problems just as that in PSO. A novel mutation mechanism is proposed in this paper to enhance the global search ability of QPSO and a set of different mutation operators is introduced and implemented on the QPSO. Experiments are conducted on several well-known benchmark functions. Experimental results show that QPSO with some of the mutation operators is proven to be statistically significant better than the original QPSO.


2008 ◽  
Vol 2008 ◽  
pp. 1-9 ◽  
Author(s):  
Ali R. Guner ◽  
Mehmet Sevkli

A discrete version of particle swarm optimization (DPSO) is employed to solve uncapacitated facility location (UFL) problem which is one of the most widely studied in combinatorial optimization. In addition, a hybrid version with a local search is defined to get more efficient results. The results are compared with a continuous particle swarm optimization (CPSO) algorithm and two other metaheuristics studies, namely, genetic algorithm (GA) and evolutionary simulated annealing (ESA). To make a reasonable comparison, we applied to same benchmark suites that are collected from OR-library. In conclusion, the results showed that DPSO algorithm is slightly better than CPSO algorithm and competitive with GA and ESA.


Energies ◽  
2018 ◽  
Vol 11 (10) ◽  
pp. 2851 ◽  
Author(s):  
Valeriya Tuzikova ◽  
Josef Tlusty ◽  
Zdenek Muller

In the modern electric power industry, Flexible AC Transmission Systems (FACTS) have a special place. In connection with the increased interest in the development of “smart energy”, the use of such devices is becoming especially urgent. Their main function is the ability to manage modes in real time: maintain the necessary level of voltage in the grids, control the power flow, increase the capacity of power lines and increase the static and dynamic stability of the power grid. The problem of system reliability and stability is related to the task of definitions and optimizations and planning indicators, design and exploitation. The main aim of this article is the definition of the best placement of the STATCOM compensator in case to provide stability and reliability of the grid with the minimization of the power losses, using Particle Swarm Optimization algorithms. All calculations were performed in MATLAB.


2011 ◽  
Vol 179-180 ◽  
pp. 233-238 ◽  
Author(s):  
Hua Chen ◽  
Yi Ren Fan ◽  
Shao Gui Deng

In view of the defect of particle swarm optimization which easily gets into partial extremum, the paper put out an improved particle swarm optimization, and applies the algorithm to the selecting of parameter of RBF neural network basal function. It searches the best parameter vector in the whole space, according to coding means, iterative formula, adapted function which the paper puts forwards. The experiment proves that RBF neural network based on improved PSO has faster convergent speed, and higher error precision.


Sign in / Sign up

Export Citation Format

Share Document