Masters Theses
Date of Award
8-1990
Degree Type
Thesis
Degree Name
Master of Science
Major
Computer Science
Major Professor
Michael D. Vose
Abstract
This thesis presents a way to measure performance of simple genetic algorithm (SGA) and investigates the distribution of hard and easy problems for the SGA. We define a function that measures performance level of SGA by comparing best solution after each generation to the optimal solution. We test performance of SGA on random problems and investigate the relationship of the distribution of hard and easy problems to time, space, and performance.
Recommended Citation
Ma, Norman, "Performance of simple genetic algorithm on randomly generated problems. " Master's Thesis, University of Tennessee, 1990.
https://trace.tennessee.edu/utk_gradthes/12716
Files over 3MB may be slow to open. For best results, right-click and select "save as..."
COinS