scholarly journals Improved Particle Swarm Optimization Algorithm Based on Last-Eliminated Principle and Enhanced Information Sharing

2018 ◽  
Vol 2018 ◽  
pp. 1-17 ◽  
Author(s):  
Xueying Lv ◽  
Yitian Wang ◽  
Junyi Deng ◽  
Guanyu Zhang ◽  
Liu Zhang
Keyword(s):  
Particle Swarm Optimization ◽  
Information Sharing ◽  
Optimization Problems ◽  
Optimization Algorithms ◽  
Particle Swarm ◽  
Population Diversity ◽  
Search Performance ◽  
Information Communication ◽  
Swarm Optimization ◽  
Classical Optimization

In this study, an improved eliminate particle swarm optimization (IEPSO) is proposed on the basis of the last-eliminated principle to solve optimization problems in engineering design. During optimization, the IEPSO enhances information communication among populations and maintains population diversity to overcome the limitations of classical optimization algorithms in solving multiparameter, strong coupling, and nonlinear engineering optimization problems. These limitations include advanced convergence and the tendency to easily fall into local optimization. The parameters involved in the imported “local-global information sharing” term are analyzed, and the principle of parameter selection for performance is determined. The performances of the IEPSO and classical optimization algorithms are then tested by using multiple sets of classical functions to verify the global search performance of the IEPSO. The simulation test results and those of the improved classical optimization algorithms are compared and analyzed to verify the advanced performance of the IEPSO algorithm.

Improved Particle Swarm Optimization Algorithm and its Application Based on the Aggregation Degree

2013 ◽  
Vol 427-429 ◽  
pp. 1934-1938
Author(s):  
Zhong Rong Zhang ◽  
Jin Peng Liu ◽  
Ke De Fei ◽  
Zhao Shan Niu
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Algorithm ◽  
Particle Swarm Optimization Algorithm ◽  
Optimization Problems ◽  
Particle Swarm ◽  
Population Diversity ◽  
Function Optimization ◽  
Local Optimum ◽  
Swarm Optimization ◽  
Improved Particle Swarm Optimization

The aim is to improve the convergence of the algorithm, and increase the population diversity. Adaptively particles of groups fallen into local optimum is adjusted in order to realize global optimal. by judging groups spatial location of concentration and fitness variance. At the same time, the global factors are adjusted dynamically with the action of the current particle fitness. Four typical function optimization problems are drawn into simulation experiment. The results show that the improved particle swarm optimization algorithm is convergent, robust and accurate.

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 Adaptive Multiswarm Comprehensive Learning Particle Swarm Optimization

Information ◽  
2018 ◽  
Vol 9 (7) ◽  
pp. 173 ◽  
Author(s):  
Xiang Yu ◽  
Claudio Estevez
Keyword(s):  
Particle Swarm Optimization ◽  
Particle Velocity ◽  
Pareto Front ◽  
Optimization Problems ◽  
Particle Swarm ◽  
Search Performance ◽  
Swarm Optimization ◽  
Nondominated Solutions ◽  
The Difference ◽  
Update Strategy

Multiswarm comprehensive learning particle swarm optimization (MSCLPSO) is a multiobjective metaheuristic recently proposed by the authors. MSCLPSO uses multiple swarms of particles and externally stores elitists that are nondominated solutions found so far. MSCLPSO can approximate the true Pareto front in one single run; however, it requires a large number of generations to converge, because each swarm only optimizes the associated objective and does not learn from any search experience outside the swarm. In this paper, we propose an adaptive particle velocity update strategy for MSCLPSO to improve the search efficiency. Based on whether the elitists are indifferent or complex on each dimension, each particle adaptively determines whether to just learn from some particle in the same swarm, or additionally from the difference of some pair of elitists for the velocity update on that dimension, trying to achieve a tradeoff between optimizing the associated objective and exploring diverse regions of the Pareto set. Experimental results on various two-objective and three-objective benchmark optimization problems with different dimensional complexity characteristics demonstrate that the adaptive particle velocity update strategy improves the search performance of MSCLPSO significantly and is able to help MSCLPSO locate the true Pareto front more quickly and obtain better distributed nondominated solutions over the entire Pareto front.

