The quickhull algorithm for convex hulls
ACM Transactions on Mathematical Software (TOMS)
ISDA '05 Proceedings of the 5th International Conference on Intelligent Systems Design and Applications
Computational Geometry: Algorithms and Applications
Computational Geometry: Algorithms and Applications
Reliability-based multi-objective optimization using evolutionary algorithms
EMO'07 Proceedings of the 4th international conference on Evolutionary multi-criterion optimization
EMO'07 Proceedings of the 4th international conference on Evolutionary multi-criterion optimization
Handling uncertainties in evolutionary multi-objective optimization
WCCI'08 Proceedings of the 2008 IEEE world conference on Computational intelligence: research frontiers
A preliminary study on handling uncertainty in indicator-based multiobjective optimization
EuroGP'06 Proceedings of the 2006 international conference on Applications of Evolutionary Computing
Multiobjective evolutionary algorithm for the optimization of noisy combustion processes
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
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
Evolutionary optimization in uncertain environments-a survey
IEEE Transactions on Evolutionary Computation
A general noise model and its effects on evolution strategy performance
IEEE Transactions on Evolutionary Computation
New uncertainty handling strategies in multi-objective evolutionary optimization
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part II
Uncertainty based evolutionary optimisation
Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
Hi-index | 0.00 |
Noisy environments are a challenging task for multiobjective evolutionary algorithms. The algorithms may be trapped in local optima or even become a random search in the decision and objective space. In the course of the paper the classical definition of Pareto-dominance is enhanced subject to noisy objective functions in order to make the evolutionary search process more robust and to generate a reliable Pareto front. At each point in the decision space the objective functions are evaluated a fixed number of times and the convex hull of the objective function vectors is computed. Expectation is associated with the median of the objective function values while uncertainty is reflected by the average distance of the median in each dimension to the points defining the convex hull. By combining these two indicators a new concept of Pareto-dominance is set up. An implementation in NSGA-II and application to test problems show a gain in robustness and search quality.