Abstract
Spider Monkey Optimisation (SMO) is a new addition within the arena of nature-inspired algorithms. It is a recent Swarm Intelligence (SI) based algorithm, that models the food foraging behavior of a group of spider monkeys that mimic the Fission-Fusion Social System (FFSS) behavior. The SMO has been proven to be competitory and it balances the capabilities; exploitation and exploration efficiently. This article presents a significant variant of SMO, namely Spider Monkey Optimization with Enhanced Learning (SMOEL). In the proposed strategy, to increase the exploitation capability of SMO, an enhanced learning mechanism is introduced in the local leader stage that is based on the fitness of the solution. Reliability and accuracy of the intended algorithm are tested over 14 benchmarks functions and the comparison showed against various state of art algorithms available in the literature. The obtained outcomes prove the superiority of the intended algorithm.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Agarwal, N., Jain, S.C.: Fast convergent spider monkey optimization algorithm. In: Deep, K., et al. (eds.) Proceedings of Sixth International Conference on Soft Computing for Problem Solving. AISC, vol. 546, pp. 42–51. Springer, Singapore (2017). https://doi.org/10.1007/978-981-10-3322-3_5
Ali, M.M., Khompatraporn, C., Zabinsky, Z.B.: A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems. J. Glob. Optim. 31(4), 635–672 (2005)
Bansal, J.C., Sharma, H., Jadon, S.S., Clerc, M.: Spider monkey optimization algorithm for numerical optimization. Memet. Comput. 6(1), 31–47 (2014)
Eusuff, M., Lansey, K., Pasha, F.: Shuffled frog-leaping algorithm: a memetic meta-heuristic for discrete optimization. Eng. Optim. 38(2), 129–154 (2006)
Hazrati, G., Sharma, H., Sharma, N., Bansal, J.C.: Modified spider monkey optimization. In: International Workshop on Computational Intelligence (IWCI), pp. 209–214. IEEE (2016)
Karaboga, D., Akay, B.: A comparative study of artificial Bee colony algorithm. Appl. Math. Comput. 214(1), 108–132 (2009)
Kennedy, J.: Particle swarm optimization. In: Gass, S.I., Fu, M.C. (eds.) Encyclopedia of machine learning, pp. 760–766. Springer, Heidelberg (2011). https://doi.org/10.1007/978-1-4419-1153-7
Kumar, S., Kumari, R., Sharma, V.K.: Fitness based position update in spider monkey optimization algorithm. Procedia Comput. Sci. 62, 442–449 (2015)
Passino, K.M.: Biomimicry of bacterial foraging for distributed optimization and control. IEEE Control Syst. 22(3), 52–67 (2002)
Rashedi, E., Nezamabadi-Pour, H., Saryazdi, S.: GSA: a gravitational search algorithm. Inf. Sci. 179(13), 2232–2248 (2009)
Sharma, A., Sharma, H., Bhargava, A., Sharma, N.: Optimal design of PIDA controller for induction motor using spider monkey optimization algorithm. Int. J. Metaheuristics 5(3–4), 278–290 (2016)
Sharma, A., Sharma, H., Bhargava, A., Sharma, N.: Power law-based local search in spider monkey optimisation for lower order system modelling. Int. J. Syst. Sci. 1–11 (2016)
Sharma, A., Sharma, H., Bhargava, A., Sharma, N.: Power law-based local search in spider monkey optimisation for lower order system modelling. Int. J. Syst. Sci. 48(1), 150–160 (2017)
Sharma, A., Sharma, A., Panigrahi, B.K., Kiran, D., Kumar, R.: Ageist spider monkey optimization algorithm. Swarm Evol. Comput. 28, 58–77 (2016)
Sharma, N., Sharma, H., Sharma, A., Bansal, J.C.: Modified artificial bee colony algorithm based on disruption operator. In: Pant, M., Deep, K., Bansal, J., Nagar, A., Das, K. (eds.) Proceedings of Fifth International Conference on Soft Computing for Problem Solving. AISC, vol. 437, pp. 889–900. Springer, Singapore (2016). https://doi.org/10.1007/978-981-10-0451-3_79
Storn, R., Price, K.: Differential evolution-a simple and efficient heuristic for global optimization over continuous spaces. J. Glob. Optim. 11(4), 341–359 (1997)
Suganthan, P.N., Hansen, N., Liang, J.J., Deb, K., Chen, Y.P., Auger, A., Tiwari, S.: Problem definitions and evaluation criteria for the CEC 2005: special session on real-parameter optimization. In: CEC 2005 (2005)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Bhagwanti, Sharma, H., Sharma, N. (2018). Spider Monkey Optimization Algorithm with Enhanced Learning. In: Singh, M., Gupta, P., Tyagi, V., Flusser, J., Ören, T. (eds) Advances in Computing and Data Sciences. ICACDS 2018. Communications in Computer and Information Science, vol 906. Springer, Singapore. https://doi.org/10.1007/978-981-13-1813-9_39
Download citation
DOI: https://doi.org/10.1007/978-981-13-1813-9_39
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-13-1812-2
Online ISBN: 978-981-13-1813-9
eBook Packages: Computer ScienceComputer Science (R0)