Dynamic point relocation: An enhancement for traveling salesman problem initial tour construction procedures
| dc.contributor.advisor | Rozenblit, Jerzy W. | en_US |
| dc.contributor.author | Gale, Andrew Dent, 1955- | |
| dc.creator | Gale, Andrew Dent, 1955- | en_US |
| dc.date.accessioned | 2013-05-16T09:51:31Z | |
| dc.date.available | 2013-05-16T09:51:31Z | |
| dc.date.issued | 1993 | en_US |
| dc.identifier.uri | http://hdl.handle.net/10150/292024 | |
| dc.description.abstract | Traditional solving techniques for the traveling salesman problem are carried out in two phases. First an initial tour is constructed, then this tour is improved using some form of optimization. The procedure introduced in this research applies a simple optimization technique which minimally increases the runtime of the initial tour construction procedure. At the same time it greatly improves the quality of the tour which is constructed. It does this by globally searching the tour after each insertion for points which require repositioning and performing point relocations where necessary. | |
| dc.language.iso | en_US | en_US |
| dc.publisher | The University of Arizona. | en_US |
| dc.rights | Copyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author. | en_US |
| dc.subject | Engineering, Electronics and Electrical. | en_US |
| dc.title | Dynamic point relocation: An enhancement for traveling salesman problem initial tour construction procedures | en_US |
| dc.type | text | en_US |
| dc.type | Thesis-Reproduction (electronic) | en_US |
| thesis.degree.grantor | University of Arizona | en_US |
| thesis.degree.level | masters | en_US |
| dc.identifier.proquest | 1352353 | en_US |
| thesis.degree.discipline | Graduate College | en_US |
| thesis.degree.discipline | Electrical and Computer Engineering | en_US |
| thesis.degree.name | M.S. | en_US |
| dc.identifier.bibrecord | .b27051304 | en_US |
| refterms.dateFOA | 2018-06-16T09:17:06Z | |
| html.description.abstract | Traditional solving techniques for the traveling salesman problem are carried out in two phases. First an initial tour is constructed, then this tour is improved using some form of optimization. The procedure introduced in this research applies a simple optimization technique which minimally increases the runtime of the initial tour construction procedure. At the same time it greatly improves the quality of the tour which is constructed. It does this by globally searching the tour after each insertion for points which require repositioning and performing point relocations where necessary. |
