Research on Hybrid Evolutionary Algorithms with Differential Evolution and GUO Tao Algorithm Based on Orthogonal Design

  • Zhan-Fang Zhao
  • Kun-Qi Liu
  • Xia Li
  • You-Hua Zhang
  • Shu-Lin Wang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6215)

Abstract

This paper proposes an orthogonal mutation technology, which combines the orthogonal initialization technology and the orthogonal crossover technique. They are called the orthogonal processing technologies. The fusion of the differential evolution algorithm, the GuoTao operator and the orthogonal processing technology has formed several different hybrid evolutionary algorithms. The experimental results show that these new algorithms display the good performance in the solution precision, the stability and the convergence.

Keywords

Differential evolution algorithm GuoTao operator orthogonal design orthogonal crossover orthogonal mutation hybrid evolutionary algorithm 
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Qi, L.K., Shan, K.L., Zhuo, Z.Z.: Brief Report of Research on Cognizing the Subarea of Evolutionary Computation (I). J. Computer Science 36, 26–30 (2009)Google Scholar
  2. 2.
    Qi, L.K., Shan, K.L., Zhuo, Z.Z.: Brief Report of Research on Cognizing the Subarea of Evolutionary Computation(II). J. Computer Science 36, 35–39 (2009)Google Scholar
  3. 3.
    Moscato, P.: On evolution, search, optimization, genetic algorithms and martial arts: Towards memetic algorithms. California Institute of Technology, Pasadena, California, USA, Tech. Rep. Caltech Concurrent Computation Program, Report 826 (1989)Google Scholar
  4. 4.
    Grefenstette, J.J.: Lamarckian learning in multi-agent environments. In: Proc. Fourth Intl. Conf. of Genetic Algorithms, pp. 303–310. Morgan Kaufmann, San Mateo (1991)Google Scholar
  5. 5.
    Natalio, K., Jim, S.: A Tutorial for Competent Memetic Algorithms: Model, Taxonomy and Design Issues. IEEE Transactions on Evolutionary Computation 10, 472–488 (2006)Google Scholar
  6. 6.
    Dan, L.M.: The Development of Memetic Algorithm. J. Techniques of Automation and Applications. 26, 1–4 (2007)Google Scholar
  7. 7.
    Yong, L., Shan, K.L.: The Annealing evolution algorithm as function optimizer. J. Parallel Computing (21), 389–400 (1995)Google Scholar
  8. 8.
    Storn, R., Price, K.: Differential evolution: A simple and efficient heuristic for global optimization over continuous spaces. Journal of Global Optimization 11, 341–359 (1997)MathSciNetCrossRefMATHGoogle Scholar
  9. 9.
    Tao, G., Shan, K.L.: A new evolutionary algorithm for function optimization. J. Wuhan University Journal of Nature Sciences 4, 409–414 (1999)MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    Zhuo, K., Yan, L.: An all-purpose evolutionary algorithm for solving nonlinear programming problems. J. Journal of computer research and development 39, 1471–1474 (2002)Google Scholar
  11. 11.
    Lei, W., Cheng, J.L.: A novel genetic algorithim based on immunity. In: Proceedings of the 2000 IEEE International Symposium on Circuits and Systems (ISCAS), pp. 385–388 (2000)Google Scholar
  12. 12.
    Jun, Z.W., Feng, X.L.: DEPSO: hybrid particle swarm with differential evolution operator. In: IEEE International Conference on Systems, Man, and Cybernetics (SMCC), Washington, DC, USA, pp. 3816–3821 (2003)Google Scholar
  13. 13.
    Zhang, Q., Sun, J., Tsang, E.: Evolutionary Algorithm with Guided Mutation for the Maximum Clique Problem. IEEE Transaction on Evolutionary Computation 9, 192–200 (2005)CrossRefGoogle Scholar
  14. 14.
    Sun, J., Zhang, Q., Tsang, E.: DE/DEA: New Evolutionary Algorithm for Global Optimisation. J. Information Sciences 169, 249–262 (2005)CrossRefGoogle Scholar
  15. 15.
    Qi, L.K.: Differential Evolution Algorithm Based on Simulated Annealing. In: Kang, L., Liu, Y., Zeng, S. (eds.) ISICA 2007. LNCS, vol. 4683, pp. 120–126. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  16. 16.
    Yin, Z.X., Bin, D.H.: DEACO: Hybrid Ant Colony Optimization with Differential Evolution. In: Proceedings of the 2008 Congress on Evolutionary Computation, pp. 921–927 (2008)Google Scholar
  17. 17.
    Wei, L.X., Hua, C.Z.: Application of a novel GEP algorithm in evolutionary modeling and forecasting. J. Computer Applications 25, 2783–2786 (2005)Google Scholar
  18. 18.
    Chao, H.Y., Zhan, K.Y.: Hybrid particle swarm optimization algorithm based on global inferior-substitution strategy. J. Application Research of Computers 24, 75–78 (2005)Google Scholar
  19. 19.
    Leung, Y.W.: An Orthogonal Genetic Algorithm with Quantization for Global Numerical Optimization. IEEE Transactions on Evolutionary Computation 5, 91–96 (2001)Google Scholar
  20. 20.
    Yan, W.S., Fu, Z.Q.: A new evolutionary algorithm based on family eugenics. Journal of software 8, 137–144 (1997)Google Scholar
  21. 21.
    Yin, G.W., Bo, L.X.: Research on a Fast Differential Evolution Based on Orthogonal Design and its Application. Journal of Chinese Computer Systems 28, 1297–1300 (2007)Google Scholar
  22. 22.
    Feng, W.Z., Kuan, H.H.: A differential evolution algorithm with double trial vectors based-on Boltzmann mechanism. Journal of Nanjing university (natural sciences) 44, 199–200 (2008)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Zhan-Fang Zhao
    • 1
  • Kun-Qi Liu
    • 1
    • 2
  • Xia Li
    • 1
  • You-Hua Zhang
    • 1
  • Shu-Lin Wang
    • 3
  1. 1.Department of Computer ScienceShijiazhuang University of EconomicsShijiazhuangChina
  2. 2.School of ComputerChina University of GeosciencesWuhanChina
  3. 3.School of Computer and CommunicationHunan UniversityChangsha, HunanChina

Personalised recommendations