Evolutionary computation techniques, genetic algorithms, evolutionary strategies and genetic programming are motivated by the evolution of nature. A population of individuals, which encode the problem solutions are manipulated according to the rule of survival of the fittest through "genetic" operations, such as mutation, crossover and reproduction. A best solution is evolved through the generations. In contrast to evolutionary computation techniques, Eberhart and Kennedy developed a different algorithm through simulating social behavior (R.C. Eberhart et al., 1996; R.C. Eberhart and J. Kennedy, 1996; J. Kennedy and R.C. Eberhart, 1995; J. Kennedy, 1997). As in other algorithms, a population of individuals exists. This algorithm is called particle swarm optimization (PSO) since it resembles a school of flying birds. In a particle swarm optimizer, instead of using genetic operators, these individuals are "evolved" by cooperation and competition among the individuals themselves through generations. Each particle adjusts its flying according to its own flying experience and its companions' flying experience. We introduce a new parameter, called inertia weight, into the original particle swarm optimizer. Simulations have been done to illustrate the significant and effective impact of this new parameter on the particle swarm optimizer.
David E. Goldberg,et al.
Genetic Algorithms in Search Optimization and Machine Learning
Lawrence. Davis,et al.
Handbook Of Genetic Algorithms
John R. Koza,et al.
Genetic programming - on the programming of computers by means of natural selection
Complex adaptive systems.
Russell C. Eberhart,et al.
A new optimizer using particle swarm theory
MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science.
Computational intelligence PC tools
The particle swarm: social adaptation of knowledge
Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).