Introducing user preference using Desirability Functions in Multi-Objective Evolutionary Optimisation of noisy processes
Authors:
- 1 September 2007
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 1089778X,p. 2687-2694
Abstract
Multi-objective evolutionary algorithms (MOEAs) are generally designed to find a well spread Pareto-front approximation. Often, only a small section of this front may be of practical interest. Desirability functions (DFs) are able to describe user preferences intuitively. Furthermore, DFs can be attached to any fitness function easily. This way, desirability functions can help in guiding MOEAs without introducing additional restrictions or changes to the algorithm. The application of noisy fitness functions is not straight forward but relevant to many real-world problems. Therefore, a variant of Harrington's one-sided desirability function using expectations is introduced which takes noise into account. A deterministic strategy as well as the XSGA-II are used in combination with DF to solve a noisy Binh problem and a noisy cost estimation problem for turning processes.Keywords
This publication has 6 references indexed in Scilit:
- Optimal Design of a Molecular Recognizer: Molecular Recognition as a Bayesian Signal Detection ProblemIEEE Journal of Selected Topics in Signal Processing, 2008
- Noise Handling in Evolutionary Multi-Objective Optimization2006
- On the distribution of the desirability index using Harrington’s desirability functionMetrika, 2005
- Evolutionary Optimization in Uncertain Environments—A SurveyIEEE Transactions on Evolutionary Computation, 2005
- A fast and elitist multiobjective genetic algorithm: NSGA-IIIEEE Transactions on Evolutionary Computation, 2002
- Further Results on a Distribution of Meinhold and SingpurwallaThe American Statistician, 1989