An orthogonal dynamic evolutionary algorithm with niches

Authors:
Sanyou Zeng;Deyou Tang;Lishan Kang;Shuzhen Yao;Lixin Ding
Affiliations:
Dept. of Computer Science, Zhuzhou Institute of Technology, Zhuzhou, Hunan, P.R.China;Dept. of Computer Science, Zhuzhou Institute of Technology, Zhuzhou, Hunan, P.R.China;State Key Laboratory of Software Engineering, Wuhan University, Wuhan, Hubei, P.R.China;Dept. of Computer Science, China University of GeoSciences, Wuhan, Hubei, P.R.China;State Key Laboratory of Software Engineering, Wuhan University, Wuhan, Hubei, P.R.China
Venue:
ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part II
Year:
2005

Citing 7
Cited 0

Nonstationary function optimization using genetic algorithm with dominance and diploidy

Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
Evolutionary Optimization in Dynamic Environments

Evolutionary Optimization in Dynamic Environments
Case-Based Initialization of Genetic Algorithms

Proceedings of the 5th International Conference on Genetic Algorithms
A Comparison of Dominance Mechanisms and Simple Mutation on Non-stationary Problems

PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
Supporting Polyploidy in Genetic Algorithms Using Dominance Vectors

EP '97 Proceedings of the 6th International Conference on Evolutionary Programming VI
Designing evolutionary algorithms for dynamic optimization problems

Advances in evolutionary computing
An Orthogonal Multi-objective Evolutionary Algorithm for Multi-objective Optimization Problems with Constraints

Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new dynamic evolutionary algorithm based on orthogonal design (denoted by ODEA) is proposed in present paper. Its population does not consist of individuals (solution vectors), but of niches, a properly small hyper-rectangle where orthogonal design method likely work well. Each niche selects the best solution found so far as its representative. And orthogonal design method is employed to find potentially good solution which is probably the representative in the niche. The niche mutation, the only genetic operator in this evolutionary algorithm, is guided by the representative of the niche, therefore, the fitness of the offspring is likely better than that of its father, furthermore, ODEA evolves fast. We employ a complex benchmark (moving peaks functions) testing the new approach and the numerical experiments show that ODEA performs much better than SOS [1].