Authors: | Deb-Kanpur, Kalyanmoy |
Title: | Multi-objective Genetic Algorithms : Problem Difficulties and Construction of Test Problems |
Language (ISO): | en |
Abstract: | In this paper, we study the problem features that may cause a multi-objective genetic algorithm (GA) difficulty to converge to the true Pareto-optimal front. Identification of such features helps us develop difficult test problems for multi-objective optimization. Multi-objective test problems are constructed from single-objective optimization problems, thereby allowing known difficult features of single-objective problems (such as multi-modality or deception) to be directly transferred to the corresponding multi-objective problem. In addition, test problems having features specific to multi-objective optimization are also constructed. The construction methodology allows a simpler way to develop test problems having other difficult and interesting problem features. More importantly, these difficult test problems will enable researchers to test their algorithms for specific aspects of multi-objective optimization in the coming years. |
URI: | http://hdl.handle.net/2003/5359 http://dx.doi.org/10.17877/DE290R-5636 |
Issue Date: | 2001-10-16 |
Provenance: | Universität Dortmund |
Appears in Collections: | Sonderforschungsbereich (SFB) 531 |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
ci44.ps | 7.74 MB | Postscript | View/Open | |
ci49.pdf | DNB | 3.01 MB | Adobe PDF | View/Open |
This item is protected by original copyright |
This item is protected by original copyright
rightsstatements.org