Skip to main content

Intermediate Population Based Differential Evolution Algorithm

  • Conference paper
Computational Intelligence and Information Technology (CIIT 2011)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 250))

Abstract

In the present paper propose two novel variants of Differential Evolution (DE), named IP-OBL and IP-NSDE, have been proposed. In IP-OBL the initial population is generated by using the intermediate positions between the uniformly generated random numbers and opposition based numbers. While in case of IP-NSDE, the initial population is generated as an intermediate of uniform random numbers and numbers generated by Nelder Mead Method. The proposed algorithms are further modified by selecting best NP/2 individuals to perform in population evolution. The modified variants are termed as MIP-OBL and MIP-NSDE. The numerical results of 10 benchmark problems indicate the competence of the proposed algorithms.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading (1989)

    MATH  Google Scholar 

  2. Holland, J.H.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Harbor (1975)

    Google Scholar 

  3. Brest, J., Greiner, S., et al.: Self-adapting Control parameters in differential evolution: a comparative study on numerical benchmark problems. IEEE Transactions on Evolutionary Computation 10(6), 646–657 (2006)

    Article  Google Scholar 

  4. Das, S., Konar, A., Chakraborty, U.: Two improved differential evolution schemes for faster global search. In: ACMSIGEVO Proceedings of GECCO, Washington, D.C, pp. 991–998 (2005)

    Google Scholar 

  5. Storn, R., Price, K.: Differential Evolution – a simple and efficient Heuristic for global optimization over continuous spaces. Journal Global Optimization 11, 341–359 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  6. Tizhoosh, H.R.: Opposition-based learning: A new scheme for machine intelligence. In: Proc. Int. Conf. Comput. Intell. Modeling Control and Autom., Vienna, Austria, vol. I, pp. 695–701 (2005)

    Google Scholar 

  7. Nelder, J.A., Mead, R.: A simplex method for, function minimisation. The Computer Journal 7, 308–313 (1965)

    Article  MathSciNet  MATH  Google Scholar 

  8. Jia, L., Gong, W., Wu, H.: An Improved Self-Adaptive Control Parameter of Differential Evolution For Global Optimization. In: Cai, Z., Li, Z., Kang, Z., Liu, Y. (eds.) ISICA 2009. CCIS, vol. 51, pp. 215–224. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sharma, T.K., Pant, M. (2011). Intermediate Population Based Differential Evolution Algorithm. In: Das, V.V., Thankachan, N. (eds) Computational Intelligence and Information Technology. CIIT 2011. Communications in Computer and Information Science, vol 250. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25734-6_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-25734-6_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-25733-9

  • Online ISBN: 978-3-642-25734-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics