[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content
Springer Nature Link
Log in

Tournament Selection Based Probability Scheme in Spider Monkey Optimization Algorithm

  • Conference paper
  • First Online:
Harmony Search Algorithm

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

  • 1997 Accesses

Abstract

In this paper, a modified version of Spider Monkey Optimization (SMO) algorithm is proposed. This modified version is named as Tournament selection based Spider Monkey Optimization (TS-SMO). TS-SMO replaces the fitness proportionate probability scheme of SMO with tournament selection based probability scheme with an objective to improve the exploration ability of SMO by avoiding premature convergence. The performance of the proposed variant is tested over a large benchmark set of 46 unconstrained benchmark problems of varying complexities broadly classified into two categories: scalable and non-scalable problems. The performance of TS-SO is compared with that of SMO. Results for scalable and non-scalable problems have been analysed separately. A statistical test is employed to access the significance of improvement in results. Numerical and statistical results show that the proposed modification has a positive impact on the performance of original SMO in terms of reliability, efficiency and accuracy.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
GBP 19.95
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
GBP 143.50
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
GBP 179.99
Price includes VAT (United Kingdom)
  • 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Bansal, J.C., Sharma, H., Jadon, S.S., Clerc, M.: Spider Monkey Optimization algorithm for numerical optimization. Memetic Computing 6(1), 31–47 (2014)

    Article  Google Scholar 

  2. Goldberg, D.E.: Genetic algorithms in search, optimization, and machine learning. Addison-Wesley, Reading (1989)

    MATH  Google Scholar 

  3. Holland, J.H.: Adaptation in Natural and Artificial Systems. University of Michigan press, AnnArbor (1975)

    Google Scholar 

  4. Symington, M.M.: Fission-fusion social organization inAteles and Pan. International Journal of Primatology 11(1), 47–61 (1990)

    Article  Google Scholar 

  5. Miller, B.L., Goldberg, D.E.: Genetic algorithms, tournament selection, and the effects of noise. Complex Systems 9(3), 193–212 (1995)

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Indian Institute of Technology Roorkee, Roorkee, 247667, Uttarakhand, India

    Kavita Gupta & Kusum Deep

Authors
  1. Kavita Gupta
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kusum Deep
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kavita Gupta .

Editor information

Editors and Affiliations

  1. Civil, Environmental and Architectural Engineering, Korea University, Seoul, Korea (Republic of)

    Joong Hoon Kim

  2. Energy IT, Gachon University, Seongnam-Si, Korea (Republic of)

    Zong Woo Geem

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gupta, K., Deep, K. (2016). Tournament Selection Based Probability Scheme in Spider Monkey Optimization Algorithm. In: Kim, J., Geem, Z. (eds) Harmony Search Algorithm. Advances in Intelligent Systems and Computing, vol 382. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-47926-1_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-47926-1_23

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-47925-4

  • Online ISBN: 978-3-662-47926-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation