Genetic algorithm for multi-objective optimization using GDEA

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

Abstract

Recently, many genetic algorithms (GAs) have been developed as an approximate method to generate Pareto frontier (the set of Pareto optimal solutions) to multi-objective optimization problem. In multi-objective GAs, there are two important problems : how to assign a fitness for each individual, and how to make the diversified individuals. In order to overcome those problems, this paper suggests a new multi-objective GA using generalized data envelopment analysis (GDEA). Through numerical examples, the paper shows that the proposed method using GDEA can generate well-distributed as well as well-approximated Pareto frontiers with less number of function evaluations. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Yun, Y., Yoon, M., & Nakayama, H. (2005). Genetic algorithm for multi-objective optimization using GDEA. In Lecture Notes in Computer Science (Vol. 3612, pp. 409–416). Springer Verlag. https://doi.org/10.1007/11539902_49

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