Solving Constrained Optimization via a Modified Genetic Particle Swarm Optimization
WKDD '08 Proceedings of the First International Workshop on Knowledge Discovery and Data Mining
Improving PSO-Based multi-objective optimization using crowding, mutation and ∈-dominance
EMO'05 Proceedings of the Third international conference on Evolutionary Multi-Criterion Optimization
Search biases in constrained evolutionary optimization
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
A fast and elitist multiobjective genetic algorithm: NSGA-II
IEEE Transactions on Evolutionary Computation
Handling multiple objectives with particle swarm optimization
IEEE Transactions on Evolutionary Computation
A simple multimembered evolution strategy to solve constrained optimization problems
IEEE Transactions on Evolutionary Computation
A Generic Framework for Constrained Optimization Using Genetic Algorithms
IEEE Transactions on Evolutionary Computation
A Multiobjective Optimization-Based Evolutionary Algorithm for Constrained Optimization
IEEE Transactions on Evolutionary Computation
An Adaptive Tradeoff Model for Constrained Evolutionary Optimization
IEEE Transactions on Evolutionary Computation
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
| Hi-index | 0.00 |
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.