Publicação: Global optimization using a genetic algorithm with hierarchically structured population
Nenhuma Miniatura disponível
Data
2014-05-01
Orientador
Coorientador
Pós-graduação
Curso de graduação
Título da Revista
ISSN da Revista
Título de Volume
Editor
Elsevier B.V.
Tipo
Artigo
Direito de acesso
Acesso restrito
Resumo
This paper applies a genetic algorithm with hierarchically structured population to solve unconstrained optimization problems. The population has individuals distributed in several overlapping clusters, each one with a leader and a variable number of support individuals. The hierarchy establishes that leaders must be fitter than its supporters with the topological organization of the clusters following a tree. Computational tests evaluate different population structures, population sizes and crossover operators for better algorithm performance. A set of known benchmark test problems is solved and the results found are compared with those obtained from other methods described in the literature, namely, two genetic algorithms, a simulated annealing, a differential evolution and a particle swarm optimization. The results indicate that the method employed is capable of achieving better performance than the previous approaches in regard as the two criteria usually employed for comparisons: the number of function evaluations and rate of success. The method also has a superior performance if the number of problems solved is taken into account. (C) 2013 Elsevier B.V. All rights reserved.
Descrição
Idioma
Inglês
Como citar
Journal Of Computational And Applied Mathematics. Amsterdam: Elsevier Science Bv, v. 261, p. 341-351, 2014.