scholarly journals A Multiobjective Particle Swarm Optimization Algorithm Based on Competition Mechanism and Gaussian Variation

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-23 ◽  
Author(s):  
Hongli Yu ◽  
Yuelin Gao ◽  
Jincheng Wang
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Problems ◽  
Particle Swarm ◽  
Population Diversity ◽  
Distance Method ◽  
Swarm Optimization ◽  
Multiobjective Particle Swarm Optimization ◽  
Mutation Strategy ◽  
Speed Up ◽  
Particle Parameters

In order to solve the shortcomings of particle swarm optimization (PSO) in solving multiobjective optimization problems, an improved multiobjective particle swarm optimization (IMOPSO) algorithm is proposed. In this study, the competitive strategy was introduced into the construction process of Pareto external archives to speed up the search process of nondominated solutions, thereby increasing the speed of the establishment of Pareto external archives. In addition, the descending order of crowding distance method is used to limit the size of external archives and dynamically adjust particle parameters; in order to solve the problem of insufficient population diversity in the later stage of algorithm iteration, time-varying Gaussian mutation strategy is used to mutate the particles in external archives to improve diversity. The simulation experiment results show that the improved algorithm has better convergence and stability than the other compared algorithms.

Comparative Study of Path Planning by Particle Swarm Optimization and Genetic Algorithm

2014 ◽  
Vol 687-691 ◽  
pp. 1420-1424
Author(s):  
Hai Tao Han ◽  
Wan Feng Ji ◽  
Yao Qing Zhang ◽  
De Peng Sha
Keyword(s):  
Genetic Algorithm ◽  
Particle Swarm Optimization ◽  
Path Planning ◽  
Optimization Problems ◽  
Particle Swarm ◽  
Search Performance ◽  
Operational Environment ◽  
Swarm Optimization ◽  
Vehicle Path ◽  
Swarm Intelligence Algorithm

Two main requirements of the optimization problems are included: one is finding the global minimum, the other is obtaining fast convergence speed. As heuristic algorithm and swarm intelligence algorithm, both particle swarm optimization and genetic algorithm are widely used in vehicle path planning because of their favorable search performance. This paper analyzes the characteristics and the same and different points of two algorithms as well as making simulation experiment under the same operational environment and threat states space. The result shows that particle swarm optimization is superior to genetic algorithm in searching speed and convergence.

scholarly journals Software Module Clustering Using Grid-Based Many-Objective Particle Swarm Optimization

2021 ◽  
Author(s):  
Amarjeet Prajapati
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Problems ◽  
Optimization Algorithms ◽  
Particle Swarm ◽  
Poor Performance ◽  
Software Module ◽  
Swarm Optimization ◽  
Software Module Clustering ◽  
The Many ◽  
Grid Based

Abstract The poor performance of traditional multi-objective optimization algorithms over the many-objective optimization problems has led to the development of a variety of many-objective optimization algorithms. Recently, several many-objective optimization algorithms have been proposed to address the different class of many-objective optimization problems. Most of the existing many-objective optimization algorithms were designed from the perspective of synthetic many-objective optimization problems. Despite the tremendous work made in the development of the many-objective optimization algorithms for solving the synthetic many-objective optimization problems, still real-world many-objective optimization problems gained little attention. In this work, we propose a grid-based many-objective particle swarm optimization (GrMaPSO) for the many-objective software optimization problem. In this contribution, the grid-based selection strategies along with other supportive strategies such as two-archive storing and crowding distance have been exploited in the framework of particle swarm optimization. The performance of the proposed approach is evaluated and compared to three existing approaches over five problem instances. The results demonstrate that the proposed approach is more effective and has significant advantages over existing many-objective approaches designed for the software module clustering problems.

An improved heterogeneous multi-swarm PSO algorithm to generate an optimal T-S fuzzy model of a hydraulic process

2017 ◽  
Vol 40 (6) ◽  
pp. 2039-2053 ◽  
Author(s):  
Jaouher Chrouta ◽  
Abderrahmen Zaafouri ◽  
Mohamed Jemli
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Problems ◽  
Particle Swarm ◽  
Fuzzy Model ◽  
Processing Unit ◽  
Search Performance ◽  
Swarm Optimization ◽  
Generalization Ability ◽  
Central Processing ◽  
Inertia Weight

