Comparison of optimization methods based on GSA

Year 2017, Special Issue (2017), 47 - 50, 24.09.2017

Nihan Kazak , Nesibe Yalçın , Ali Erdem Çerçevik

Abstract

In recent years, many heuristic evolutionary optimization algorithms have been developed. Gravitational search algorithm (GSA) is one of these algorithms. It is inspired by Newton’s law of universal gravitation. In this paper, we compare two modified algorithms based on GSA. One of the algorithms is called Member-Satellite algorithm. Members are randomly positioned in the search space and a certain amount of satellites are assigned around the members in the predetermined region. Members and their satellites are used to find a near optimal solution all together. The second one is MSS-GSA. When interconnected objects are used, it is possible to obtain a solution closer to the optimum point. For this reason mass spring system is integrated into the GSA. Three benchmark functions are used to compare performance. Experimental results show that the highest performance is obtained with Member-Satellite algorithm.

Keywords

gravitational search algorithm , heuristic algorithm , optimization , swarm intelligence

References

• E. Rashedi, H. Nezamabadi, and S. Saryazdi, “GSA: A Gravitational Search Algorithm”, Information Sciences, 179(13): 2232–2248 (2009).
• N. M. Sabri, P. Mazidah, and R. M. Mohamad, “A review of gravitational search algorithm.” Int. J. Advance. Soft Comput. Appl 5.3 (2013): 1-39.
• S. Zhang, C. Li, J. Zhou, “Parameters identification of hydraulic turbine governing system using improved gravitational search algorithm”, Energy Convers Manage, 52 (2011), pp. 374–381.
• B. Zibanezhad, K. Zamanifar, N. Nematbakhsh, and F. Mardukhi, “An approach for web services composition based on QoS and gravitational search algorithm.” In Proceedings of the innovations in information technology conference, 2010. p 340–344.
• H. R. Hassanzadeh, and M. Rouhani, “A multi-objective gravitational search algorithm.” In: Proceedings of the communication systems and network conference, 2010. p. 7–12.
• S.R. Balachandar, K. Kannan. “A meta-heuristic algorithm for set covering problem based on gravity”, Int J Comput Math Sci, 4 (2010), pp. 223–228.
• S. Duman, U. Güvenç, N. Yörükeren, “Gravitational search algorithm for economic dispatch with valve-point effects”, Int Rev Electr Eng, 5 (6) (2010), pp. 2890–2895.
• E. Rashedi, H. Nezamabadi-pour and S. Saryazdi, “BGSA: Binary gravitational search algorithm”, Nat. Comput. 9 (2010) 727–745.
• R.-E. Precup, R.-C. David, E. M. Petriu, S. Preitl and M.-B. Radac, “Novel adaptive gravitational search algorithm for fuzzy controlled servo systems”, IEEE Trans. Ind. Inf. 8(4) (2012) 791–800
• M. B. Dowlatshahi, H. Nezamabadi-pour and M. Mashinchi, “A discrete gravitational search algorithm for solving combinatorial optimization problems”, Inf. Sci. 258 (2014) 94–107.
• X.-H. Han, X.-M. Chang, L. Quan, X.-Y. Xiong, J.-X. Li, Z.-X. Zhang and Y. Liu, “Feature subset selection by gravitational search algorithm optimization”, Inf. Sci. 281 (2014) 128–146.
• Kazak N. and Duysak A., “Modified Gravitational Search Algorithm.”, International Symposium on Innovations in Intelligent Systems and Applications (INISTA), 2012, pp.1-4
• Kazak N. and Duysak A., “Geliştirilmiş Yerçekimsel Arama Algoritması: MSS-GSA”, 3rd. International Symposium on Innovative Technologies in Engineering and Science (ISITES), 2015.