Computer Science – Neural and Evolutionary Computing
Scientific paper
2009-08-20
in Hod Lipson (Ed.): Genetic and Evolutionary Computation Conference, GECCO 2007, Proceedings, London, England, UK, July 7-11,
Computer Science
Neural and Evolutionary Computing
8 pages, 2 tables
Scientific paper
The research area of evolutionary multiobjective optimization (EMO) is reaching better understandings of the properties and capabilities of EMO algorithms, and accumulating much evidence of their worth in practical scenarios. An urgent emerging issue is that the favoured EMO algorithms scale poorly when problems have many (e.g. five or more) objectives. One of the chief reasons for this is believed to be that, in many-objective EMO search, populations are likely to be largely composed of nondominated solutions. In turn, this means that the commonly-used algorithms cannot distinguish between these for selective purposes. However, there are methods that can be used validly to rank points in a nondominated set, and may therefore usefully underpin selection in EMO search. Here we discuss and compare several such methods. Our main finding is that simple variants of the often-overlooked Average Ranking strategy usually outperform other methods tested, covering problems with 5-20 objectives and differing amounts of inter-objective correlation.
Corne David
Knowles Joshua
No associations
LandOfFree
Techniques for Highly Multiobjective Optimisation: Some Nondominated Points are Better than Others does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Techniques for Highly Multiobjective Optimisation: Some Nondominated Points are Better than Others, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Techniques for Highly Multiobjective Optimisation: Some Nondominated Points are Better than Others will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-666080