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.
| Identifer | oai:union.ndltd.org:arizona.edu/oai:arizona.openrepository.com:10150/277156 |
| Date | January 1989 |
| Creators | Cheh, Kah Mun, 1965-, Cheh, Kah Mun, 1965- |
| Contributors | Askin, Ronald G., Goldberg, Jeffrey B. |
| Publisher | The University of Arizona. |
| Source Sets | University of Arizona |
| Language | en_US |
| Detected Language | English |
| Type | text, Thesis-Reproduction (electronic) |
| 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. |
Page generated in 0.0019 seconds