Fuzzy adaptive particle swarm optimization
Published 13 November 2002
Yuhui Shi, R.C. Eberhart
Citations1,074
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
The experimental results illustrate that the fuzzy adaptive PSO is a promising optimization method, which is especially useful for optimization problems with a dynamic environment.
Abstract
A fuzzy system is implemented to dynamically adapt the inertia weight of the particle swarm optimization algorithm (PSO). Three benchmark functions with asymmetric initial range settings are selected as the test functions. The same fuzzy system has been applied to all three test functions with different dimensions. The experimental results illustrate that the fuzzy adaptive PSO is a promising optimization method, which is especially useful for optimization problems with a dynamic environment.
Keywords
Computer ScienceEngineering
Choice Reviews OnlineGenetic algorithms in search, optimization, and machine learning
49,278 Citations1989
This book brings together the computer techniques, mathematical tools, and research results that will enable both students and practitioners to apply genetic algorithms to problems in many fields.
Particle swarm optimization
47,523 Citations2002James Kennedy, R.C. Eberhart
A new optimizer using particle swarm theory
14,870 Citations2002R.C. Eberhart, James Kennedy
The optimization of nonlinear functions using particle swarm methodology is described and implementations of two paradigms are discussed and compared, including a recently developed locally oriented paradigm.
Medical Entomology and ZoologyGenetic Programming: On the Programming of Computers by Means of Natural Selection
13,257 Citations1992John R. Koza
This book discusses the evolution of architecture, primitive functions, terminals, sufficiency, and closure, and the role of representation and the lens effect in genetic programming.
Empirical study of particle swarm optimization
3,917 Citations2003Yibing Shi, R.C. Eberhart
The experimental results show that the PSO is a promising optimization method and a new approach is suggested to improve PSO's performance near the optima, such as using an adaptive inertia weight.
Lecture notes in computer scienceParameter selection in particle swarm optimization
3,505 Citations1998Yuhui Shi, Russell C. Eberhart
This paper first analyzes the impact that inertia weight and maximum velocity have on the performance of the particle swarm optimizer, and then provides guidelines for selecting these two parameters.
Lecture notes in computer scienceComparison between genetic algorithms and particle swarm optimization
1,600 Citations1998Russell C. Eberhart, Yuhui Shi
This paper compares two evolutionary computation paradigms: genetic algorithms and particle swarm optimization, and suggests ways in which performance might be improved by incorporating features from one paradigm into the other.
The particle swarm: social adaptation of knowledge
1,548 Citations2002James Kennedy
The paper introduces the algorithm, begins to develop a social science context for it, and explores some aspects of its functioning.
Lecture notes in computer scienceEvolutionary optimization versus particle swarm optimization: Philosophy and performance differences
1,119 Citations1998Peter J. Angeline
This paper investigates the philosophical and performance differences of particle swarm and evolutionary optimization by comparison experiments involving four non-linear functions well studied in the evolutionary optimization literature.
Tracking and optimizing dynamic systems with particle swarms
1,008 Citations2002R.C. Eberhart, Yuhui Shi
Three kinds of dynamic systems are defined for the purposes of this paper and one of them is chosen for preliminary analysis using the particle swarm on the parabolic benchmark function.
Using selection to improve particle swarm optimization
872 Citations2002Peter J. Angeline
A hybrid based on the particle swarm algorithm but with the addition of a standard selection mechanism from evolutionary computations is described that shows selection to provide an advantage for some (but not all) complex functions.
Medical Entomology and ZoologyComputational intelligence PC tools
676 Citations1996Russ Eberhart, Pat Simpson +1 more
This book takes a hands-on, desktop-applications approach to the topic of computational intelligence, featuring examples of specific real-world implementations and detailed case studies, with all pertinent code and software included on a floppy disk packaged with the book.
IEEE Transactions on Fuzzy SystemsImplementation of evolutionary fuzzy systems
426 Citations1999Yuhui Shi, R.C. Eberhart +1 more
Benefits of the methodology are illustrated in the process of classifying the iris data set and possible extensions of the methods are summarized.
Fast Evolutionary Programming.
284 Citations1996Xin Yao, Yong Liu
This paper proposes a fast EP (FEP) which uses a Cauchy instead of Gaussian mutation operator as the primary search operator and shows that FEP performs much better than CEP for multi-modal functions with many local minima while being comparable to CEP in performance for unimodal and multi- modal function optimisation problems with only a fewLocal minima.
Evolutionary ComputationA Note on the Empirical Evaluation of Intermediate Recombination
53 Citations1995David B. Fogel, Hans-Georg Beyer
The effectiveness of intermediate recombination in evolution strategies is analyzed in light of the typical procedure of initializing trial solutions uniformly about the global optimum of benchmark functions and indicates that this procedure may predispose results in favor of Intermediate recombination.