Multi-objective Genetic Algorithms : Problem Difficulties and Construction of Test Problems
| dc.contributor.author | Deb-Kanpur, Kalyanmoy | de |
| dc.date.accessioned | 2004-12-07T08:19:50Z | |
| dc.date.available | 2004-12-07T08:19:50Z | |
| dc.date.created | 1998 | de |
| dc.date.issued | 2001-10-16 | de |
| dc.description.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. | en |
| dc.format.extent | 3084525 bytes | |
| dc.format.extent | 7929856 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.uri | http://hdl.handle.net/2003/5359 | |
| dc.identifier.uri | http://dx.doi.org/10.17877/DE290R-5636 | |
| dc.language.iso | en | de |
| dc.publisher | Universität Dortmund | de |
| dc.relation.ispartofseries | Reihe Computational Intelligence ; 49 | de |
| dc.subject.ddc | 004 | de |
| dc.title | Multi-objective Genetic Algorithms : Problem Difficulties and Construction of Test Problems | en |
| dc.type | Text | de |
| dc.type.publicationtype | report | |
| dcterms.accessRights | open access |