Hyperbolic Spider Monkey Optimization Algorithm

(E-pub Ahead of Print)

Author(s): Sandeep Kumar, Anand Nayyar, Nhu Gia Nguyen, Rajani Kumari.

Journal Name: Recent Patents on Computer Science

Become EABM
Become Reviewer

Abstract:

Background: Spider monkey optimization algorithm is recently developed nature-inspired algorithm. It is based on fission-fusion social structure of spider monkeys. Perturbation rate is one of the important parameter of spider monkey optimization algorithm, which affects the convergence behavior of spider monkey optimization algorithm. Generally, perturbation rate is a linearly increasing function. However, due to the availability of non-linearity in different applications, a non-linear function may affect the performance of spider monkey optimization algorithm.

Objective: This paper provides a detailed study on various perturbation techniques used in spider monkey optimization algorithm and recommends a novel alternative of hyperbolic spider monkey optimization algorithm. The new approach is named as hyperbolic Spider Monkey Optimization algorithm as the perturbation strategy inspired by hyperbolic growth function.

Method: The proposed algorithm tested over a set of 23 CEC 2005 benchmark problems.

Results: The experimental outcomes illustrate that the hyperbolic spider monkey optimization algorithm effectively increase the reliability of spider monkey optimization algorithm in comparison to the considered approaches.

Conclusion: The hyperbolic spider monkey optimization algorithm provides improved perturbation rate, desirable convergence precision, rapid convergence rate, and improved global search capability.

Keywords: Fission-Fusion Social Structure, Swarm Intelligence, Nature Inspired Algorithm, Optimization, Metaheuristics, Unconstrained optimization

Rights & PermissionsPrintExport Cite as

Article Details

(E-pub Ahead of Print)
DOI: 10.2174/2213275912666181207155334
Price: $95