Design issues in a multiobjective cellular genetic algorithm

  • Authors:

  • Antonio J. Nebro;Juan J. Durillo;Francisco Luna;Bernabé Dorronsoro;Enrique Alba

  • Affiliations:

  • Departamento de Lenguajes y Ciencias de la Computación, E.T.S. Ingeniería Informática, Málaga, Spain;Departamento de Lenguajes y Ciencias de la Computación, E.T.S. Ingeniería Informática, Málaga, Spain;Departamento de Lenguajes y Ciencias de la Computación, E.T.S. Ingeniería Informática, Málaga, Spain;Departamento de Lenguajes y Ciencias de la Computación, E.T.S. Ingeniería Informática, Málaga, Spain;Departamento de Lenguajes y Ciencias de la Computación, E.T.S. Ingeniería Informática, Málaga, Spain

  • Venue:
  • EMO'07 Proceedings of the 4th international conference on Evolutionary multi-criterion optimization
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we study a number of issues related to the design of a cellular genetic algorithm (cGA) for multiobjective optimization. We take as an starting point an algorithm following the canonical cGA model, i.e., each individual interacts with those ones belonging to its neighborhood, so that a new individual is obtained using the typical selection, crossover, and mutation operators within this neighborhood. An external archive is used to store the non-dominated solutions found during the evolution process. With this basic model in mind, there are many different design issues that can be faced. Among them, we focus here on the synchronous/asynchronous feature of the cGA, the feedback of the search experience contained in the archive into the algorithm, and two different replacement strategies. We evaluate the resulting algorithms using a benchmark of problems and compare the best of them against two state-of-the-art genetic algorithms for multiobjective optimization. The obtained results indicate that the cGA model is a promising approach to solve this kind of problem.