"The Hybrid Genetic Algorithm is developed that out performs a simple genetic algorithm in almost all problems that are presented. The Hybrid Genetic Algorithm is described in detail: pseudo-code is provided for it. and for many of the operators and algorithms presented. Advance operators such as inversion, preselection, and uniform crossover are used by the Hybrid Genetic Algorithm. Simulated annealing is used to initialize the population, and hill climbing is used to search locally for a solution. Eight problems of different levels of complexity arc used to compare the simple genetic algorithm and the Hybrid Genetic Algorithm"--Abstract, page iii.
Wilkerson, Kelley R.
St. Clair, Daniel C.
Dagli, Cihan H., 1949-
M.S. in Computer Science
University of Missouri--Rolla
x, 71 pages
© 2000 Billy Charles Earney II, All rights reserved.
Thesis - Restricted Access
Print OCLC #
Electronic OCLC #
Link to Catalog Record
Electronic access to the full-text of this document is restricted to Missouri S&T users. Otherwise, request this publication directly from Missouri S&T Library or contact your local library.http://merlin.lib.umsystem.edu/record=b4444277~S5
Earney, Billy Charles II, "Performance comparison between a simple genetic algorithm and a Hybrid Genetic Algorithm" (2000). Masters Theses. 1934.
Share My Thesis If you are the author of this work and would like to grant permission to make it openly accessible to all, please click the button above.