Genetic Algorithms for Multiobjective Optimization: FormulationDiscussion and Generalization
Proceedings of the 5th 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
Why Use Elitism And Sharing In A Multi-objective Genetic Algorithm?
GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
Why Quality Assessment Of Multiobjective Optimizers Is Difficult
GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
Approximating the Nondominated Front Using the Pareto Archived Evolution Strategy
Evolutionary Computation
Comparison of Multiobjective Evolutionary Algorithms: Empirical Results
Evolutionary Computation
Techniques for highly multiobjective optimisation: some nondominated points are better than others
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Achieving a simple development model for 3D shapes: are chemicals necessary?
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Theory of the hypervolume indicator: optimal μ-distributions and the choice of the reference point
Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms
Multicriteria decision making (MCDM): a framework for research and applications
IEEE Computational Intelligence Magazine
Preference-driven co-evolutionary algorithms show promise for many-objective optimisation
EMO'11 Proceedings of the 6th international conference on Evolutionary multi-criterion optimization
Hypervolume-based multiobjective optimization: Theoretical foundations and practical implications
Theoretical Computer Science
Local preference-inspired co-evolutionary algorithms
Proceedings of the 14th annual conference on Genetic and evolutionary computation
General framework for localised multi-objective evolutionary algorithms
Information Sciences: an International Journal
Objective space partitioning using conflict information for solving many-objective problems
Information Sciences: an International Journal
Hi-index | 0.00 |
Improved sample-based trade-off surface representations for large numbers of performance criteria can be achieved by dividing the global problem into groups of independent, parallel sub-problems, where possible. This paper describes a progressive criterion-space decomposition methodology for evolutionary optimisers, which uses concepts from parallel evolutionary algorithms and nonparametric statistics. The method is evaluated both quantitatively and qualitatively using a rigorous experimental framework. Proof-of-principle results confirm the potential of the adaptive divide-and-conquer strategy.