Skip to main content

An Improved Spider Monkey Optimization Algorithm

  • Conference paper
  • First Online:
Book cover Soft Computing: Theories and Applications

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 583))

Abstract

Spider Monkey Optimization is the newest member of the Swarm Intelligence-based algorithm, which is motivated by the extraordinary behavior of Spider Monkeys. The SMO algorithm is a population-based stochastic metaheuristic. The SMO algorithm is well balanced for good exploration and exploitation most of the times. This paper introduces an improved strategy to update the position of solution in Local Leader Phase. The proposed algorithm named as Improved Spider Monkey Optimization (ISMO) algorithm. This method is developed to improve the rate of convergence. The ISMO algorithm tested over the benchmark problems and its superiority established with the help of statistical results.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Bonabeau, E., Dorigo, M., Theraulaz, G.: Swarm intelligence: from natural to artificial systems (no.1). Oxford University Press (1999)

    Google Scholar 

  2. Bansal, J.C., Sharma, H., Jadon, S.S., Clerc, M.: Spider monkey optimization algorithm for numerical optimization. Memet. comput. 6(1), 31–47 (2014)

    Article  Google Scholar 

  3. Pal, S.S., Kumar, S., Kashyap, M., Choudhary, Y., Bhattacharya, M.: Multi-level thresholding segmentation approach based on spider monkey optimization algorithm. In: Proceedings of the Second International Conference on Computer and Communication Technologies, pp. 273–287. Springer, India (2016)

    Google Scholar 

  4. Gupta, K., Deep, K., Bansal, J.C.: Improving the local search ability of spider monkey optimization algorithm using quadratic approximation for unconstrained optimization. Comput. Intell. (2016)

    Google Scholar 

  5. Sharma, A., Sharma, A., Panigrahi, B.K., Kiran, D., Kumar, R: Ageist spider monkey optimization algorithm. Swarm Evol. Comput. 28, 58–77 (2016)

    Google Scholar 

  6. Gupta, K., Deep, K.: Tournament selection based probability scheme in spider monkey optimization algorithm. In: Harmony Search Algorithm, pp. 239–250. Springer, Heidelberg (2016)

    Google Scholar 

  7. Gupta, K., Deep, K.: Investigation of suitable perturbation rate scheme for spider monkey optimization algorithm. In: Proceedings of Fifth International Conference on Soft Computing for Problem Solving, pp. 839–850. Springer, Singapore (2016)

    Google Scholar 

  8. Singh, U., Salgotra, R., Rattan, M.: A novel binary spider monkey optimization algorithm for thinning of concentric circular antenna arrays. IETE J. Res. 1–9 (2016)

    Google Scholar 

  9. Singh, U., Salgotra, R.: Optimal synthesis of linear antenna arrays using modified spider monkey optimization. Arab. J. Sci. Eng. 1–17 (2016)

    Google Scholar 

  10. 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)

    Google Scholar 

  11. Al-Azza, A.A., Al-Jodah, A.A., Harackiewicz, F.J.: Spider monkey optimization (SMO): a novel optimization technique in electromagnetics. In: 2016 IEEE Radio and Wireless Symposium (RWS), pp. 238–240. (2016)

    Google Scholar 

  12. Agarwal, P., Singh, R., Kumar, S., Bhattacharya, M.: Social spider algorithm employed multi-level thresholding segmentation approach. In: Proceedings of First International Conference on Information and Communication Technology for Intelligent Systems, Vol. 2, pp. 249–259. Springer International Publishing (2016)

    Google Scholar 

  13. Kumar, S., Sharma, V.K., Kumari, R.: Self-adaptive spider monkey optimization algorithm for engineering optimization problems. Int. J. Inf. Commun. Comput. Technol. II, pp. 96–107 (2014)

    Google Scholar 

  14. Kumar, S., Kumari, R., Sharma, V.K.: Fitness based position update in spider monkey optimization algorithm. Procedia Comput. Sci. 62, 442–449 (2015). doi:10.1016/j.procs.2015.08.504

    Article  Google Scholar 

  15. Kumar, S., Sharma, V.K., Kumari, R.: Modified position update in spider monkey optimization algorithm. Int. J. Emerg. Technol. Comput. Appl. Sci. 2(7), 198–204 (2014)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Viren Swami .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Swami, V., Kumar, S., Jain, S. (2018). An Improved Spider Monkey Optimization Algorithm. In: Pant, M., Ray, K., Sharma, T., Rawat, S., Bandyopadhyay, A. (eds) Soft Computing: Theories and Applications. Advances in Intelligent Systems and Computing, vol 583. Springer, Singapore. https://doi.org/10.1007/978-981-10-5687-1_7

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-5687-1_7

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-5686-4

  • Online ISBN: 978-981-10-5687-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics