UEAS: A Novel United Evolutionary Algorithm Scheme

  • Fei Gao
  • Hengqing Tong
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4234)


How to detect global optimums of the complex function is of vital importance in diverse scientific fields. Though stochastic optimization strategies simulating evolution process are proved to be valuable tools, the balance between exploitation and exploration of which is difficult to be maintained. In this paper, some established techniques to improve the performance of evolutionary computation are discussed firstly, such as uniform design, deflection and stretching the objective function, and space contraction. Then a novel scheme of evolutionary algorithms is proposed to solving the optimization problems through adding evolution operations to the searching space contracted regularly with these techniques. A typical evolution algorithm differential evolution is chosen to exhibit the new scheme’s performance and the experiments done to minimize the benchmark nonlinear optimization problems and to detect nonlinear map’s unstable periodic points show the put approach is very robust.


Particle Swarm Optimization Periodic Point Uniform Design Space Contraction Uniform Design Method 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Whitley, D.: An overview of evolutionary algorithms: Practical issues and common pitfalls. Information and Software Technology 43(14), 817–831 (2001)CrossRefGoogle Scholar
  2. 2.
    Eiben, A.E., Smith, J.E.: Introduction to Evolutionary Computing. Natural Computing Series. Springer, Heidelberg (2003)MATHGoogle Scholar
  3. 3.
    Yao, X., Xu, Y.: Recent Advances in Evolutionary Computation. J. of Computer Science and Technology 21(1), 1–18 (2006)CrossRefMATHMathSciNetGoogle Scholar
  4. 4.
    Ma, C. X.: Uniform design Based on Centered L2 Discrepancy U n(n s) (1999),
  5. 5.
    Parsopoulos, K.E., Vrahatis, M.N.: On the Computation of All Global Minimizers through Particle Swarm Optimization. IEEE Tran. on evolutionary computation 8(3), 211–224 (2004)CrossRefMathSciNetGoogle Scholar
  6. 6.
    Hua, L.K., Wang, Y.: Applications of Number theory to Numerical analysis. Springer, Science Press, Berlin, Beijing (1981)MATHGoogle Scholar
  7. 7.
    Pan, Z.J., Kang, L.S., Chen, Y.P.: Evolutionary Computation. Tsinghua University Press, Beijing (1998)Google Scholar
  8. 8.
    Storn, R., Price, K.: Differential evolution-a simple and efficient adaptive scheme for global optimization over continuous spaces. Journal of Global Optimization 11, 341–359 (1997)CrossRefMATHMathSciNetGoogle Scholar
  9. 9.
    Price, K., Storn, R., Lampinen, J.: Differential Evolution: A Practical Approach to Global Optimization. Natural Computing Series. Springer, Heidelberg (2005)MATHGoogle Scholar
  10. 10.
    Gao, F., Tong, H.Q.: Control a Novel Discrete Chaotic System through Particle Swarm Optimization. In: Proceedings of the 6th World Congress on Control and Automation, Dalian, China, pp. 3330–3334 (2006)Google Scholar
  11. 11.
    Michalewicz, Z., Fogel, D.B.: How to Solve It: Modern Heuristics. Springer, Berlin (2000)MATHGoogle Scholar
  12. 12.
    Henon, M.: Numerical study of quadratic area–preserving mappings. Quart. Appl. Math. 27, 291–311 (1969)MATHMathSciNetGoogle Scholar
  13. 13.
    Biham, O., Wenzel, W.: Unstable periodic orbits and the symbolic dynamics of the complex Henon map. Physical Review A 42(10), 4639–4646 (1990)CrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Fei Gao
    • 1
  • Hengqing Tong
    • 1
  1. 1.Department of MathematicsWuhan University of TechnologyWuhanP.R. China

Personalised recommendations