CCE Theses and Dissertations

Date of Award

2010

Document Type

Dissertation

Degree Name

Doctor of Philosophy in Computer Science (CISD)

Department

Graduate School of Computer and Information Sciences

Advisor

Michael J. Lazlo

Committee Member

James Cannady

Committee Member

Sumitra Mukherjee

Keywords

Algorithms, Functional, Genetic, Niche, Optimization

Abstract

The problem of multimodal functional optimization has been addressed by much research producing many different search techniques. Niche Genetic Algorithms is one area that has attempted to solve this problem. Many Niche Genetic Algorithms use some type of radius. When multiple optima occur within the radius, these algorithms have a difficult time locating them. Problems that have arbitrarily close optima create a greater problem. This paper presents a new Niche Genetic Algorithm framework called Dynamic-radius Species-conserving Genetic Algorithm. This new framework extends existing Genetic Algorithm research.

This new framework enhances an existing Niche Genetic Algorithm in two ways. As the name implies the radius of the algorithm varies during execution. A uniform radius can cause issues if it is not set correctly during initialization. A dynamic radius compensates for these issues. The framework does not attempt to locate all of the optima in a single pass. It attempts to find some optima and then uses a tabu list to exclude those areas of the domain for future iterations. To exclude these previously located optima, the framework uses a fitness sharing approach and a seed exclusion approach. This new framework addresses many areas of difficulty in current multimodal functional optimization research.

This research used the experimental research methodology. A series of classic benchmark functional optimization problems were used to compare this framework to other algorithms. These other algorithms represented classic and current Niche Genetic Algorithms.

Results from this research show that this new framework does very well in locating optima in a variety of benchmark functions. In functions that have arbitrarily close optima, the framework outperforms other algorithms. Compared to other Niche Genetic Algorithms the framework does equally well in locating optima that are not arbitrarily close. Results indicate that varying the radius during execution and the use of a tabu list assists in solving functional optimization problems for continuous functions that have arbitrarily close optima.

Download
Share Feedback

Share

COinS