Reducing bias and inefficiency in the selection algorithm
Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
Genetic algorithms with sharing for multimodal function optimization
Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Multiple Objective Optimization with Vector Evaluated Genetic Algorithms
Proceedings of the 1st International Conference on Genetic Algorithms
Genetic Algorithms for the 0/1 Knapsack Problem
ISMIS '94 Proceedings of the 8th International Symposium on Methodologies for Intelligent Systems
Approximating the Nondominated Front Using the Pareto Archived Evolution Strategy
Evolutionary Computation
Muiltiobjective optimization using nondominated sorting in genetic algorithms
Evolutionary Computation
An overview of evolutionary algorithms in multiobjective optimization
Evolutionary Computation
A multi-objective genetic local search algorithm and itsapplication to flowshop scheduling
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
No free lunch theorems for optimization
IEEE Transactions on Evolutionary Computation
Multiobjective evolutionary algorithms: a comparative case studyand the strength Pareto approach
IEEE Transactions on Evolutionary Computation
Hi-index | 0.00 |
This paper investigates the exploitation of nondominated sets' schemata in guiding multi-objective optimization. Schemata capture the similarities between solutions in the non-dominated set. They also reflect the knowledge acquired by multi-objective evolutionary algorithms. A schemata-driven genetic algorithm as well as a schemata-driven local search algorithm are described. An experimental study to evaluate the suggested approach is then conducted.