GSA: A gravitational search algorithm. (English) Zbl 1177.90378

Summary: In recent years, various heuristic optimization methods have been developed. Many of these methods are inspired by swarm behaviors in nature. In this paper, a new optimization algorithm based on the law of gravity and mass interactions is introduced. In the proposed algorithm, the searcher agents are a collection of masses which interact with each other based on the Newtonian gravity and the laws of motion. The proposed method has been compared with some well-known heuristic search methods. The obtained results confirm the high performance of the proposed method in solving various nonlinear functions.


90C30 Nonlinear programming
90C59 Approximation methods and heuristics in mathematical programming
68T20 Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
68P10 Searching and sorting
68W05 Nonnumerical algorithms


law of gravity


Full Text: DOI


[1] Badr, A.; Fahmy, A., A proof of convergence for ant algorithms, Information Sciences, 160, 267-279 (2004) · Zbl 1076.68070
[2] Baojiang, Z.; Shiyong, L., Ant colony optimization algorithm and its application to neuro-fuzzy controller design, Journal of Systems Engineering and Electronics, 18, 603-610 (2007) · Zbl 1248.93106
[3] Bergh, F. V.D.; Engelbrecht, A. P., A study of particle swarm optimization particle trajectories, Information Sciences, 176, 937-971 (2006) · Zbl 1093.68105
[4] Cordon, O.; Damas, S.; Santamarı, J., A fast and accurate approach for 3D image registration using the scatter search evolutionary algorithm, Pattern Recognition Letters, 27, 1191-1200 (2006)
[5] Dorigo, M.; Maniezzo, V.; Colorni, A., The ant system: optimization by a colony of cooperating agents, IEEE Transactions on Systems, Man, and Cybernetics - Part B, 26, 1, 29-41 (1996)
[6] Du, W.; Li, B., Multi-strategy ensemble particle swarm optimization for dynamic optimization, Information Sciences, 178, 3096-3109 (2008) · Zbl 1283.90047
[7] Ellabib, I.; Calamai, P.; Basir, O., Exchange strategies for multiple ant colony system, Information Sciences, 177, 1248-1264 (2007)
[8] Farmer, J. D.; Packard, N. H.; Perelson, A. S., The immune system, adaptation and machine learning, Physica D, 2, 187-204 (1986)
[9] Formato, R. A., Central force optimization: a new metaheuristic with applications in applied electromagnetics, Progress in Electromagnetics Research, 77, 425-491 (2007)
[10] Formato, R. A., Central force optimization: a new nature inspired computational framework for multidimensional search and optimization, Studies in Computational Intelligence, 129, 221-238 (2008)
[11] Gazi, V.; Passino, K. M., Stability analysis of social foraging swarms, IEEE Transactions on Systems, Man, and Cybernetics - Part B, 34, 1, 539-557 (2004)
[12] Hamzaçebi, C., Improving genetic algorithms’ performance by local search for continuous function optimization, Applied Mathematics and Computation, 196, 1, 309-317 (2008) · Zbl 1133.65031
[13] Haupt, R. L.; Haupt, E., Practical Genetic Algorithms (2004), John Wiley & Sons · Zbl 1072.68089
[14] Holliday, D.; Resnick, R.; Walker, J., Fundamentals of physics (1993), John Wiley and Sons
[15] Kalinlia, A.; Karabogab, N., Artificial immune algorithm for IIR filter design, Engineering Applications of Artificial Intelligence, 18, 919-929 (2005)
[16] Karakuzu, C., Fuzzy controller training using particle swarm optimization for nonlinear system control, ISA Transactions, 47, 2, 229-239 (2008)
[18] Kenyon, I. R., General Relativity (1990), Oxford University Press
[19] Kim, D. H.; Abraham, A.; Cho, J. H., A hybrid genetic algorithm and bacterial foraging approach for global optimization, Information Sciences, 177, 3918-3937 (2007)
[20] Kim, T. H.; Maruta, I.; Sugie, T., Robust PID controller tuning based on the constrained particle swarm optimization, Automatica, 44, 1104-1110 (2008) · Zbl 1283.93100
[21] Kirkpatrick, S.; Gelatto, C. D.; Vecchi, M. P., Optimization by simulated annealing, Science, 220, 671-680 (1983) · Zbl 1225.90162
[23] Lin, Y. L.; Chang, W. D.; Hsieh, J. G., A particle swarm optimization approach to nonlinear rational filter modeling, Expert Systems with Applications, 34, 1194-1199 (2008)
[24] Liu, Y.; Yi, Z.; Wu, H.; Ye, M.; Chen, K., A tabu search approach for the minimum sum-of-squares clustering problem, Information Sciences, 178, 2680-2704 (2008) · Zbl 1183.68541
[25] Lozano, M.; Herrera, F.; Cano, J. R., Replacement strategies to preserve useful diversity in steady-state genetic algorithms, Information Sciences, 178, 4421-4433 (2008)
[26] Mansouri, R.; Nasseri, F.; Khorrami, M., Effective time variation of G in a model universe with variable space dimension, Physics Letters, 259, 194-200 (1999)
[27] Nezamabadi-pour, H.; Saryazdi, S.; Rashedi, E., Edge detection using ant algorithms, Soft Computing, 10, 623-628 (2006)
[30] Schutz, B., Gravity from the Ground Up (2003), Cambridge University Press
[31] Tan, X.; Bhanu, B., Fingerprint matching by genetic algorithms, Pattern Recognition, 39, 465-477 (2006) · Zbl 1158.68479
[32] Tang, K. S.; Man, K. F.; Kwong, S.; He, Q., Genetic algorithms and their applications, IEEE Signal Processing Magazine, 13, 6, 22-37 (1996)
[33] Tarasewich, P.; McMullen, P. R., Swarm intelligence: power in numbers, Communication of ACM, 45, 62-67 (2002)
[34] Tripathi, P. K.; Bandyopadhyay, S.; Pal, S. K., Multi-objective particle swarm optimization with time variant inertia and acceleration coefficients, Information Sciences, 177, 5033-5049 (2007) · Zbl 1121.90130
[35] Wolpert, D. H.; Macready, W. G., No free lunch theorems for optimization, IEEE Transactions on Evolutionary Computation, 1, 67-82 (1997)
[36] Yao, X.; Liu, Y.; Lin, G., Evolutionary programming made faster, IEEE Transactions on Evolutionary Computation, 3, 82-102 (1999)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.