Social Spider and the Prey Search Method for Global Optimization in Hyper Dimensional Search Space

• Published in: Informatics and Intelligent Applications Vol. 1547; pp. 214 - 226
• Main Authors: Frimpong, Samuel Ofori, Millham, Richard C., Agbehadji, Israel Edem, Jung, Jason J.
• Format: Book Chapter
• Language: English
• Published: Switzerland Springer International Publishing AG 2022; Springer International Publishing
• Series: Communications in Computer and Information Science
• Subjects: Hyper dimensional search space; Optimization; Swarm intelligence
• ISBN: 3030956296; 9783030956295
• ISSN: 1865-0929; 1865-0937
• DOI: 10.1007/978-3-030-95630-1_15

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.