.png){kind=icon}
Return
Hybrid ICA-PSO algorithm for continuous optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2013.05.027.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper proposes a new hybrid ICA-PSO algorithm designed to solve mono-objective and multi-objective problems. This continuous optimization algorithm combines an imperialist competitive algorithm (ICA) and a particle swarm optimization (PSO) to improve the exploration ability of ICA. Moreover, ICA-PSO employs the crowding distance to maintain diversity in the Pareto front found by the algorithm as well as a crossover operator to improve the quality of the solutions in the memory of each individual. We test the performance of the proposed algorithm on mono-objective and multi-objective benchmark functions and three engineering design problems, thus showing its ability to optimize different types of optimization problems. Numerical results indicate that our approach outperforms several recently published algorithms, such as NSGA-II and SPEA2. (c) 2013 Elsevier Inc. All rights reserved.
Keywords:
Imperialist competitive algorithm
Particle swarm optimization
Hybrid algorithm
Mono-objective and multi-objective benchmark functions
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W
Organization
Cited Papers
.png){kind=icon}
ShareSave
Constraint-handling in genetic algorithms through the use of dominance-based tournament selection
PREAI
ShareSaveShareSave
ShareSaveShareSave
View more