Abstract
Spider monkey optimization algorithm (SMOA) is one of the powerful techniques in the arena of swarm intelligence (SI)-based strategies. This article proposes a modified variant of SMOA that is based on an exponential adaptive strategy for step size. During the search of the optimal solution, this exponential strategy is used to adjust the step size so that it can speed up the convergence ability of the swarm. The proposed algorithm is termed as exponential adaptive spider monkey optimization (EASMO) algorithm. This evinced algorithm is tested over 14 standard optimization problems to examine its authenticity. Further, the obtained results are compared with the artificial bee colony (ABC), differential evolution (DE), Gbest-guided artificial bee colony (GABC), particle swarm optimization (PSO), SMOA, and three of its momentous variants, namely levy flight SMOA (LFSMOA), modified limacon SMOA (MLSMOA), and power law-based local search in SMOA (PLSMOA). The analysis of the results proved the competence of EASMO in the field of SI-based strategies.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
