Topic
Multi-swarm optimization
About: Multi-swarm optimization is a research topic. Over the lifetime, 19162 publications have been published within this topic receiving 549725 citations.
Papers published on a yearly basis
Papers
More filters
TL;DR: An enhanced PSO algorithm called GOPSO is presented, which employs generalized opposition-based learning (GOBL) and Cauchy mutation to overcome the problem of premature convergence when solving complex problems.
384 citations
TL;DR: An improved particle swarm optimizer (PSO) for solving mechanical design optimization problems involving problem-specific constraints and mixed variables such as integer, discrete and continuous variables is presented.
Abstract: This paper presents an improved particle swarm optimizer (PSO) for solving mechanical design optimization problems involving problem-specific constraints and mixed variables such as integer, discrete and continuous variables. A constraint handling method called the ‘fly-back mechanism’ is introduced to maintain a feasible population. The standard PSO algorithm is also extended to handle mixed variables using a simple scheme. Five benchmark problems commonly used in the literature of engineering optimization and nonlinear programming are successfully solved by the proposed algorithm. The proposed algorithm is easy to implement, and the results and the convergence performance of the proposed algorithm are better than other techniques.
382 citations
TL;DR: In this paper, the authors provide an in-depth survey of well-known swarm optimization algorithms and compare them with each other comprehensively through experiments conducted using thirty wellknown benchmark functions and a number of statistical tests are then carried out to determine the significant performances.
Abstract: Many swarm optimization algorithms have been introduced since the early 60’s, Evolutionary Programming to the most recent, Grey Wolf Optimization. All of these algorithms have demonstrated their potential to solve many optimization problems. This paper provides an in-depth survey of well-known optimization algorithms. Selected algorithms are briefly explained and compared with each other comprehensively through experiments conducted using thirty well-known benchmark functions. Their advantages and disadvantages are also discussed. A number of statistical tests are then carried out to determine the significant performances. The results indicate the overall advantage of Differential Evolution (DE) and is closely followed by Particle Swarm Optimization (PSO), compared with other considered approaches.
382 citations
08 May 2002
TL;DR: In this article, an individual-based continuous time model for swarm aggregation in n-dimensional space and its stability properties were studied. And they showed that the individuals (autonomous agents or biological creatures) will form a cohesive swarm in a finite time.
Abstract: We specify an "individual-based" continuous time model for swarm aggregation in n-dimensional space and study its stability properties. We show that the individuals (autonomous agents or biological creatures) will form a cohesive swarm in a finite time. Moreover, we obtain an explicit bound on the swarm size, which depends only on the parameters of the swarm model.
381 citations
24 Apr 2003
TL;DR: The paper presents a modified particle swarm optimization (PSO) algorithm for engineering optimization problems with constraints and shows that PSO is an efficient and general approach to solve most nonlinear optimization problem with inequity constraints.
Abstract: The paper presents a modified particle swarm optimization (PSO) algorithm for engineering optimization problems with constraints. PSO is started with a group of feasible solutions and a feasibility function is used to check if the newly explored solutions satisfy all the constraints. All the particles keep only those feasible solutions in their memory. Several engineering design optimization problems were tested and the results show that PSO is an efficient and general approach to solve most nonlinear optimization problems with inequity constraints.
378 citations