Empirical study of bound constraint-handling methods in Particle Swarm Optimization for constrained search spaces

2017 ◽  
Author(s):  
Efren Juarez-Castillo ◽  
Hector-Gabriel Acosta-Mesa ◽  
Efren Mezura-Montes
Keyword(s):  
Particle Swarm Optimization ◽  
Empirical Study ◽  
Particle Swarm ◽  
Constraint Handling ◽  
Swarm Optimization ◽  
Search Spaces ◽  
Handling Methods

Constraint Handling in Particle Swarm Optimization

2012 ◽  
pp. 60-80
Author(s):  
Wen Fung Leong ◽  
Gary G. Yen
Keyword(s):  
Particle Swarm Optimization ◽  
Particle Swarm ◽  
Constraint Handling ◽  
Hidden Information ◽  
Swarm Optimization ◽  
Nondominated Solutions ◽  
Local Searches ◽  
Multiobjective Approach ◽  
Simulation Results ◽  
Fine Tune

In this article, the authors propose a particle swarm optimization (PSO) for constrained optimization. The proposed PSO adopts a multiobjective approach to constraint handling. Procedures to update the feasible and infeasible personal best are designed to encourage finding feasible regions and convergence toward the Pareto front. In addition, the infeasible nondominated solutions are stored in the global best archive to exploit the hidden information for guiding the particles toward feasible regions. Furthermore, the number of feasible personal best in the personal best memory and the scalar constraint violations of personal best and global best are used to adapt the acceleration constants in the PSO flight equations. The purpose is to find more feasible particles and search for better solutions during the process. The mutation procedure is applied to encourage global and fine-tune local searches. The simulation results indicate that the proposed constrained PSO is highly competitive, achieving promising performance.

Constraint Handling in Particle Swarm Optimization

2010 ◽  
Vol 1 (1) ◽  
pp. 42-63 ◽  
Author(s):  
Wen Fung Leong ◽  
Gary G. Yen
Keyword(s):  
Particle Swarm Optimization ◽  
Pareto Front ◽  
Particle Swarm ◽  
Constraint Handling ◽  
Hidden Information ◽  
Swarm Optimization ◽  
Nondominated Solutions ◽  
Local Searches ◽  
Multiobjective Approach ◽  
Fine Tune

In this article, the authors propose a particle swarm optimization (PSO) for constrained optimization. The proposed PSO adopts a multiobjective approach to constraint handling. Procedures to update the feasible and infeasible personal best are designed to encourage finding feasible regions and convergence toward the Pareto front. In addition, the infeasible nondominated solutions are stored in the global best archive to exploit the hidden information for guiding the particles toward feasible regions. Furthermore, the number of feasible personal best in the personal best memory and the scalar constraint violations of personal best and global best are used to adapt the acceleration constants in the PSO flight equations. The purpose is to find more feasible particles and search for better solutions during the process. The mutation procedure is applied to encourage global and fine-tune local searches. The simulation results indicate that the proposed constrained PSO is highly competitive, achieving promising performance.

A Condensed Hybrid Optimization Algorithm Using Enhanced Continuous Tabu Search and Particle Swarm Optimization

2009 ◽  
Author(s):  
Cheng-Hung Chen ◽  
Marco P. Schoen ◽  
Ken W. Bosworth
Keyword(s):  
Particle Swarm Optimization ◽  
Tabu Search ◽  
Particle Swarm ◽  
Search Space ◽  
Hybrid Optimization ◽  
Local Optimum ◽  
Swarm Optimization ◽  
Search Spaces ◽  
Hybrid Optimization Algorithm ◽  
Promising Area

A novel Condensed Hybrid Optimization (CHO) algorithm using Enhanced Continuous Tabu Search (ECTS) and Particle Swarm Optimization (PSO) is proposed. The proposed CHO algorithm combines the respective strengths of ECTS and PSO. The ECTS is a modified Tabu Search (TS), which has good search capabilities on large search spaces. In this study, ECTS is utilized to define smaller search spaces, which are used in a second stage by the basic PSO to find the respective local optimum. The ECTS covers the global search space by using a TS concept called diversification and then selects the most promising areas in the search space. Once the promising regions in the search space are defined, the proposed CHO algorithm employs another TS concept called intensification in order to search the promising area thoroughly. The proposed CHO algorithm is tested with the multi-dimensional Hyperbolic and Rosenbrock problems. Compared to other four algorithms, the simulations results indicate that the accuracy and effectiveness of the proposed CHO algorithm.

Sign in / Sign up

Export Citation Format

Share Document