Please use this identifier to cite or link to this item:
https://doi.org/10.1109/TEVC.2009.2017515
DC Field | Value | |
---|---|---|
dc.title | Multiobjective evolutionary algorithm with controllable focus on the knees of the pareto front | |
dc.contributor.author | Rachmawati, L. | |
dc.contributor.author | Srinivasan, D. | |
dc.date.accessioned | 2014-06-17T02:57:48Z | |
dc.date.available | 2014-06-17T02:57:48Z | |
dc.date.issued | 2009 | |
dc.identifier.citation | Rachmawati, L., Srinivasan, D. (2009). Multiobjective evolutionary algorithm with controllable focus on the knees of the pareto front. IEEE Transactions on Evolutionary Computation 13 (4) : 810-824. ScholarBank@NUS Repository. https://doi.org/10.1109/TEVC.2009.2017515 | |
dc.identifier.issn | 1089778X | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/56716 | |
dc.description.abstract | The optimal solutions of a multiobjective optimization problem correspond to a nondominated front that is characterized by a tradeoff between objectives. A knee region in this Pareto-optimal front, which is visually a convex bulge in the front, is important to decision makers in practical contexts, as it often constitutes the optimum in tradeoff, i.e., substitution of a given Pareto-optimal solution with another solution on the knee region yields the largest improvement per unit degradation. This paper presents a selection scheme that enables a multiobjective evolutionary algorithm (MOEA) to obtain a nondominated set with controllable concentration around existing knee regions of the Pareto front. The preference-based focus is achieved by optimizing a set of linear weighted sums of the original objectives, and control of the extent of the focus is attained by careful selection of the weight set based on a user-specified parameter. The fitness scheme could be easily adopted in any Pareto-based MOEA with little additional computational cost. Simulations on various two- and three-objective test problems demonstrate the ability of the proposed method to guide the population toward existing knee regions on the Pareto front. Comparison with general-purpose Pareto based MOEA demonstrates that convergence on the Pareto front is not compromised by imposing the preference-based bias. The performance of the method in terms of an additional performance metric introduced to measure the accuracy of resulting convergence on the desired regions validates the efficacy of the method. © 2009 IEEE. | |
dc.description.uri | http://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1109/TEVC.2009.2017515 | |
dc.source | Scopus | |
dc.subject | Genetic algorithms | |
dc.subject | Multiobjective evolutionary algorithm (MOEA) | |
dc.subject | Multiobjective optimization | |
dc.subject | Preference | |
dc.type | Article | |
dc.contributor.department | ELECTRICAL & COMPUTER ENGINEERING | |
dc.description.doi | 10.1109/TEVC.2009.2017515 | |
dc.description.sourcetitle | IEEE Transactions on Evolutionary Computation | |
dc.description.volume | 13 | |
dc.description.issue | 4 | |
dc.description.page | 810-824 | |
dc.description.coden | ITEVF | |
dc.identifier.isiut | 000269155700011 | |
Appears in Collections: | Staff Publications |
Show simple item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.