×

GAHC

swMATH ID: 2734
Software Authors: Matousek, Radomil
Description: This paper introduces a novel improved evolutionary algorithm, which combines genetic algorithms and hill climbing. Genetic Algorithms (GA) belong to a class of well established optimization meta-heuristics and their behavior are studied and analyzed in great detail. Various modifications were proposed by different researchers, for example modifications to the mutation operator. These modifications usually change the overall behavior of the algorithm. This paper presents a binary GA with a modified mutation operator, which is based on the well-known Hill Climbing Algorithm (HCA). The resulting algorithm, referred to as GAHC, also uses an elite tournament selection operator. This selection operator preserves the best individual from the GA population during the selection process while maintaining the positive characteristics of the standard tournament selection. This paper discusses the GAHC algorithm and compares its performance wit! h standard GA.
Homepage: http://www.springerlink.com/content/t1q3560850kn1704/fulltext.pdf
Programming Languages: None
Operating Systems: None
Dependencies: None
Keywords: genetic algorithm; HC mutation; hill climbing algorithm
Related Software: HC12; Simulink; MersenneTwister; COIN-OR; CONOPT; Matlab; BARON
Cited in: 5 Publications

Standard Articles

1 Publication describing the Software, including 1 Publication in zbMATH Year
GAHC: Hybrid genetic algorithm. Zbl 1160.68509
Matousek, Radomil
2009

Citations by Year