Master of Science (MS)
First Committee Member
Number of Pages
The central issue in creating new genetic algorithms is the algorithm's crossover method. My focus is on a particular crossover known as the Edge Assembly Crossover, or EAX, by Nagata and Kobayashi. The basics of a what make up a genetic algorithm is reviewed. The traveling salesman problem is defined. The EAX as an algorithm within an algorithm is explained. The crossover's implementation is original and is listed. The use of the graphic user interface, TSP View, used to run algorithms is explained as well as the extensions to the interface that were implemented for this study. The results of running a genetic algorithm using the EAX against traveling salesman problems, with a focus on ATT532, is discussed and compared to runs using other optimization algorithms. The question of why EAX works is addressed with conjectures for a possible future research path.
Algorithms; Assembly; Crossover; Edge; Genetic; Problem; Salesman; Traveling
University of Nevada, Las Vegas
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 firstname.lastname@example.org and include clear identification of the work, preferably with URL.
Seppala, Dwain Alan, "Genetic algorithms for the traveling salesman problem using edge assembly crossovers" (2003). UNLV Retrospective Theses & Dissertations. 1542.
IN COPYRIGHT. For more information about this rights statement, please visit http://rightsstatements.org/vocab/InC/1.0/