Results 1 - 10
of
809
Self-organizing hierarchical particle swarm optimizer with time-varying acceleration coefficients
- IEEE Transactions on Evolutionary Computation
, 2004
"... Abstract—This paper introduces a novel parameter automation strategy for the particle swarm algorithm and two further extensions to improve its performance after a predefined number of generations. Initially, to efficiently control the local search and convergence to the global optimum solution, tim ..."
Abstract
-
Cited by 189 (2 self)
- Add to MetaCart
(Show Context)
Abstract—This paper introduces a novel parameter automation strategy for the particle swarm algorithm and two further extensions to improve its performance after a predefined number of generations. Initially, to efficiently control the local search and convergence to the global optimum solution, time-varying acceleration coefficients (TVAC) are introduced in addition to the time-varying inertia weight factor in particle swarm optimization (PSO). From the basis of TVAC, two new strategies are discussed to improve the performance of the PSO. First, the concept of “mutation ” is introduced to the particle swarm optimization along with TVAC (MPSO-TVAC), by adding a small perturbation to a randomly selected modulus of the velocity vector of a random particle by predefined probability. Second, we introduce a novel particle swarm concept “self-organizing hierarchical particle swarm optimizer with TVAC (HPSO-TVAC). ” Under this method, only the “social ” part and the “cognitive ” part of the particle swarm strategy are considered to estimate the new velocity of each particle and particles are reinitialized whenever they are stagnated in the search space. In addition, to overcome the difficulties of selecting an appropriate mutation step size for different problems, a time-varying mutation step size was introduced. Further, for most of the benchmarks, mutation probability is found to be insensitive to the performance of MPSO-TVAC method. On the other hand, the effect of reinitialization velocity on the performance of HPSO-TVAC method is also observed. Time-varying reinitialization step size is found to be an efficient parameter optimization strategy for HPSO-TVAC method. The HPSO-TVAC strategy outperformed all the methods considered in this investigation for most of the functions. Furthermore, it has also been observed that both the MPSO and HPSO strategies perform poorly when the acceleration coefficients are fixed at two. Index Terms—Acceleration coefficients, hierarchical particle swarm, mutation, particle swarm, reinitialization. I.
The fully informed particle swarm: Simpler, maybe better
- IEEE Transactions on Evolutionary Computation
, 2004
"... The canonical particle swarm algorithm is a new approach to optimization, drawing inspiration from group behavior and the establishment of social norms. It is gaining popularity, especially because of the speed of convergence and the fact it is easy to use. However, we feel that each individual is n ..."
Abstract
-
Cited by 112 (4 self)
- Add to MetaCart
(Show Context)
The canonical particle swarm algorithm is a new approach to optimization, drawing inspiration from group behavior and the establishment of social norms. It is gaining popularity, especially because of the speed of convergence and the fact it is easy to use. However, we feel that each individual is not simply influenced by the best performer among his neighbors. We thus decided to make the individuals “fully informed. ” The results are very promising, as informed individuals seem to find better solutions in all the benchmark functions.
Stability analysis of social foraging swarms
- IEEE TRANS. ON SYSTEMS, MAN AND CYBERNETICS
, 2004
"... In this article we specify an-member “individual-based” continuous time swarm model with individuals that move in an-dimensional space according to an attractant/repellent or a nutrient profile. The motion of each individual is determined by three factors: i) attraction to the other individuals on ..."
Abstract
-
Cited by 93 (4 self)
- Add to MetaCart
(Show Context)
In this article we specify an-member “individual-based” continuous time swarm model with individuals that move in an-dimensional space according to an attractant/repellent or a nutrient profile. The motion of each individual is determined by three factors: i) attraction to the other individuals on long distances; ii) repulsion from the other individuals on short distances; and iii) attraction to the more favorable regions (or repulsion from the unfavorable regions) of the attractant/repellent profile. The emergent behavior of the swarm motion is the result of a balance between inter-individual interactions and the simultaneous interactions of the swarm members with their environment. We study the stability properties of the collective behavior of the swarm for different profiles and provide conditions for collective convergence to more favorable regions of the profile.
Particle swarm optimization -- An Overview
- SWARM INTELL
, 2007
"... Particle swarm optimization (PSO) has undergone many changes since its introduction in 1995. As researchers have learned about the technique, they have derived new versions, developed new applications, and published theoretical studies of the effects of the various parameters and aspects of the algo ..."
Abstract
-
Cited by 82 (0 self)
- Add to MetaCart
Particle swarm optimization (PSO) has undergone many changes since its introduction in 1995. As researchers have learned about the technique, they have derived new versions, developed new applications, and published theoretical studies of the effects of the various parameters and aspects of the algorithm. This paper comprises a snapshot of particle swarming from the authors’ perspective, including variations in the algorithm, current and ongoing research, applications and open problems.
On the computation of all global minimizers through particle swarm optimization
- IEEE Transactions on Evolutionary Computation
, 2004
"... Abstract—This paper presents approaches for effectively computing all global minimizers of an objective function. The approaches include transformations of the objective function through the recently proposed deflection and stretching techniques, as well as a repulsion source at each detected minimi ..."
Abstract
-
Cited by 74 (18 self)
- Add to MetaCart
(Show Context)
Abstract—This paper presents approaches for effectively computing all global minimizers of an objective function. The approaches include transformations of the objective function through the recently proposed deflection and stretching techniques, as well as a repulsion source at each detected minimizer. The aforementioned techniques are incorporated in the context of the particle swarm optimization (PSO) method, resulting in an efficient algorithm which has the ability to avoid previously detected solutions and, thus, detect all global minimizers of a function. Experimental results on benchmark problems originating from the fields of global optimization, dynamical systems, and game theory, are reported, and conclusions are derived. Index Terms—Deflection technique, detecting all minimizers, dynamical systems, Nash equilibria, particle swarm optimization (PSO), periodic orbits, stretching technique. I.
A hybrid of genetic algorithm and particle swarm optimization for recurrent network design
- IEEE Transactions on Systems, Man and Cybernetics, Part B
"... Abstract—An evolutionary recurrent network which automates the design of recurrent neural/fuzzy networks using a new evolutionary learning algorithm is proposed in this paper. This new evolutionary learning algorithm is based on a hybrid of genetic algorithm (GA) and particle swarm optimization (PSO ..."
Abstract
-
Cited by 73 (1 self)
- Add to MetaCart
(Show Context)
Abstract—An evolutionary recurrent network which automates the design of recurrent neural/fuzzy networks using a new evolutionary learning algorithm is proposed in this paper. This new evolutionary learning algorithm is based on a hybrid of genetic algorithm (GA) and particle swarm optimization (PSO), and is thus called HGAPSO. In HGAPSO, individuals in a new generation are created, not only by crossover and mutation operation as in GA, but also by PSO. The concept of elite strategy is adopted in HGAPSO, where the upper-half of the best-performing individuals in a population are regarded as elites. However, instead of being reproduced directly to the next generation, these elites are first enhanced. The group constituted by the elites is regarded as a swarm, and each elite corresponds to a particle within it. In this regard, the elites are enhanced by PSO, an operation which mimics the maturing phenomenon in nature. These enhanced elites constitute half of the population in the new generation, whereas the other half is generated by performing crossover and mutation operation on these enhanced elites. HGAPSO is applied to recurrent neural/fuzzy network design as follows. For recurrent neural network, a fully connected recurrent neural network is designed and applied to a temporal sequence production problem. For recurrent fuzzy network design, a Takagi–Sugeno–Kang-type recurrent fuzzy network is designed and applied to dynamic plant control. The performance of HGAPSO is compared to both GA and PSO in these recurrent networks design problems, demonstrating its superiority. Index Terms—Dynamic plant control, elite strategy, recurrent neural/fuzzy work, temporal sequence production. I.
DEPSO: Hybrid Particle Swarm with Differential Evolution Operator
, 2003
"... A hybrid particle swarm with differential evolution operator, termed DEPSO, which provide the bell-shaped mutations with consensus on the population diversity along with the evolution, while keeps the self-organized particle swarm dynamics, is proposed. Then it is applied to a set of benchmark funct ..."
Abstract
-
Cited by 62 (3 self)
- Add to MetaCart
A hybrid particle swarm with differential evolution operator, termed DEPSO, which provide the bell-shaped mutations with consensus on the population diversity along with the evolution, while keeps the self-organized particle swarm dynamics, is proposed. Then it is applied to a set of benchmark functions, and the experimental results illustrate its efficiency.
Locating and tracking multiple dynamic optima by a particle swarm model using speciation
- IEEE Trans. Evol. Comput
, 2006
"... Abstract—This paper proposes an improved particle swarm optimizer using the notion of species to determine its neighborhood best values for solving multimodal optimization problems and for tracking multiple optima in a dynamic environment. In the proposed species-based particle swam optimization (SP ..."
Abstract
-
Cited by 56 (3 self)
- Add to MetaCart
(Show Context)
Abstract—This paper proposes an improved particle swarm optimizer using the notion of species to determine its neighborhood best values for solving multimodal optimization problems and for tracking multiple optima in a dynamic environment. In the proposed species-based particle swam optimization (SPSO), the swarm population is divided into species subpopulations based on their similarity. Each species is grouped around a dominating particle called the species seed. At each iteration step, species seeds are identified from the entire population, and then adopted as neighborhood bests for these individual species groups separately. Species are formed adaptively at each step based on the feedback obtained from the multimodal fitness landscape. Over successive iterations, species are able to simultaneously optimize toward multiple optima, regardless of whether they are global or local optima. Our experiments on using the SPSO to locate multiple optima in a static environment and a dynamic SPSO (DSPSO) to track multiple changing optima in a dynamic environment have demonstrated that SPSO is very effective in dealing with multimodal optimization functions in both environments. Index Terms—Multimodal optimization, optimization in dynamic environments, particle swam optimization (PSO), tracking optima in dynamic environments. I.
