Performance evaluation and population reduction for a Self Adaptive Hybrid Genetic Algorithm (SAHGA)

Felipe P. Espinoza, Barbara S. Minsker, David E. Goldberg

Research output: Contribution to journalArticlepeer-review

Abstract

This paper examines the effects of local search on hybrid genetic algorithm performance and population sizing. It compares the performance of a self-adaptive hybrid genetic algorithm (SAHGA) to a non-adaptive hybrid genetic algorithm (NAHGA) and the simple genetic algorithm (SGA) on eight different test functions, including unimodal, multimodal and constrained optimization problems. The results show that the hybrid genetic algorithm substantially reduces required population sizes because of the reduction in population variance. The adaptive nature of the SAHGA algorithm together with the reduction in population size allow for faster solution of the test problems without sacrificing solution quality.

Original languageEnglish (US)
Pages (from-to)922-933
Number of pages12
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2723
DOIs
StatePublished - 2003
Externally publishedYes

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Performance evaluation and population reduction for a Self Adaptive Hybrid Genetic Algorithm (SAHGA)'. Together they form a unique fingerprint.

Cite this