Abstract
Finding an efficient search strategy to solving complex or difficult problems has been a subject of interest across multiple disciplines particularly in computer science and engineering. In recent times, the applications of metaheuristic algorithms based on evolutionary computation and swarm-based intelligence have demonstrated outstanding performances in search for global optimal solution for any optimization problem. A metaheuristic search algorithm applied in hyper dimensional search space, to find a global optimal solution do not specifically require information about the nature and complexity of the problem because of ease of adapting to some maximum or minimal parameters/constraints of the problem space. In this paper, we present an enhancement to the relatively new developed algorithm called social spider prey (SSP) algorithm for global optimization problem. This algorithm mimics the foraging behavior of social spiders in capturing prey(s) on the social web. The weight of a prey which stimulates the spider’s web and cause vibration is depicted and modelled in SSP to enhance the searching strategy of the algorithm particularly, in a hyperdimensional search space. Thus, for improved global optimization algorithm such as SSP to stand the test of time, it is imperative to have it tested on proven benchmarked test functions which is achieved in this paper. A computational experiment was carried out to ascertain the performance of SSP in dealing with complex optimization problems, and the results were discussed. SSP demonstrated outstanding global optimization performance as shown in all the results in all the test functions converging nearly at the global optimum value 0. This study shows the prospects of this relatively new SSP algorithm to solving complex optimization problems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Barbosa, C.E.M., Vasconcelos, G.C.: Eight bio-inspired algorithms evaluated for solving optimization problems. In: Rutkowski, L., Scherer, R., Korytkowski, M., Pedrycz, W., Tadeusiewicz, R., Zurada, J.M. (eds.) ICAISC 2018. LNCS (LNAI), vol. 10841, pp. 290–301. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-91253-0_28
Talbi, E.-G.: Metaheuristics: From Design to Implementation. John Wiley & Sons Inc., New York (2009)
Frimpong, S.O.: Nature-Inspired Search Method for Cost Optimization of Hybrid Renewable Energy Generation at the Edge (2020)
Agbehadji, I.E., Millham, R., Fong, S.: Kestrel-based search algorithm for association rule mining and classification of frequently changed items. In: Proceedings - 2016 8th International Conference Computing Intelligence Communication Networks, CICN 2016, pp. 356–360 (2017). https://doi.org/10.1109/CICN.2016.76
Yu, J.J.Q., Li, V.O.K.: A social spider algorithm for global optimization, February 2015. https://doi.org/10.1016/j.asoc.2015.02.014
Yang, X.-S., Karamanoglu, M.: Swarm intelligence and bio-inspired computation theory and applications (2013)
Akay, B.: A study on particle swarm optimization and artificial bee colony algorithms for multilevel thresholding. Appl. Soft Comput. J. 13(6), 3066–3091 (2013). https://doi.org/10.1016/j.asoc.2012.03.072
Socha, K., Dorigo, M.: Ant colony optimization for continuous domains. Eur. J. Oper. Res. 185, 1155–1173 (2008). https://doi.org/10.1016/j.ejor.2006.06.046
Nguyen, T., Nguyen, L.V., Jung, J.J., Agbehadji, I.E.: Bio-Inspired Approaches for Smart Energy Management : State of the Art and Challenges, pp. 1–24 (2020). https://doi.org/10.3390/su12208495
Wolpert, D.H., Macready, W.G.: No free lunch theorems for optimization. IEEE Trans. Evol. Comput. 1(1), 67–82 (1997). https://doi.org/10.1109/4235.585893
Kalananda, V.K.R.A., Komanapalli, V.L.N.: Nature-inspired optimization algorithms for renewable energy generation, distribution and management — a comprehensive review, pp. 139–226 (2021)
Castillo, M., et al.: An autonomous galactic swarm optimization algorithm supported by hidden markov model. In: Abraham, A., et al. (eds.) SoCPaR 2020. AISC, vol. 1383, pp. 354–363. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-73689-7_34
Manoharan, P.S., Jeyadheep Vignesh, J., Varatharajan, M., Rubina Sherin, M., et al.: Spider search algorithms for MIMO system and assessment using Simatic PCS7. Teh. Vjesn. 28(4), 1118–1126 (2021)
Omkar, S.N., Senthilnath, J., Khandelwal, R., Naik, G.N., Gopalakrishnan, S.: Artificial Bee Colony (ABC) for multi-objective design optimization of composite structures. Appl. Soft Comput. 11, 489–499 (2011). https://doi.org/10.1016/j.asoc.2009.12.008
Jamil, M., Yang, X.S.: A literature survey of benchmark functions for global optimisation problems. Int. J. Math. Model. Numer. Optim. 4(2), 150–194 (2013). https://doi.org/10.1504/IJMMNO.2013.055204
Li, X., Tang, K., Omidvar, M.N., Yang, Z., Qin, K.: Benchmark Functions for the CEC’ 2013 Special Session and Competition on Large-Scale Global Optimization, pp. 1–23 (2013)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 Springer Nature Switzerland AG
About this paper
Cite this paper
Frimpong, S.O., Millham, R.C., Agbehadji, I.E., Jung, J.J. (2022). Social Spider and the Prey Search Method for Global Optimization in Hyper Dimensional Search Space. In: Misra, S., Oluranti, J., Damaševičius, R., Maskeliunas, R. (eds) Informatics and Intelligent Applications. ICIIA 2021. Communications in Computer and Information Science, vol 1547. Springer, Cham. https://doi.org/10.1007/978-3-030-95630-1_15
Download citation
DOI: https://doi.org/10.1007/978-3-030-95630-1_15
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-95629-5
Online ISBN: 978-3-030-95630-1
eBook Packages: Computer ScienceComputer Science (R0)