A survey of decomposition methods for multi-objective optimization

45Citations
Citations of this article
32Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The multi-objective optimization methods are traditionally based on Pareto dominance or relaxed forms of dominance in order to achieve a representation of the Pareto front. However, the performance of traditional optimization methods decreases for those problems with more than three objectives to optimize. The decomposition of a multi-objective problem is an approach that transforms a multi-objective problem into many single-objective optimization problems, avoiding the need of any dominance form. This chapter provides a short review of the general framework, current research trends and future research topics on decomposition methods.

Cite

CITATION STYLE

APA

Santiago, A., Huacuja, H. J. F., Dorronsoro, B., Pecero, J. E., Santillan, C. G., Barbosa, J. J. G., & Monterrubio, J. C. S. (2014). A survey of decomposition methods for multi-objective optimization. Studies in Computational Intelligence, 547, 453–465. https://doi.org/10.1007/978-3-319-05170-3_31

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free