Dynamic point relocation: An enhancement for traveling salesman problem initial tour construction procedures
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
textThesis-Reproduction (electronic)
Degree Name
M.S.Degree Level
mastersDegree Program
Graduate CollegeElectrical and Computer Engineering