Specification of genetic search directions in cellular multi-objective genetic algorithms

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

Abstract

When we try to implement a multi-objective genetic algorithm (MOGA) with variable weights for finding a set of Pareto optimal solutions, one difficulty lies in determining appropriate search directions for genetic search. In our MOGA, a weight value for each objective in a scalar fitness function was randomly specified. Based on the fitness function with the randomly specified weight values, a pair of parent solutions are selected for generating a new solution by genetic operations. In order to find a variety of Pareto optimal solutions of a multi-objective optimization problem, weight vectors should be distributed uniformly on the Pareto optimal surface. In this paper, we propose a proportional weight specification method for our MOGA and its variants. We apply the proposed weight specification method to our MOGA and a cellular MOGA for examining its effect on their search ability.

Cite

CITATION STYLE

APA

Murata, T., Ishibuchi, H., & Gen, M. (2001). Specification of genetic search directions in cellular multi-objective genetic algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1993, pp. 82–95). Springer Verlag. https://doi.org/10.1007/3-540-44719-9_6

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