Multiobjective optimization with messy genetic algorithms
SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 1
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Evolutionary Algorithms for Solving Multi-Objective Problems
Evolutionary Algorithms for Solving Multi-Objective Problems
Combining convergence and diversity in evolutionary multiobjective optimization
Evolutionary Computation
Genetic Algorithms for Multiobjective Optimization: FormulationDiscussion and Generalization
Proceedings of the 5th International Conference on Genetic Algorithms
A Spatial Predator-Prey Approach to Multi-objective Optimization: A Preliminary Study
PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
A Fast Elitist Non-dominated Sorting Genetic Algorithm for Multi-objective Optimisation: NSGA-II
PPSN VI Proceedings of the 6th International Conference on Parallel Problem Solving from Nature
The Pareto Envelope-Based Selection Algorithm for Multi-objective Optimisation
PPSN VI Proceedings of the 6th International Conference on Parallel Problem Solving from Nature
A Statistical Comparison of Multiobjective Evolutionary Algorithms Including the MOMGA-II
EMO '01 Proceedings of the First International Conference on Evolutionary Multi-Criterion Optimization
Muiltiobjective optimization using nondominated sorting in genetic algorithms
Evolutionary Computation
Properties of an adaptive archiving algorithm for storing nondominated vectors
IEEE Transactions on Evolutionary Computation
Performance assessment of multiobjective optimizers: an analysis and review
IEEE Transactions on Evolutionary Computation
Reducing the run-time complexity of multiobjective EAs: The NSGA-II and other algorithms
IEEE Transactions on Evolutionary Computation
An efficient multi-objective evolutionary algorithm with steady-state replacement model
Proceedings of the 8th annual conference on Genetic and evolutionary computation
EMO'07 Proceedings of the 4th international conference on Evolutionary multi-criterion optimization
Hi-index | 0.01 |
Contemporary evolutionary multiobjective optimisation techniques are becoming increasingly focussed on the notions of archiving, explicit diversity maintenance and population-based Pareto ranking to achieve good approximations of the Pareto front. While it is certainly true that these techniques have been effective, they come at a significant complexity cost that ultimately limits their application to complex problems. This paper proposes a new model that moves away from explicit population-wide Pareto ranking, abandons both complex archiving and diversity measures and incorporates a continuous accretion-based approach that is divergent from the discretely generational nature of traditional evolutionary algorithms. Results indicate that the new approach, the Combative Accretion Model (CAM), achieves markedly better approximations than NSGA across a range of well-recognised test functions. Moreover, CAM is more efficient than NSGAII with respect to the number of comparisons (by an order of magnitude), while achieving comparable, and generally preferable, fronts.