QCA & CQCA: Quad Countries Algorithm and Chaotic Quad Countries Algorithm

This paper introduces an improved evolutionary algorithm based on the Imperialist Com- petitive Algorithm (ICA), called Quad Countries Algorithm (QCA) and with a little change called Chaotic Quad Countries Algorithm (CQCA). The Imperialist Competitive Algorithm is inspired by socio-political process of imperialistic competition in the real world and has shown its reliable performance in optimization problems. This algorithm converges quickly, but is easily stuck into a local optimum while solving high-dimensional optimization prob- lems. In the ICA, the countries are classified into two groups: Imperialists and Colonies which Imperialists absorb Colonies, while in the proposed algorithm two other kinds of countries, namely Independent and Seeking Independence countries, are added to the coun- tries collection which helps to more exploration. In the suggested algorithm, Seeking Inde- pendence countries move in a contrary direction to the Imperialists and Independent countries move arbitrarily that in this paper two different movements are considered for this group; random movement (QCA) and Chaotic movement (CQCA). On the other hand, in the ICA the Imperialists' positions are fixed, while in the proposed algorithm, Imperial- ists will move if they can reach a better position compared to the previous position. The proposed algorithm was tested by famous benchmarks and the compared results of the QCA and CQCA with results of ICA, Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Particle Swarm inspired Evolutionary Algorithm (PS-EA) and Artificial Bee Colony (ABC) show that the QCA has better performance than all mentioned algorithms. Between all cases, the QCA, ABC and PSO have better performance respectively about 50%, 41.66% and 8.33% of cases.

[1]  Roderick J A Little,et al.  A Review of Hot Deck Imputation for Survey Non‐response , 2010, International statistical review = Revue internationale de statistique.

[2]  Dervis Karaboga,et al.  A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm , 2007, J. Glob. Optim..

[3]  J. Bortz,et al.  Forschungsmethoden und Evaluation für Human- und Sozialwissenschaftler , 2006 .

[4]  Karim Faez,et al.  Imperialist Competitive Algorithm Using Chaos Theory for Optimization (CICA) , 2010, 2010 12th International Conference on Computer Modelling and Simulation.

[5]  Wei-Mou Zheng,et al.  KNEADING PLANE OF THE CIRCLE MAP , 1994 .

[6]  Mark Woodward,et al.  Imputations of missing values in practice: results from imputations of serum cholesterol in 28 cohort studies. , 2004, American journal of epidemiology.

[7]  Eric Schulte Nordholt Imputation: Methods, Simulation Experiments and Practical Examples , 1998 .

[8]  Heinz Mühlenbein,et al.  The parallel genetic algorithm as function optimizer , 1991, Parallel Comput..

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

[10]  Shahriar Lotfi,et al.  Quad Countries Algorithm (QCA) , 2012, ACIIDS.

[11]  G. Kalton,et al.  Handling missing data in survey research , 1996, Statistical methods in medical research.

[12]  Gabriele B. Durrant Imputation methods for handling item‐nonresponse in practice: methodological issues and recent debates , 2009 .

[13]  Jae-On Kim,et al.  The Treatment of Missing Data in Multivariate Analysis , 1977 .

[14]  Melanie Mitchell,et al.  An introduction to genetic algorithms , 1996 .

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

[16]  Karim Faez,et al.  Adaptive Imperialist Competitive Algorithm (AICA) , 2010, 9th IEEE International Conference on Cognitive Informatics (ICCI'10).

[17]  Yong Wang,et al.  Improved Imperialist Competitive Algorithm for Constrained Optimization , 2009, 2009 International Forum on Computer Science-Technology and Applications.

[18]  Fred S. Switzer,et al.  A Monte Carlo Analysis of Missing Data Techniques in a HRM Setting , 1995 .

[19]  Caro Lucas,et al.  Colonial competitive algorithm: A novel approach for PID controller design in MIMO distillation column process , 2008, Int. J. Intell. Comput. Cybern..

[20]  J. Kaiser The Effectiveness of Hot-deck Procedures in Small Samples. , 1983 .

[21]  Khaled El Emam,et al.  Software Cost Estimation with Incomplete Data , 2001, IEEE Trans. Software Eng..

[22]  Roderick J. A. Little,et al.  Statistical Analysis with Missing Data , 1988 .

[23]  Dipti Srinivasan,et al.  Particle Swarm Inspired Evolutionary Algorithm (PS-EA) for Multi-Criteria Optimization Problems , 2003, Evolutionary Multiobjective Optimization.

[24]  P. Roth,et al.  Missing Data in Multiple Item Scales: A Monte Carlo Analysis of Missing Data Techniques , 1999 .

[25]  G. Kalton,et al.  The treatment of missing survey data , 1986 .

[26]  Haralambos Sarimveis,et al.  A line up evolutionary algorithm for solving nonlinear constrained optimization problems , 2005, Comput. Oper. Res..

[27]  Dorothea Heiss-Czedik,et al.  An Introduction to Genetic Algorithms. , 1997, Artificial Life.

[28]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[29]  Thomas R Belin,et al.  Multiple imputation using an iterative hot‐deck with distance‐based donor selection , 2008, Statistics in medicine.