244
Views
31
CrossRef citations to date
0
Altmetric
The International Conference on Engineering Optimization (EngOpt 2008)

Efficient evolutionary approach to approximate the Pareto-optimal set in multiobjective optimization, UPS-EMOA

&
Pages 841-858 | Received 30 Oct 2009, Accepted 26 Nov 2009, Published online: 09 Mar 2010
 

Abstract

Solving real-life engineering problems requires often multiobjective, global, and efficient (in terms of objective function evaluations) treatment. In this study, we consider problems of this type by discussing some drawbacks of the current methods and then introduce a new population-based multiobjective optimization algorithm UPS-EMOA which produces a dense (not limited to the population size) approximation of the Pareto-optimal set in a computationally effective manner.

Acknowledgements

We wish to thank Professor Kalyanmoy Deb and especially Mr Karthik Sindhya, for providing assistance with the use of NSGA-II and some test problems. We are also grateful to Dr Yi Cao for his great assistance with the Monte Carlo-based hypervolume estimation measure, as well as to Mr Saku Kukkonen for providing an implementation for the GD metric. Further, we want to thank Mr Sauli Ruuska for interesting discussions and implementation of the WFG toolkit and Mr Vesa Ojalehto for helping in some technical issues. This study was financially supported by the research grant from the Jenny and Antti Wihuri Foundation.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.