Hybrid ICA-PSO algorithm for continuous optimization

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.

[1]  David Corne,et al.  The Pareto archived evolution strategy: a new baseline algorithm for Pareto multiobjective optimisation , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[2]  Bo Liu,et al.  Improved particle swarm optimization combined with chaos , 2005 .

[3]  Francisco Herrera,et al.  A study on the use of non-parametric tests for analyzing the evolutionary algorithms’ behaviour: a case study on the CEC’2005 Special Session on Real Parameter Optimization , 2009, J. Heuristics.

[4]  Marco Dorigo,et al.  Distributed Optimization by Ant Colonies , 1992 .

[5]  Caro Lucas,et al.  Imperialist competitive algorithm: An algorithm for optimization inspired by imperialistic competition , 2007, 2007 IEEE Congress on Evolutionary Computation.

[6]  Marco Laumanns,et al.  SPEA2: Improving the strength pareto evolutionary algorithm , 2001 .

[7]  Qingfu Zhang,et al.  Multiobjective optimization Test Instances for the CEC 2009 Special Session and Competition , 2009 .

[8]  Antonio J. Nebro,et al.  jMetal: A Java framework for multi-objective optimization , 2011, Adv. Eng. Softw..

[9]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[10]  Ling Wang,et al.  An effective co-evolutionary particle swarm optimization for constrained engineering design problems , 2007, Eng. Appl. Artif. Intell..

[11]  Han Huang,et al.  A Particle Swarm Optimization Algorithm with Crossover Operator , 2007, 2007 International Conference on Machine Learning and Cybernetics.

[12]  Jing J. Liang,et al.  Problem Definitions and Evaluation Criteria for the CEC 2005 Special Session on Real-Parameter Optimization , 2005 .

[13]  James Kennedy,et al.  Particle swarm optimization , 1995, Proceedings of ICNN'95 - International Conference on Neural Networks.

[14]  Carlos A. Coello Coello,et al.  Use of a self-adaptive penalty approach for engineering optimization problems , 2000 .

[15]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

[16]  Prospero C. Naval,et al.  An effective use of crowding distance in multiobjective particle swarm optimization , 2005, GECCO '05.

[17]  Carlos A. Coello Coello,et al.  An empirical study about the usefulness of evolution strategies to solve constrained optimization problems , 2008, Int. J. Gen. Syst..

[18]  Carlos A. Coello Coello,et al.  Improving PSO-Based Multi-objective Optimization Using Crowding, Mutation and epsilon-Dominance , 2005, EMO.

[19]  Xiaodong Li,et al.  A Non-dominated Sorting Particle Swarm Optimizer for Multiobjective Optimization , 2003, GECCO.

[20]  Hao Chen,et al.  Parallel Simulated Annealing and Genetic Algorithms: a Space of Hybrid Methods , 1994, PPSN.

[21]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[22]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[23]  Carlos A. Coello Coello,et al.  Constraint-handling in genetic algorithms through the use of dominance-based tournament selection , 2002, Adv. Eng. Informatics.

[24]  Siamak Talatahari,et al.  IMPERIALIST COMPETITIVE ALGORITHM FOR ENGINEERING DESIGN PROBLEMS , 2010 .