Award Date
1-1-1999
Degree Type
Thesis
Degree Name
Master of Science (MS)
Department
Computer Science
Number of Pages
92
Abstract
GAlib is a C++ library of genetic algorithm objects that was recently developed at the Massachusetts Institute of Technology. This thesis is to demonstrate its functionality and versatility for implementing haploid tripartite genetic algorithms; We first built a test bed in which GAlib could be used. To achieve this, we used GAlib to solve the Traveling Salesman Problem and implemented two-opt and simulated annealing for compariSon We then examined the use of genetic algorithms for finding loop invariants. We used GAlib successfully to build a model but results remain inconclusive; In our main thrust we applied genetic algorithms to train and develop neural networks. To develop neural network architectures we used two different methods of representing neural networks: connection matrices and graph-generation grammars. We were able to demonstrate that genetic algorithms are an effective tool for training networks as well as for finding network architectures.
Keywords
Algorithms; Galib; Genetic
Controlled Subject
Computer science; Artificial intelligence
File Format
File Size
3010.56 KB
Degree Grantor
University of Nevada, Las Vegas
Language
English
Permissions
If you are the rightful copyright holder of this dissertation or thesis and wish to have the full text removed from Digital Scholarship@UNLV, please submit a request to digitalscholarship@unlv.edu and include clear identification of the work, preferably with URL.
Repository Citation
Hendricks, Bradley John, "Genetic algorithms using Galib" (1999). UNLV Retrospective Theses & Dissertations. 1078.
http://dx.doi.org/10.25669/4suh-mbmc
Rights
IN COPYRIGHT. For more information about this rights statement, please visit http://rightsstatements.org/vocab/InC/1.0/
