Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in Entire DC Network
Genetic Algorithms For The Traveling Salesman Problem Using Edge Assembly Crossovers, Dwain Alan Seppala
Genetic Algorithms For The Traveling Salesman Problem Using Edge Assembly Crossovers, Dwain Alan Seppala
UNLV Retrospective Theses & Dissertations
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 …