In this paper, a new methodology to develop an Optimal Fuzzy model (OptiFel) using an improved Multi-swarm Particle Swarm Optimization (MsPSO) algorithm is proposed with a new adaptive inertia weight based on Grey relational analysis. Since the classical MsPSO suffers from premature convergence and can be trapped into local optima, which significantly affects the model accuracy, a modified MsPSO algorithm is presented here. The most important advantage of the proposed algorithm is the adjustment of fewer parameters in which the main parameter is the inertia weight. In fact, the control of this parameter could facilitate the convergence and prevent an explosion of the swarm. The performance of the proposed algorithm is evaluated by adopting standard tests and indicators which are reported in the specialized literature. The proposed Grey MsPSO is first applied to solve the optimization problems of six benchmark functions and then, compared with the other nine variants of particle swarm optimization. In order to demonstrate the higher search performance of the proposed algorithm, the comparison is then made via two performance tests such as the standard deviation and central processing unit time. To further validate the generalization ability of the Improved OptiFel approach, the proposed algorithm is secondly applied on the Box–Jenkins Gas Furnace system and on a irrigation station prototype. A comparative study based on Mean Square Error is then performed between the proposed approach and other existing methods. As a result, the improved Grey MsPSO is well adopted to find an optimal model for the real processes with high accuracy and strong generalization ability.

A Local Best Particle Swarm Optimization Based on Crown Jewel Defense Strategy

2015 ◽  
Vol 6 (1) ◽  
pp. 41-63 ◽  
Author(s):  
Jiarui Zhou ◽  
Junshan Yang ◽  
Ling Lin ◽  
Zexuan Zhu ◽  
Zhen Ji
Keyword(s):  
Particle Swarm Optimization ◽  
High Efficiency ◽  
Optimization Problems ◽  
State Of The Art ◽  
Particle Swarm ◽  
Global Optimum ◽  
Population Diversity ◽  
Swarm Optimization ◽  
Von Neumann ◽  
Swarm Intelligence Algorithm

Particle swarm optimization (PSO) is a swarm intelligence algorithm well known for its simplicity and high efficiency on various optimization problems. Conventional PSO suffers from premature convergence due to the rapid convergence speed and lack of population diversity. PSO is easy to get trapped in local optimal, which largely deteriorates its performance. It is natural to detect stagnation during the optimization, and reactivate the swarm to search towards the global optimum. In this work the authors impose the reflecting bound-handling scheme and von Neumann topology on PSO to increase the population diversity. A novel Crown Jewel Defense (CJD) strategy is also introduced to restart the swarm when it is trapped in a local optimal. The resultant algorithm named LCJDPSO-rfl is tested on a group of unimodal and multimodal benchmark functions with rotation and shifting, and compared with other state-of-the-art PSO variants. The experimental results demonstrate stability and efficiency of LCJDPSO-rfl on most of the functions.

scholarly journals Recent Advances in Particle Swarm Optimization for Large Scale Problems

2018 ◽  
Vol 1 (1) ◽  
pp. 22 ◽  
Author(s):  
Danping Yan ◽  
Yongzhong Lu
Keyword(s):  
Particle Swarm Optimization ◽  
Large Scale ◽  
Optimization Problems ◽  
Rapid Development ◽  
Optimization Algorithms ◽  
Particle Swarm ◽  
Swarm Optimization ◽  
Large Scale Problems ◽  
Design Variables ◽  
Huge Impact

Accompanied by the advent of current big data ages, the scales of real world optimization problems with many decisive design variables are becoming much larger. Up to date, how to develop new optimization algorithms for these large scale problems and how to expand the scalability of existing optimization algorithms have posed further challenges in the domain of bio-inspired computation. So addressing these complex large scale problems to produce truly useful results is one of the presently hottest topics. As a branch of the swarm intelligence based algorithms, particle swarm optimization (PSO) for coping with large scale problems and its expansively diverse applications have been in rapid development over the last decade years. This review paper mainly presents its recent achievements and trends, and also highlights the existing unsolved challenging problems and key issues with a huge impact in order to encourage further more research in both large scale PSO theories and their applications in the forthcoming years.

Sign in / Sign up

Export Citation Format

Share Document