International Journal of Intelligent Systems
A Note on the Extended Rosenbrock Function
Evolutionary Computation
A Pareto archive particle swarm optimization for multi-objective job shop scheduling
Computers and Industrial Engineering
Optimization of power allocation for interference cancellation with particle swarm optimization
IEEE Transactions on Evolutionary Computation - Special issue on computational finance and economics
Differential evolution using a neighborhood-based mutation operator
IEEE Transactions on Evolutionary Computation
A study of particle swarm optimization particle trajectories
Information Sciences: an International Journal
Accelerating real-valued genetic algorithms using mutation-with-momentum
AI'05 Proceedings of the 18th Australian Joint conference on Advances in Artificial Intelligence
Evolutionary programming made faster
IEEE Transactions on Evolutionary Computation
Evolutionary programming techniques for economic load dispatch
IEEE Transactions on Evolutionary Computation
Meta-Lamarckian learning in memetic algorithms
IEEE Transactions on Evolutionary Computation
The fully informed particle swarm: simpler, maybe better
IEEE Transactions on Evolutionary Computation
A Cooperative approach to particle swarm optimization
IEEE Transactions on Evolutionary Computation
Handling multiple objectives with particle swarm optimization
IEEE Transactions on Evolutionary Computation
Comprehensive learning particle swarm optimizer for global optimization of multimodal functions
IEEE Transactions on Evolutionary Computation
IEEE Transactions on Evolutionary Computation
Accelerating Differential Evolution Using an Adaptive Local Search
IEEE Transactions on Evolutionary Computation
Evolutionary parallel local search for function optimization
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Chaotic swarming of particles: A new method for size optimization of truss structures
Advances in Engineering Software
Hi-index | 0.00 |
In recent years, particle swarm optimization (PSO) emerges as a new optimization scheme that has attracted substantial research interest due to its simplicity and efficiency. However, when applied to high-dimensional problems, PSO suffers from premature convergence problem which results in a low optimization precision or even failure. To remedy this fault, this paper proposes a novel memetic PSO (CGPSO) algorithm which combines the canonical PSO with a Chaotic and Gaussian local search procedure. In the initial evolution phase, CGPSO explores a wide search space that helps avoid premature convergence through Chaotic local search. Then in the following run phase, CGPSO refines the solutions through Gaussian optimization. To evaluate the effectiveness and efficiency of the CGPSO algorithm, thirteen high dimensional non-linear scalable benchmark functions were examined. Results show that, compared to the standard PSO, CGPSO is more effective, faster to converge, and less sensitive to the function dimensions. The CGPSO was also compared with two PSO variants, CPSO-H, DMS-L-PSO, and two memetic optimizers, DEachSPX and MA-S2. CGPSO is able to generate a better, or at least comparable, performance in terms of optimization accuracy. So it can be safely concluded that the proposed CGPSO is an efficient optimization scheme for solving high-dimensional problems.