BGSA: binary gravitational search algorithm

Gravitational search algorithm is one of the new optimization algorithms that is based on the law of gravity and mass interactions. In this algorithm, the searcher agents are a collection of masses, and their interactions are based on the Newtonian laws of gravity and motion. In this article, a binary version of the algorithm is introduced. To evaluate the performances of the proposed algorithm, several experiments are performed. The experimental results confirm the efficiency of the BGSA in solving various nonlinear benchmark functions.

[1]  Konstantinos G. Margaritis,et al.  An Experimental Study of Benchmarking Functions for Genetic Algorithms , 2002, Int. J. Comput. Math..

[2]  Andries Petrus Engelbrecht,et al.  Fundamentals of Computational Swarm Intelligence , 2005 .

[3]  B. Schutz.  Gravity from the ground up , 2003 .

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

[5]  Tai-Hsi Wu,et al.  A simulated annealing algorithm for manufacturing cell formation problems , 2008, Expert Syst. Appl..

[6]  Jhareswar Maiti,et al.  Development of a hybrid methodology for dimensionality reduction in Mahalanobis-Taguchi system using Mahalanobis distance and binary particle swarm optimization , 2010, Expert Syst. Appl..

[7]  Sadiq M. Sait,et al.  Evolutionary algorithms, simulated annealing, and Tabu search: a comparative study , 1998, Optics & Photonics.

[8]  Michal Bereta,et al.  Comparing binary and real-valued coding in hybrid immune algorithm for feature selection and classification of ECG signals , 2007, Eng. Appl. Artif. Intell..

[9]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

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

[11]  Yung-ming Cheng,et al.  Performance studies on six heuristic global optimization methods in the location of critical slip surface , 2007 .

[12]  Yanbin Yuan,et al.  An improved binary particle swarm optimization for unit commitment problem , 2009, Expert Syst. Appl..

[13]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

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

[15]  Donald E. Grierson,et al.  Comparison among five evolutionary-based optimization algorithms , 2005, Adv. Eng. Informatics.

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

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

[18]  Alan S. Perelson,et al.  The immune system, adaptation, and machine learning , 1986 .

[19]  Jian Qin,et al.  A dynamic chain-like agent genetic algorithm for global numerical optimization and feature selection , 2009, Neurocomputing.

[20]  K. G. Srinivasa,et al.  A self-adaptive migration model genetic algorithm for data mining applications , 2007, Inf. Sci..

[21]  Xiangyang Wang,et al.  Feature selection based on rough sets and particle swarm optimization , 2007, Pattern Recognit. Lett..

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

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

[24]  Russell C. Eberhart,et al.  A discrete binary version of the particle swarm algorithm , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.

[25]  Li-Yeh Chuang,et al.  Improved binary PSO for feature selection using gene expression data , 2008, Comput. Biol. Chem..

[26]  WangLiang,et al.  An improved binary particle swarm optimization for unit commitment problem , 2009 .