Abstract
Gravitational search algorithm, a stochastic, nature-inspired algorithm, is designed on the basis of gravitational kinematics of physics. To promote an appropriate stability between exploration and exploitation and to diminish the weakness that was affecting the search to reach global optima, a new variant of GSA named as mutation-based chaotic gravitational search algorithm (MCGSA) is introduced in this work. This new variant of GSA consists of five mutation strategies. These five mutations are applied to the best solution in a successive manner. To justify the overall functioning of the proposed method, it has been evaluated on CEC2005 benchmark suit and has been compared with four other modified versions derived from original GSA, namely standard GSA (SGSA), chaotic-based GSA (CGSA), crossover-based GSA (CROGSA), and self-adaptive GSA (GGSA). The comprehensive result of MCGSA has outperformed other GSA variants.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Rakshit, P., Konar, A., Das, S.: Noisy evolutionary optimization algorithms—a comprehensive survey. Swarm Evol. Comput. 33, 18–45 (2017)
BoussaïD, I., Lepagnot, J., Siarry, P.: A survey on optimization metaheuristics. Inf. Sci. 237, 82–117 (2013)
Wolpert, D.H., Macready, W.G.: No free lunch theorems for optimization. IEEE Trans. Evol. Comput. 1(1), 67–82 (1997)
Rashedi, E., Nezamabadi-Pour, H., Saryazdi, S.: GSA: a gravitational search algorithm. Inf. Sci. 179(13), 2232–2248 (2009)
Kirillov, A.A., Turaev, D.: Modification of Newton’s law of gravity at very large distances. Phys. Lett. B 532(3–4), 185–192 (2002)
Rashedi, E., Nezamabadi-Pour, H., Saryazdi, S.: BGSA: binary gravitational search algorithm. Nat. Comput. 9(3), 727–745 (2010)
Sarafrazi, S., Nezamabadi-Pour, H., Saryazdi, S.: Disruption: a new operator in gravitational search algorithm. Sci. Iran. 18(3), 539–548 (2011)
Khajehzadeh, M., Taha, M.R., El-Shafie, A., Eslami, M.: A modified gravitational search algorithm for slope stability analysis. Eng. Appl. Artif. Intell. 25(8), 1589–1597 (2012)
Ji, J., Gao, S., Wang, S., Tang, Y., Yu, H., Todo, Y.: Self-adaptive gravitational search algorithm with a modified chaotic local search. IEEE Access 5, 17881–17895 (2017)
Mirjalili, S., Gandomi, A.H.: Chaotic gravitational constants for the gravitational search algorithm. Appl. Soft Comput. 53, 407–419 (2017)
Yin, B., Guo, Z., Liang, Z., Yue, X.: Improved gravitational search algorithm with crossover. Comput. Electr. Eng. 66, 505–516 (2018)
Suganthan, P.N., Hansen, N., Liang, J.J., Deb, K., Chen, Y.P., Auger, A., Tiwari, S.: Problem definitions and evaluation criteria for the CEC 2005 special session on real-parameter optimization. KanGAL Rep. 2005005, 2005 (2005)
Jordehi, A.R.: Enhanced leader PSO (ELPSO): a new PSO variant for solving global optimisation problems. Appl. Soft Comput. 26, 401–417 (2015)
Mirjalili, S., Lewis, A.: Adaptive gbest-guided gravitational search algorithm. Neural Comput. Appl. 25(7–8), 1569–1584 (2014)
Taradeh, M., Mafarja, M., Heidari, A.A., Faris, H., Aljarah, I., Mirjalili, S., Fujita, H.: An evolutionary gravitational search-based feature selection. Inf. Sci. 497, 219–239 (2019)
Cárdenas-Montes, M.: Weibull-based scaled-differences schema for differential evolution. Swarm Evol. Comput. 38, 79–93 (2018)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Mukherjee, M., Mitra, S., Acharyya, S. (2020). Mutation-Based Chaotic Gravitational Search Algorithm. In: Mandal, J., Mukhopadhyay, S. (eds) Proceedings of the Global AI Congress 2019. Advances in Intelligent Systems and Computing, vol 1112. Springer, Singapore. https://doi.org/10.1007/978-981-15-2188-1_10
Download citation
DOI: https://doi.org/10.1007/978-981-15-2188-1_10
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-15-2187-4
Online ISBN: 978-981-15-2188-1
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)