Please use this identifier to cite or link to this item:
|Scopus||Web of Science®||Altmetric|
|Title:||Approximating pareto-optimal sets using diversity strategies in evolutionary multi-objective optimization|
|Citation:||Advances in multi-objective nature inspired computing, 2010 / Coello Coello, C., Dhaenens, C., Jourdan, L. (ed./s), pp.23-44|
|Series/Report no.:||Studies in Computational Intelligence; vol. 272|
|Abstract:||Often the Pareto front of a multi-objective optimization problem grows exponentially with the problem size. In this case, it is not possible to compute the whole Pareto front efficiently and one is interested in good approximations. We consider how evolutionary algorithms can achieve such an approximation by using different diversity mechanisms. We discuss some well-known approaches such as the density estimator and the ε -dominance approach and point out when and how such mechanisms provably help to obtain a good approximation of the Pareto-optimal set.|
|Rights:||© Springer, Part of Springer Science+Business Media|
|Appears in Collections:||Computer Science publications|
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.