Persistent Link:
http://hdl.handle.net/10150/277156
Title:
The effect of neighborhood structure on simulated annealing
Author:
Cheh, Kah Mun, 1965-
Issue Date:
1989
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:
This thesis investigates the effect of neighborhood structure on simulated annealing, a random search algorithm that has the ability to search through a sequence of local optimal solutions and return the globally optimal solution. Neighborhood sizes of one, two, three, four and N (equal to the size of the problem) decision variable alterations have been experimentally tested on the following problem types: Quadratic Assignment problem; Quadratic Selection problem; Stochastic Optimization problem; and Traveling Salesman problem. Empirical results indicate that a smaller neighborhood size is better. However, for some instances, a neighborhood size of one larger than the smallest defined neighborhood size performed best.
Type:
text; Thesis-Reproduction (electronic)
Keywords:
Simulated annealing (Mathematics); Problem solving.
Degree Name:
M.S.
Degree Level:
masters
Degree Program:
Graduate College; Systems & Industrial Engineering
Degree Grantor:
University of Arizona
Advisor:
Askin, Ronald G.; Goldberg, Jeffrey B.

Full metadata record

DC FieldValue Language
dc.language.isoen_USen_US
dc.titleThe effect of neighborhood structure on simulated annealingen_US
dc.creatorCheh, Kah Mun, 1965-en_US
dc.contributor.authorCheh, Kah Mun, 1965-en_US
dc.date.issued1989en_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.abstractThis thesis investigates the effect of neighborhood structure on simulated annealing, a random search algorithm that has the ability to search through a sequence of local optimal solutions and return the globally optimal solution. Neighborhood sizes of one, two, three, four and N (equal to the size of the problem) decision variable alterations have been experimentally tested on the following problem types: Quadratic Assignment problem; Quadratic Selection problem; Stochastic Optimization problem; and Traveling Salesman problem. Empirical results indicate that a smaller neighborhood size is better. However, for some instances, a neighborhood size of one larger than the smallest defined neighborhood size performed best.en_US
dc.description.noteDigitization note: pgs. 197 & 376 missing from paper original.-
dc.typetexten_US
dc.typeThesis-Reproduction (electronic)en_US
dc.subjectSimulated annealing (Mathematics)en_US
dc.subjectProblem solving.en_US
thesis.degree.nameM.S.en_US
thesis.degree.levelmastersen_US
thesis.degree.disciplineGraduate Collegeen_US
thesis.degree.disciplineSystems & Industrial Engineeringen_US
thesis.degree.grantorUniversity of Arizonaen_US
dc.contributor.advisorAskin, Ronald G.en_US
dc.contributor.advisorGoldberg, Jeffrey B.en_US
dc.identifier.proquest1339034en_US
dc.identifier.oclc23361086en_US
dc.identifier.bibrecord.b17620776en_US
All Items in UA Campus Repository are protected by copyright, with all rights reserved, unless otherwise indicated.