Artificial Movements Inspired for Global Optimization

Abstract A new algorithm is proposed in this study for continuous problem optimization. The algorithm implements artificial movements move off and move forward , which mimics the soccer player's movement during a game. Both movements incorporate the social learning as well as cognitive learning. The performance of the proposed method was compared to those of the genetic algorithm and the particle swarm optimization. The proposed method outperforms the PSO on multi-modal functions and unimodal functions with high dimensionality. The method also shows better performance than the genetic algorithm on most of the problems used in the experiment. The experiment results reveal that the proposed method is potentially a powerful optimization technique.

[1]  Kumar Chellapilla,et al.  Combining mutation operators in evolutionary programming , 1998, IEEE Trans. Evol. Comput..

[2]  El-Ghazali Talbi,et al.  Metaheuristics - From Design to Implementation , 2009 .

[3]  Maurice Clerc,et al.  The particle swarm - explosion, stability, and convergence in a multidimensional complex space , 2002, IEEE Trans. Evol. Comput..

[4]  Hans-Paul Schwefel,et al.  Evolution strategies – A comprehensive introduction , 2002, Natural Computing.

[5]  P. N. Suganthan,et al.  Differential Evolution Algorithm With Strategy Adaptation for Global Numerical Optimization , 2009, IEEE Transactions on Evolutionary Computation.

[6]  Kusum Deep,et al.  A new crossover operator for real coded genetic algorithms , 2007, Appl. Math. Comput..

[7]  Xiao-Shan Gao,et al.  Evolutionary programming based on non-uniform mutation , 2007, Appl. Math. Comput..

[8]  Tung-Kuan Liu,et al.  Hybrid Taguchi-genetic algorithm for global numerical optimization , 2004, IEEE Transactions on Evolutionary Computation.

[9]  Kusum Deep,et al.  A new mutation operator for real coded genetic algorithms , 2007, Appl. Math. Comput..

[10]  René Thomsen,et al.  A comparative study of differential evolution, particle swarm optimization, and evolutionary algorithms on numerical benchmark problems , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[11]  Xin Yao,et al.  Evolutionary programming made faster , 1999, IEEE Trans. Evol. Comput..

[12]  J R Saunders,et al.  A particle swarm optimizer with passive congregation. , 2004, Bio Systems.

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

[14]  Michael de la Maza,et al.  Book review: Genetic Algorithms + Data Structures = Evolution Programs by Zbigniew Michalewicz (Springer-Verlag, 1992) , 1993 .

[15]  G. Di Caro,et al.  Ant colony optimization: a new meta-heuristic , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[16]  K. Lee,et al.  A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice , 2005 .

[17]  Alden H. Wright,et al.  Genetic Algorithms for Real Parameter Optimization , 1990, FOGA.

[18]  Janez Brest,et al.  Self-Adapting Control Parameters in Differential Evolution: A Comparative Study on Numerical Benchmark Problems , 2006, IEEE Transactions on Evolutionary Computation.

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

[20]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

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

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