Experimental Study on Boundary Constraints Handling in Particle Swarm Optimization: From Population Diversity Perspective

  title={Experimental Study on Boundary Constraints Handling in Particle Swarm Optimization: From Population Diversity Perspective},
  author={Shi Cheng and Yuhui Shi and Quande Qin},
  journal={Int. J. Swarm Intell. Res.},
Premature convergence happens in Particle Swarm Optimization PSO for solving both multimodal problems and unimodal problems. With an improper boundary constraints handling method, particles may get "stuck in" the boundary. Premature convergence means that an algorithm has lost its ability of exploration. Population diversity is an effective way to monitor an algorithm's ability of exploration and exploitation. Through the population diversity measurement, useful search information can be… 
Dynamical exploitation space reduction in particle swarm optimization for solving large scale problems
Diversity analysis can conclude that an algorithm's exploitation ability can be enhanced by exploitation space reduction strategy, which has been shown to have better performance than the standard PSO in large scale problems.
Population diversity based study on search information propagation in particle swarm optimization
Premature convergence happens in Particle Swarm Optimization (PSO) partially due to improper search information propagation. Fast propagation of search information will lead particles get clustered
Population Diversity of Particle Swarm Optimization Algorithm on Solving Single and Multi-Objective Problems
Premature convergence occurs in swarm intelligence algorithms searching for optima because the distribution of individuals' information and the diversity change, the degree of exploration and exploitation can be obtained.
Population Diversity of Particle Swarm Optimizer Solving Single and Multi-Objective Problems
The population diversity of particle swarm optimizer is analyzed to measure the goodness of a set of solutions and this metric may guide the search in problems with numerous objectives.
Population diversity based inertia weight adaptation in Particle Swarm Optimization
Experimental results show that a PSO with adaptive inertia weight could obtain performance as good as the standard PSO, and even better on some multimodal problems.
Empirical study of bound constraint-handling methods in Particle Swarm Optimization for constrained search spaces
Results show that the hybrid method that relocates the particles through a position update technique called Centroid and modifies its velocity through the Deterministic Back strategy is able to promote better final results and improve both the approach to the feasible region and the ability to generate better feasible solutions.
Adaptive boundary constraint-handling scheme for constrained optimization
This paper presents an adaptive scheme to handling boundary constraints in constrained numerical optimization problems, and shows that this adaptive scheme has a major impact on the algorithm's performance, and it is able to promote better final results mainly within high-dimensional problems.
Multimodal optimization using particle swarm optimization algorithms: CEC 2015 competition on single objective multi-niche optimization
Based on the experimental results, the conclusions could be made that the PSO with ring structure performs better than the other PSO variants on multimodal optimization.
Population Diversity Maintenance In Brain Storm Optimization Algorithm
A definition of population diversity in BSO algorithm is introduced in this paper to measure the change of solutions’ distribution and show that the performance of the BSO is improved by part of solutions re-initialization strategies.


Boundary Conditions in Particle Swarm Optimization Revisited
Comparisons show that the unrestricted boundary conditions are more efficient when theglobal optimum is inside the boundary of the solution space, and the damping boundary condition is more robust and consistent when the global optimum is close to the boundary.
Measuring exploration/exploitation in particle swarms using swarm diversity
  • O. Olorunda, A. Engelbrecht
  • Computer Science, Geology
    2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence)
  • 2008
This paper takes a look at some of the different definitions of swarm diversity with the intention of determining their usefulness in quantifying swarm exploration/exploitation to lay the foundations for the development of a suitable means to quantify the rate of change of diversity.
Diversity control in particle swarm optimization
Several methods for diversity control of particle swarm optimization are tested on benchmark functions, and the method based on current position and average of current velocities has the best performance.
A hybrid boundary condition for robust particle swarm optimization
The particle swarm optimization (PSO) technique is a powerful stochastic evolutionary algorithm that can be used to find the global optimum solution in a complex search space. However, it has been
Empirical study of particle swarm optimization
  • Y. Shi, R. Eberhart
  • Computer Science
    Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406)
  • 1999
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.
Comprehensive learning particle swarm optimizer for global optimization of multimodal functions
The comprehensive learning particle swarm optimizer (CLPSO) is presented, which uses a novel learning strategy whereby all other particles' historical best information is used to update a particle's velocity.
Normalized Population Diversity in Particle Swarm Optimization
The PSO normalized population diversities are defined and discussed based on matrix analysis based on the analysis of the relationship between pairs of vectors in PSO solution matrix for separable and non-separable problems.
Experimental Analysis of Bound Handling Techniques in Particle Swarm Optimization
This paper proposes and compares a wide variety of bound handling techniques for particle swarm optimization and demonstrates that the bound handling technique can have a major impact on the algorithm performance, and that the method recently proposed as the standard does not, in general, perform well.
Handling boundary constraints for numerical optimization by particle swarm flying in periodic search space
The results on benchmark functions show that particle swarm with periodic mode is capable of improving the search performance significantly, by compared with that of conventional modes and other algorithms.
Monitoring of particle swarm optimization
A diversity measurement called cognitive diversity is discussed and defined, which can reveal clustering information about where the current population of particles intends to move towards and which stage it moves towards.