Date of Award

1999

Degree Type

Thesis

Degree Name

M.Sc.

Department

Computer Science

First Advisor

Bandyopadhyay, S.

Keywords

Computer Science.

Rights

CC BY-NC-ND 4.0

Abstract

Genetic algorithms are a powerful tool for solving search and optimization problems. We examine the problems associated with applying a genetic algorithm and develop a new computer program to facilitate the rapid application of genetic algorithms. This system is intended to function as a test bed for GA research or as a general purpose solution mechanism. Our approach is to place all of the common non-problem specific logic in a menu driven testbed program. The problem specific objective function is created separately by the user and is treated as an external program. The testbed program is capable of interfacing with the external objective function whenever necessary. Maximum flexibility in applying genetic algorithms is obtained by making the testbed program platform independent and by allowing the external objective function to be created by any programming tool available for the desired platform. Using these design goals we have developed an extremely flexible and easy to use tool for applying genetic algorithms to any desired problem area. Paper copy at Leddy Library: Theses & Major Papers - Basement, West Bldg. / Call Number: Thesis1998 .W55. Source: Masters Abstracts International, Volume: 39-02, page: 0534. Adviser: Subir Bandyopadhyay. Thesis (M.Sc.)--University of Windsor (Canada), 1999.

Share

COinS