Abstract
The gravitational search algorithm (GSA) has proven to be a good optimization algorithm to solve various optimization problems. However, due to the lack of exploration capability, it often traps into local optima when dealing with complex problems. Hence its convergence speed will slow down. A clustering-based learning strategy (CLS) has been applied to GSA to alleviate this situation, which is called galactic gravitational search algorithm (GGSA). The CLS firstly divides the GSA into multiple clusters, and then it applies several learning strategies in each cluster and among clusters separately. By using this method, the main weakness of GSA that easily trapping into local optima can be effectively alleviated. The experimental results confirm the superior performance of GGSA in terms of solution quality and convergence in comparison with GSA and other algorithms.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Cai, Y., Wang, J., Yin, J.: Learning-enhanced differential evolution for numerical optimization. Soft Comput. 16(2), 303–330 (2012)
Derrac, J., GarcÃa, S., Molina, D., Herrera, F.: A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evol. Comput. 1(1), 3–18 (2011)
Gao, S., Song, S., Cheng, J., Todo, Y., Zhou, M.: Incorporation of solvent effect into multi-objective evolutionary algorithm for improved protein structure prediction. IEEE/ACM Trans. Comput. Biol. Bioinf. (2017). https://doi.org/10.1109/TCBB.2017.2705094
Gao, S., Todo, Y., Gong, T., Yang, G., Tang, Z.: Graph planarization problem optimization based on triple-valued gravitational search algorithm. IEEJ Trans. Electr. Electron. Eng. 9(1), 39–48 (2014)
Gao, S., Vairappan, C., Wang, Y., Cao, Q., Tang, Z.: Gravitational search algorithm combined with chaos for unconstrained numerical optimization. Appl. Math. Comput. 231, 48–62 (2014)
Gao, S., Wang, Y., Wang, J., Cheng, J.: Understanding differential evolution: a Poisson law derived from population interaction network. J. Comput. Sci. 21, 140–149 (2017)
Hartigan, J.A., Wong, M.A.: Algorithm as 136: a k-means clustering algorithm. J. R. Stat. Soc. Ser. C (Appl. Stat.) 28(1), 100–108 (1979)
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)
Kanungo, T., Mount, D.M., Netanyahu, N.S., Piatko, C.D., Silverman, R., Wu, A.Y.: An efficient k-means clustering algorithm: analysis and implementation. IEEE Trans. Pattern Anal. Mach. Intell. 24(7), 881–892 (2002)
Mirjalili, S., Lewis, A.: The Whale optimization algorithm. Adv. Eng. Softw. 95, 51–67 (2016)
Rashedi, E., Nezamabadi-Pour, H., Saryazdi, S.: GSA: a gravitational search algorithm. Inf. Sci. 179(13), 2232–2248 (2009)
Song, Z., Gao, S., Yu, Y., Sun, J., Todo, Y.: Multiple chaos embedded gravitational search algorithm. IEICE Trans. Inf. Syst. 100(4), 888–900 (2017)
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 report 2005005 (2005)
Wang, Y., Gao, S., Yu, Y., Xu, Z.: The discovery of population interaction with a power law distribution in brain storm optimization. Memetic Comput. (2017). https://doi.org/10.1007/s12293-017-0248-z
Yang, X.S.: Nature-Inspired Optimization Algorithms. Elsevier, Amsterdam (2014)
Yao, X., Liu, Y., Lin, G.: Evolutionary programming made faster. IEEE Trans. Evol. Comput. 3(2), 82–102 (1999)
Yu, H., Xu, Z., Gao, S., Wang, Y., Todo, Y.: PMPSO: a near-optimal graph planarization algorithm using probability model based particle swarm optimization. In: IEEE International Conference on Progress in Informatics and Computing (PIC), pp. 15–19. IEEE (2015)
Yu, Y., Gao, S., Cheng, S., Wang, Y., Song, S., Yuan, F.: CBSO: a memetic brain storm optimization with chaotic local search. Memetic Comput. (2017). https://doi.org/10.1007/s12293-017-0247-0
Acknowledgment
This research was partially supported by Taizhou Science and Technology Support Social Development Project (Guidance) under No. 201701 and JSPS KAKENHI Grant Number 17K12751, 15K00332 (Japan).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Li, S., Yuan, F., Yu, Y., Ji, J., Todo, Y., Gao, S. (2018). Galactic Gravitational Search Algorithm for Numerical Optimization. In: Tan, Y., Shi, Y., Tang, Q. (eds) Advances in Swarm Intelligence. ICSI 2018. Lecture Notes in Computer Science(), vol 10941. Springer, Cham. https://doi.org/10.1007/978-3-319-93815-8_38
Download citation
DOI: https://doi.org/10.1007/978-3-319-93815-8_38
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-93814-1
Online ISBN: 978-3-319-93815-8
eBook Packages: Computer ScienceComputer Science (R0)