Skip to main content
SpringerLink
Log in

Effects of Initial Search Bound on the Performance of Self-adaptive Evolutionary Computation Methods

  • Conference paper
Book cover Information Systems, Technology and Management (ICISTM 2010)

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

  • 1949 Accesses

Abstract

Self-adaptive evolutionary computation methods are widely used for finding global optimum in varieties of problem domains. One of the major demerits of these methods is premature convergence that stuck the search process at one of the local minimum. This paper examines this issue through an exhaustive study on the possible effects of initial search bound on the overall performance of the evolutionary computation methods.

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

Access this chapter

Log in via an institution
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 Publishing, Reading (1988)

    Google Scholar 

  2. Davis, L. (ed.): Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York (1991)

    Google Scholar 

  3. Schwefel, H.-P.: Evolution and optimum seeking. Wiley, New York (1995)

    Google Scholar 

  4. Schwefel, H.P.: Numerical Optimization of Computing Models. John Wiley, Chichester (1981)

    Google Scholar 

  5. Fogel, L.J., Owens, A.J., Walsh, M.J.: Artificial Intelligence through Simulated Evolution. John Wiley, New York (1966)

    MATH  Google Scholar 

  6. Fogel, D.B.: Evolutionary Computation: Towards a New Philosophy of Machine Intelligence. IEEE Press, New York (1995)

    Google Scholar 

  7. Bäck, T., Schwefel, H.-P.: An overview of evolutionary algorithms for parameter optimization. Evolutionary Comput. 1(1), 1–23 (1993)

    Article  Google Scholar 

  8. Bäck, T.: Evolutionary algorithms in theory and practice. Oxford University Press, Inc., NY (1997)

    Google Scholar 

  9. Sarvanan, N., Fogel, D.B., Nelson, K.M.: A comparison of methods for self-adaptation in evolutionary algorithms. BioSystems 36, 157–166 (1995)

    Article  Google Scholar 

  10. Yao, X., Liu, Y.: Fast evolutionary programming. In: Fogel, L.J., Angeline, P.J., Bäck, T. (eds.) Evolutionary Programming: Proc. Fifth Annual Conf. Evolutionary Programming, pp. 451–460. MIT Press, Cambridge (1996)

    Google Scholar 

  11. Yao, X., Liu, Y.: Fast evolution strategies. Control and Cybernatics 26(3), 467–496 (1997)

    MATH  MathSciNet  Google Scholar 

  12. Yao, X., Liu, Y., Lin, G.: Evolutionary programming made faster. IEEE Trans. Evolutionary Comput. 3(2), 82–102 (1999)

    Article  Google Scholar 

  13. Johnson, N.L., Kotz, S., Balakrishnan, N.: Continuous univariate distributions, vol. 1. John Wiley & sons, Inc., USA (1994)

    MATH  Google Scholar 

  14. Yao, X., Liu, Y., Lin, G.: Evolutionary programming made faster. IEEE Trans. Evolutionary Computation 3(2), 82–102 (1999)

    Article  Google Scholar 

  15. Chellapilla, K.: Combining mutation operators in evolutionary programming. IEEE Trans. Evolutionary Comput. 2(3), 91–96 (1998)

    Article  Google Scholar 

  16. Rudolph, G.: Local convergence rates of simple evolutionary algorithms with Cauchy mutations. IEEE Trans. Evolutionary Computation 1(4), 249–258 (1997)

    Article  MathSciNet  Google Scholar 

  17. Liang, K.-H., Yao, X., Newton, C., Hoffman, D.: An experimental investigation of self-adaptation in evolutionary programming. In: Porto, V.W., Waagen, D. (eds.) EP 1998. LNCS, vol. 1447, pp. 291–300. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  18. Liang, K.-H., Yao, X., Newton, C.: Dynamic control of adaptive parameters in evolutionary programming. In: McKay, B., Yao, X., Newton, C.S., Kim, J.-H., Furuhashi, T. (eds.) SEAL 1998. LNCS (LNAI), vol. 1585, pp. 42–49. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  19. Glickman, M.R., Sycara, K.: Reasons for premature convergence of self-adapting mutation rates. In: Proc. Congress on Evolutionary Computation (CEC 2000), San Diego, CA, pp. 62–69 (2000)

    Google Scholar 

  20. Swain, A.K., Morris, A.S.: A novel hybrid evolutionary programming method for function optimization. In: Proc. Congress on Evolutionary Computation (CEC 2000), San Diego, CA, pp. 1369–1376 (2000)

    Google Scholar 

  21. Swain, A.K.: Performance Analysis of Self-Adaptive Evolutionary Computation Methods. In: Proc. National Conference on IT and Soft Computing (ITSC) (November 2006)

    Google Scholar 

  22. Swain, A.K., Morris, A.S.: Performance Improvement of Self-Adaptive Evolutionary Methods with a Dynamic Lower Bound. International Journal of Information Processing Letters 82, 55–63 (2002)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Indian Institute of Management Kozhikode, Kozhikode, 673 571

    Anjan Kumar Swain

Authors
  1. Anjan Kumar Swain
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science Department, Georgia State University, 34 Peachtree Street, 30303, Atlanta, GA, USA

    Sushil K. Prasad

  2. Tata Research, Development and Design Center (TRDDC), Pune, India

    Harrick M. Vin

  3. CISE Department, CSE 301, University of Florida, FL 32611, Gainesville, USA

    Sartaj Sahni

  4. Management Development Institute (MDI), Mehrauli Road, Sukhrali, Gurgaon, India

    Mahadeo P. Jaiswal

  5. Dept. of Computer Engineering, King Mongkut’s University of Technology, Thonburi, 10140, Bangkok, Thailand

    Bundit Thipakorn

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Swain, A.K. (2010). Effects of Initial Search Bound on the Performance of Self-adaptive Evolutionary Computation Methods. In: Prasad, S.K., Vin, H.M., Sahni, S., Jaiswal, M.P., Thipakorn, B. (eds) Information Systems, Technology and Management. ICISTM 2010. Communications in Computer and Information Science, vol 54. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12035-0_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-12035-0_31

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-12034-3

  • Online ISBN: 978-3-642-12035-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation