Deb, Kalyanmoy (1999) Multi-objective genetic algorithms: problem difficulties and construction of test problems Evolutionary Computation, 7 (3). pp. 205-230. ISSN 1063-6560
|
PDF
- Publisher Version
3MB |
Official URL: http://www.mitpressjournals.org/doi/abs/10.1162/ev...
Related URL: http://dx.doi.org/10.1162/evco.1999.7.3.205
Abstract
In this paper, we study the problem features that may cause a multi-objective genetic algorithm (GA) difficulty in converging 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, isolation, 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. More importantly, these difficult test problems will enable researchers to test their algorithms for specific aspects of multi-objective optimization.
Item Type: | Article |
---|---|
Source: | Copyright of this article belongs to MIT Press. |
ID Code: | 9408 |
Deposited On: | 02 Nov 2010 12:16 |
Last Modified: | 16 May 2016 19:13 |
Repository Staff Only: item control page