Skip to main content

A Hybrid Parallel Evolutionary Algorithm Based on Elite-Subspace Strategy and Space Transformation Search

  • Conference paper
High Performance Computing and Applications

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5938))

Abstract

In this paper, we present a new Hybrid Parallel Evolutionary Algorithm. It is based on Elite-subspace Strategy and combined with Space Transformation Search strategy to solve systems of non-linear equations. Verified by numerical experiments, our algorithm present an outstanding universal characteristics and superior convergence as well. All of the solutions can be obtained within a short period of time.

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. Quarteroni, A., Sacco, R., Saleri, F.: Numerical Mathematics. Springer, New York (2000)

    Google Scholar 

  2. Alexander: A Globally Convergent Parallel Algorithm. Nonlinear Analysis Theory Application 3(1), 339–350 (1989)

    Google Scholar 

  3. Rahnamayan, S., Tizhoosh, H.R., Salama, M.M.A.: Opposition-Based differential evolution. In: Proceedings of IEEE Congress Evolutionary Computation, vol. 12, pp. 64–79 (2008)

    Google Scholar 

  4. Wang, H., Wu, Z., Liu, Y.: Space Transformation Search: A New Evolutionary Technique. In: Genetic and Evolutionary Computation (2009) (in press)

    Google Scholar 

  5. Tao, G.: A New Algorithm for Solving Function Optimization Problems with Inequality Constraints. J. Wuhan Univ. (Nat. Sci. Ed.) 45, 771–775 (1999)

    Google Scholar 

  6. Wu, Z.: An Elite-subspace Evolutionary Algorithm for Solving Function Optimization Problems. Computer Applications 23, 13–15 (2003)

    Google Scholar 

  7. Wolpert, D.H., Macready, W.G.: No free lunch theorems for optimization. IEEE Transaction on Evolutionary Computation 1, 67–82 (1997)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dong, X., Yu, S., Wu, Z., Chen, Z. (2010). A Hybrid Parallel Evolutionary Algorithm Based on Elite-Subspace Strategy and Space Transformation Search. In: Zhang, W., Chen, Z., Douglas, C.C., Tong, W. (eds) High Performance Computing and Applications. Lecture Notes in Computer Science, vol 5938. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11842-5_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-11842-5_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-11841-8

  • Online ISBN: 978-3-642-11842-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics