An adaptive bio-inspired optimisation model based on the foraging behaviour of a social spider

Existing bio-inspired models are challenged with premature convergence among others. In this paper, an adaptive social spider colony optimisation model based on the foraging behaviour of social spider was proposed as an optimisation problem. The algorithm mimics the prey capture behaviour of the soc...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Samera Uga Otor, Bodunde Odunola Akinyemi, Temitope Adegboye Aladesanmi, Ganiyu Adesola Aderounmu, B.H. Kamagaté
Formato: article
Lenguaje:EN
Publicado: Taylor & Francis Group 2019
Materias:
Acceso en línea:https://doaj.org/article/e754879ebee242f98a87048ddbf9e724
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
Descripción
Sumario:Existing bio-inspired models are challenged with premature convergence among others. In this paper, an adaptive social spider colony optimisation model based on the foraging behaviour of social spider was proposed as an optimisation problem. The algorithm mimics the prey capture behaviour of the social spider in which, the spider senses the presence of the prey through vibrations transmitted along the web thread. Spiders are the search agents while the web is the search space of the optimisation problem. The natural or biological phenomenon of vibration was modeled using wave theory while optimisation theory was considered in optimizing the objective function of the optimisation problem. This objective function was considered to be the frequency of vibration of the spiders and the prey as this is the function that enables the spider differentiates the vibration of the prey from that of neighbouring spiders and therefore forages maximally. To address the parameter tuning problem, the search pattern was controlled by the position of the prey for convergence. The proposed model was tested for convergence using several benchmark functions with different characteristics to evaluate its performance and results compared to an existing state of the arts’ spider algorithm. Results showed that the proposed model performed better by searching the optimum solution of the benchmark functions used to test the model.