Research on hybrid evolutionary algorithms with differential evolution and GUO Tao algorithm based on orthogonal design

Authors:
Zhan-Fang Zhao;Kun-Qi Liu;Xia Li;You-Hua Zhang;Shu-Lin Wang
Affiliations:
Department of Computer Science, Shijiazhuang University of Economics, Shijiazhuang, China;Department of Computer Science, Shijiazhuang University of Economics, Shijiazhuang, China and School of Computer, China University of Geosciences, Wuhan, China;Department of Computer Science, Shijiazhuang University of Economics, Shijiazhuang, China;Department of Computer Science, Shijiazhuang University of Economics, Shijiazhuang, China;School of Computer and Communication, Hunan University, Changsha, Hunan, China
Venue:
ICIC'10 Proceedings of the 6th international conference on Advanced intelligent computing theories and applications: intelligent computing
Year:
2010

Citing 6
Cited 0

The annealing evolution algorithm as function optimizer

Parallel Computing
Differential Evolution – A Simple and Efficient Heuristic for Global Optimization over Continuous Spaces

Journal of Global Optimization
DE/EDA: a new evolutionary algorithm for global optimization

Information Sciences—Informatics and Computer Science: An International Journal
An orthogonal genetic algorithm with quantization for globalnumerical optimization

IEEE Transactions on Evolutionary Computation
An evolutionary algorithm with guided mutation for the maximum clique problem

IEEE Transactions on Evolutionary Computation
A tutorial for competent memetic algorithms: model, taxonomy, and design issues

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

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.