The anteater analysis: a comparison of traveling salesman tour construction methods and their global frequencies
dc.contributor.author | Ourada, Shannon A., author | |
dc.contributor.author | Whitley, Darrell, advisor | |
dc.contributor.author | Ghosh, Sudipto, committee member | |
dc.contributor.author | Clegg, Benjamin, committee member | |
dc.date.accessioned | 2022-08-29T10:15:48Z | |
dc.date.available | 2022-08-29T10:15:48Z | |
dc.date.issued | 2022 | |
dc.description.abstract | For the Traveling Salesman Problem (TSP), many algorithms have been developed. These include heuristic solvers, such as nearest neighbors and ant colony optimization algorithms. In this work, the ATT48 and EIL101 instances are examined to better understand the difference between biased and unbiased methods of tour construction algorithms when combined with the 2-opt local search operator. First, a sample of tours are constructed. Then, we examine the frequencies of global edges of different sizes using n-grams. Using 2-opt as the tour improvement algorithm, we analyze randomly initialized local optima compared to nearest neighbors local optima as well as ant colony solutions with and without 2-opt. This comparison serves to better understand the nature of these different methods in their relation to the global optimum. We also provide some ways the algorithms may be adapted to take advantage of the global frequencies, particularly the ant colony optimization algorithm. | |
dc.format.medium | born digital | |
dc.format.medium | masters theses | |
dc.identifier | Ourada_colostate_0053N_17240.pdf | |
dc.identifier.uri | https://hdl.handle.net/10217/235565 | |
dc.language | English | |
dc.language.iso | eng | |
dc.publisher | Colorado State University. Libraries | |
dc.relation.ispartof | 2020- | |
dc.rights | Copyright and other restrictions may apply. User is responsible for compliance with all applicable laws. For information about copyright law, please see https://libguides.colostate.edu/copyright. | |
dc.subject | graph algorithms | |
dc.subject | ant colony optimization (ACO) | |
dc.subject | traveling salesman problem (TSP) | |
dc.title | The anteater analysis: a comparison of traveling salesman tour construction methods and their global frequencies | |
dc.type | Text | |
dcterms.rights.dpla | This Item is protected by copyright and/or related rights (https://rightsstatements.org/vocab/InC/1.0/). You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use. For other uses you need to obtain permission from the rights-holder(s). | |
thesis.degree.discipline | Computer Science | |
thesis.degree.grantor | Colorado State University | |
thesis.degree.level | Masters | |
thesis.degree.name | Master of Science (M.S.) |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Ourada_colostate_0053N_17240.pdf
- Size:
- 2.64 MB
- Format:
- Adobe Portable Document Format