Neighborhood Size in the Simulated Annealing Algorithm
Larry Joel Goldstein, Michael S. Waterman · American Journal of Mathematical and Management Sciences · 1988
SYNOPTIC ABSTRACTSimulated annealing is a probabilistic algorithm that has shown some promise when applied to combinatorially NP-hard problems. One advantage of the simulated annealing algorithm is that it is based on an analogy with statistical mechanics which is not problem-specific. However, any implementation of the algorithm for a given problem requires that several specific choices be made. The success or failure of the procedure may depend on these choices. In this study we explore the effect of choice of neighborhood size on the algorithm's performance when applied to the travelling salesman problem.