The Design of Innovation: Lessons from and for Competent Genetic Algorithms
The Design of Innovation: Lessons from and for Competent Genetic Algorithms
Sizing Populations for Serial and Parallel Genetic Algorithms
Proceedings of the 3rd International Conference on Genetic Algorithms
On the Performance Assessment and Comparison of Stochastic Multiobjective Optimizers
PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
Adaptive Hierarchical Fair Competition (AHFC) Model For Parallel Evolutionary Algorithms
GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
Comparison of Multiobjective Evolutionary Algorithms: Empirical Results
Evolutionary Computation
Multiobjective evolutionary algorithms: a comparative case studyand the strength Pareto approach
IEEE Transactions on Evolutionary Computation
A fast and elitist multiobjective genetic algorithm: NSGA-II
IEEE Transactions on Evolutionary Computation
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Multicriteria decision making (MCDM): a framework for research and applications
IEEE Computational Intelligence Magazine
A fast steady-state ε-dominance multi-objective evolutionary algorithm
Computational Optimization and Applications
| Hi-index | 0.00 |
The capability of multi-objective evolutionary algorithms (MOEAs) to handle premature convergence is critically important when applied to real-world problems. Their highly multi-modal and discrete search space often makes the required performance out of reach to current MOEAs. Examining the fundamental cause of premature convergence in evolutionary search has led to proposing of a generic framework, named Hierarchical Fair Competition (HFC)[9], for robust and sustainable evolutionary search. Here an HFC-based Hierarchical Evolutionary Multi-objective Optimization framework (HEMO) is proposed, which is characterized by its simultaneous maintenance of individuals of all degrees of evolution in hierarchically organized repositories, by its continuous inflow of random individuals at the base repository, by its intrinsic hierarchical elitism and hyper-grid-based density estimation. Two experiments demonstrate its search robustness and its capability to provide sustainable evolutionary search for difficult multi-modal problems. HEMO makes it possible to do reliable multi-objective search without risk of premature convergence. The paradigmatic transition of HEMO to handle premature convergence is that instead of trying to escape local optima from converged high fitness populations, it tries to maintain the opportunity for new optima to emerge from the bottom up as enabled by its hierarchical organization of individuals of different fitnesses.