Gravitational search algorithm combined with chaos for unconstrained numerical optimization

Gravitational search algorithm (GSA) is the one of the newest developed nature-inspired heuristics for optimization problem. It is designed based on the Newtonian gravity and has shown excellent search abilities when applying it to optimization problems. Nevertheless, GSA still has some disadvantages such as slow convergence speed and local optima trapping problems. To alleviate these inherent drawbacks and enhance the performance of GSA, chaos, which is of ergodicity and stochasticity, is incorporated into GSA by two kinds of methods. One method uses chaos to generate chaotic sequences to substitute random sequences, while another one uses chaos to act as a local search approach. The resultant hybrid algorithms, called chaotic gravitation search algorithms (CGSA1 and CGSA2), thus reasonably have advantages of both GSA and chaos. Eight widely used benchmark numerical optimization problems are chosen from the literature as the test suit. Experimental results demonstrate that both CGSA1 and CGSA2 perform better than GSA and other five chaotic particle swarm optimization.

[1]  Peter Norvig,et al.  Artificial Intelligence: A Modern Approach , 1995 .

[2]  Humberto Bustince,et al.  A gravitational approach to edge detection based on triangular norms , 2010, Pattern Recognit..

[3]  Christian Blum,et al.  Ant colony optimization: Introduction and recent trends , 2005 .

[4]  R. Eberhart,et al.  Fuzzy adaptive particle swarm optimization , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[5]  Jeong Yun Won,et al.  AN IMPROVED PARTICLE SWARM OPTIMIZATION FOR ECONOMIC DISPATCH WITH VALVE-POINT EFFECT , 2006 .

[6]  Hossein Nezamabadi-pour,et al.  GSA: A Gravitational Search Algorithm , 2009, Inf. Sci..

[7]  Kwok-Wo Wong,et al.  An improved particle swarm optimization algorithm combined with piecewise linear chaotic map , 2007, Appl. Math. Comput..

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

[9]  Shangxu Hu,et al.  A New Approach to Improve Particle Swarm Optimization , 2003, GECCO.

[10]  Kathryn A. Dowsland,et al.  Simulated Annealing , 1989, Handbook of Natural Computing.

[11]  Huanwen Tang,et al.  Application of chaos in simulated annealing , 2004 .

[12]  S. Balachandar,et al.  A Meta-Heuristic Algorithm for Vertex Covering Problem Based on Gravity , 2010 .

[13]  Jiang Chuanwen,et al.  A hybrid method of chaotic particle swarm optimization and linear interior for reactive power optimisation , 2005, Math. Comput. Simul..

[14]  Yongling Zheng,et al.  On the convergence analysis and parameter selection in particle swarm optimization , 2003, Proceedings of the 2003 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.03EX693).

[15]  Jianzhong Zhou,et al.  Parameters identification of hydraulic turbine governing system using improved gravitational search algorithm , 2011 .

[16]  Ying-Cheng Lai,et al.  Controlling chaos , 1994 .

[17]  Li Shaoqian,et al.  Chaotic spreading sequences with multiple access performance better than random sequences , 2000 .

[18]  Russell C. Eberhart,et al.  Tracking and optimizing dynamic systems with particle swarms , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[19]  B. Alatas,et al.  Chaos embedded particle swarm optimization algorithms , 2009 .

[20]  David H. Wolpert,et al.  No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..

[21]  Xingsheng Gu,et al.  A dynamic inertia weight particle swarm optimization algorithm , 2008 .

[22]  Russell C. Eberhart,et al.  Parameter Selection in Particle Swarm Optimization , 1998, Evolutionary Programming.

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

[24]  Ettore Francesco Bompard,et al.  A self-adaptive chaotic particle swarm algorithm for short term hydroelectric system scheduling in deregulated environment , 2005 .

[25]  Yang Wei-min.  A Hybrid Particle Swarm Algorithm with Embedded Chaotic Search , 2006 .

[26]  Jan Karel Lenstra,et al.  A decade of combinatorial optimization , 1997 .

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

[28]  Liyan Zhang,et al.  Empirical study of particle swarm optimizer with an increasing inertia weight , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[29]  Edward Ott,et al.  Controlling chaos , 2006, Scholarpedia.

[30]  Bilal Alatas,et al.  Chaotic harmony search algorithms , 2010, Appl. Math. Comput..

[31]  Hossein Nezamabadi-pour,et al.  BGSA: binary gravitational search algorithm , 2010, Natural Computing.

[32]  Bilal Alatas,et al.  Chaotic bee colony algorithms for global numerical optimization , 2010, Expert Syst. Appl..

[33]  Marco Dorigo,et al.  Ant colony optimization , 2006, IEEE Computational Intelligence Magazine.

[34]  Ioan Cristian Trelea,et al.  The particle swarm optimization algorithm: convergence analysis and parameter selection , 2003, Inf. Process. Lett..

[35]  Kevin M. Passino,et al.  Biomimicry of bacterial foraging for distributed optimization and control , 2002 .

[36]  Qiaoyan Wen,et al.  Hybrid chaotic ant swarm optimization , 2009 .

[37]  Bing Li,et al.  Optimizing Complex Functions by Chaos Search , 1998, Cybern. Syst..

[38]  F. Mardukhi,et al.  An approach for web services composition based on QoS and gravitational search algorithm , 2009, 2009 International Conference on Innovations in Information Technology (IIT).

[39]  Mauricio G. C. Resende,et al.  Hybrid GRASP Heuristics , 2009, Foundations of Computational Intelligence.

[40]  Chang-song Zhou,et al.  Chaotic annealing for optimization , 1997 .