Solving hard multiobjective optimization problems using ε-constraint with cultured differential evolution

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

Abstract

In this paper, we propose the use of a mathematical programming technique called the ε-constraint method, hybridized with an evolutionary single-objective optimizer: the cultured differential evolution. The ε-constraint method uses the cultured differential evolution to produce one point of the Pareto front of a multiobjective optimization problem at each iteration. This approach is able to solve difficult multiobjective problems, relying on the efficiency of the single-objective optimizer, and on the fact that none of the two approaches (the mathematical programming technique or the evolutionary algorithm) are required to generate the entire Pareto front at once. The proposed approach is validated using several difficult multiobjective test problems, and our results are compared with respect to a multi-objective evolutionary algorithm representative of the state-of-the-art in the area: the NSGA-II. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Becerra, R. L., & Coello Coello, C. A. (2006). Solving hard multiobjective optimization problems using ε-constraint with cultured differential evolution. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4193 LNCS, pp. 543–552). Springer Verlag. https://doi.org/10.1007/11844297_55

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