Dynamic point relocation: An enhancement for traveling salesman problem initial tour construction procedures

Persistent Link:
http://hdl.handle.net/10150/292024
Title:
Dynamic point relocation: An enhancement for traveling salesman problem initial tour construction procedures
Author:
Gale, Andrew Dent, 1955-
Issue Date:
1993
Publisher:
The University of Arizona.
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.
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.
Type:
text; Thesis-Reproduction (electronic)
Keywords:
Engineering, Electronics and Electrical.
Degree Name:
M.S.
Degree Level:
masters
Degree Program:
Graduate College; Electrical and Computer Engineering
Degree Grantor:
University of Arizona
Advisor:
Rozenblit, Jerzy W.

Full metadata record

DC FieldValue Language
dc.language.isoen_USen_US
dc.titleDynamic point relocation: An enhancement for traveling salesman problem initial tour construction proceduresen_US
dc.creatorGale, Andrew Dent, 1955-en_US
dc.contributor.authorGale, Andrew Dent, 1955-en_US
dc.date.issued1993en_US
dc.publisherThe University of Arizona.en_US
dc.rightsCopyright © 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.description.abstractTraditional 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.en_US
dc.typetexten_US
dc.typeThesis-Reproduction (electronic)en_US
dc.subjectEngineering, Electronics and Electrical.en_US
thesis.degree.nameM.S.en_US
thesis.degree.levelmastersen_US
thesis.degree.disciplineGraduate Collegeen_US
thesis.degree.disciplineElectrical and Computer Engineeringen_US
thesis.degree.grantorUniversity of Arizonaen_US
dc.contributor.advisorRozenblit, Jerzy W.en_US
dc.identifier.proquest1352353en_US
dc.identifier.bibrecord.b27051304en_US
All Items in UA Campus Repository are protected by copyright, with all rights reserved, unless otherwise indicated.