A note on the effect of neighborhood structure in simulated annealing

Kah Mun Cheh, Jeffrey B. Goldberg, Ronald Askin

Research output: Contribution to journalArticle

29 Citations (Scopus)

Abstract

The simulated annealing method is a neighborhood search algorithm that can be used as a heuristic for many combinatorial problems. Recent research has concentrated on the viability of the approach and the appropriate algorithm parameter settings to use in implementation. In this note we consider a problem specific parameter; the neighborhood structure. We motivate the importance of considering the neighborhood by appealing to results on the convergence rate of simulated annealing and previous empirical results. We test several neighborhood structures on four different problems: the traveling salesman problem, the quadratic assignment problem, the quadratic selection problem and the stochastic quadratic selection problem. Our results suggest that for these problem classes and the particular annealing schedule used, small neighborhoods are better.

Original languageEnglish (US)
Pages (from-to)537-547
Number of pages11
JournalComputers and Operations Research
Volume18
Issue number6
DOIs
StatePublished - 1991

Fingerprint

Simulated annealing
Simulated Annealing
Traveling salesman problem
Annealing
Quadratic Assignment Problem
Neighborhood Search
Combinatorial Problems
Travelling salesman problems
Viability
Search Algorithm
Rate of Convergence
Schedule
salesman
Heuristics
heuristics
Quadratic assignment problem
Rate of convergence
Empirical results

ASJC Scopus subject areas

  • Information Systems and Management
  • Management Science and Operations Research
  • Applied Mathematics
  • Modeling and Simulation
  • Transportation

Cite this

A note on the effect of neighborhood structure in simulated annealing. / Cheh, Kah Mun; Goldberg, Jeffrey B.; Askin, Ronald.

In: Computers and Operations Research, Vol. 18, No. 6, 1991, p. 537-547.

Research output: Contribution to journalArticle

Cheh, Kah Mun ; Goldberg, Jeffrey B. ; Askin, Ronald. / A note on the effect of neighborhood structure in simulated annealing. In: Computers and Operations Research. 1991 ; Vol. 18, No. 6. pp. 537-547.
@article{183059a9974643f8be97cddcf2ce17e5,
title = "A note on the effect of neighborhood structure in simulated annealing",
abstract = "The simulated annealing method is a neighborhood search algorithm that can be used as a heuristic for many combinatorial problems. Recent research has concentrated on the viability of the approach and the appropriate algorithm parameter settings to use in implementation. In this note we consider a problem specific parameter; the neighborhood structure. We motivate the importance of considering the neighborhood by appealing to results on the convergence rate of simulated annealing and previous empirical results. We test several neighborhood structures on four different problems: the traveling salesman problem, the quadratic assignment problem, the quadratic selection problem and the stochastic quadratic selection problem. Our results suggest that for these problem classes and the particular annealing schedule used, small neighborhoods are better.",
author = "Cheh, {Kah Mun} and Goldberg, {Jeffrey B.} and Ronald Askin",
year = "1991",
doi = "10.1016/0305-0548(91)90059-Z",
language = "English (US)",
volume = "18",
pages = "537--547",
journal = "Computers and Operations Research",
issn = "0305-0548",
publisher = "Elsevier Limited",
number = "6",

}

TY - JOUR

T1 - A note on the effect of neighborhood structure in simulated annealing

AU - Cheh, Kah Mun

AU - Goldberg, Jeffrey B.

AU - Askin, Ronald

PY - 1991

Y1 - 1991

N2 - The simulated annealing method is a neighborhood search algorithm that can be used as a heuristic for many combinatorial problems. Recent research has concentrated on the viability of the approach and the appropriate algorithm parameter settings to use in implementation. In this note we consider a problem specific parameter; the neighborhood structure. We motivate the importance of considering the neighborhood by appealing to results on the convergence rate of simulated annealing and previous empirical results. We test several neighborhood structures on four different problems: the traveling salesman problem, the quadratic assignment problem, the quadratic selection problem and the stochastic quadratic selection problem. Our results suggest that for these problem classes and the particular annealing schedule used, small neighborhoods are better.

AB - The simulated annealing method is a neighborhood search algorithm that can be used as a heuristic for many combinatorial problems. Recent research has concentrated on the viability of the approach and the appropriate algorithm parameter settings to use in implementation. In this note we consider a problem specific parameter; the neighborhood structure. We motivate the importance of considering the neighborhood by appealing to results on the convergence rate of simulated annealing and previous empirical results. We test several neighborhood structures on four different problems: the traveling salesman problem, the quadratic assignment problem, the quadratic selection problem and the stochastic quadratic selection problem. Our results suggest that for these problem classes and the particular annealing schedule used, small neighborhoods are better.

UR - http://www.scopus.com/inward/record.url?scp=0025903204&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0025903204&partnerID=8YFLogxK

U2 - 10.1016/0305-0548(91)90059-Z

DO - 10.1016/0305-0548(91)90059-Z

M3 - Article

VL - 18

SP - 537

EP - 547

JO - Computers and Operations Research

JF - Computers and Operations Research

SN - 0305-0548

IS - 6

ER -