Imperialist Competitive Algorithm Using Chaos Theory for Optimization (CICA)

The Imperialist Competitive Algorithm (ICA) that was recently introduced has shown its good performance in optimization problems. This novel optimization algorithm is inspired by socio-political process of imperialistic competition in the real world. In this paper a new Imperialist Competitive Algorithm using chaotic maps (CICA) is proposed. In the proposed algorithm, the chaotic maps are used to adapt the angle of colonies movement towards imperialist’s position to enhance the escaping capability from a local optima trap. The ICA is easily stuck into a local optimum when solving high-dimensional multi-model numerical optimization problems. To overcome this shortcoming, we use four different chaotic map incorporated into ICA to enhance the exploration capability. Some famous unconstraint benchmark functions are used to test the CICA performance. Simulation results show this variant can improve the performance significantly

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

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

[3]  Yuhui Qiu,et al.  A new adaptive well-chosen inertia weight strategy to automatically harmonize global and local search ability in particle swarm optimization , 2006, 2006 1st International Symposium on Systems and Control in Aerospace and Astronautics.

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

[5]  Jiangye Yuan,et al.  A modified particle swarm optimizer with dynamic adaptation , 2007, Appl. Math. Comput..

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

[7]  Kazuyuki Aihara,et al.  Adaptive annealing for chaotic optimization , 1996 .

[8]  M. F. Cardoso,et al.  A simulated annealing approach to the solution of minlp problems , 1997 .

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

[10]  H. Schuster.  Deterministic chaos: An introduction (2nd revised edition) , 1988 .

[11]  Marcel Bergerman,et al.  Cultural algorithms: concepts and experiments , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

[12]  Hartmut Jürgens,et al.  Chaos and Fractals: New Frontiers of Science , 1992 .

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

[14]  Jin Xu,et al.  Path Planning for Mobile Robot Based on Chaos Genetic Algorithm , 2008, 2008 Fourth International Conference on Natural Computation.

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

[16]  Lester Ingber,et al.  Simulated annealing: Practice versus theory , 1993 .

[17]  Robert M. May,et al.  Simple mathematical models with very complicated dynamics , 1976, Nature.

[18]  H. Schuster.  Deterministic chaos: An introduction , 1984 .

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

[20]  R. Reynolds,et al.  Using knowledge-based evolutionary computation to solve nonlinear constraint optimization problems: a cultural algorithm approach , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[21]  Chen Bing-rui,et al.  Self-Adapting Chaos-Genetic Hybrid Algorithm with Mixed Congruential Method , 2008, 2008 Fourth International Conference on Natural Computation.