Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If You Use a Screen Reader

This content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.

Applications of the Annealing Algorithm to Combinatorial Problems in Statistics

M. Lundy
Biometrika
Vol. 72, No. 1 (Apr., 1985), pp. 191-198
Published by: Oxford University Press on behalf of Biometrika Trust
DOI: 10.2307/2336349
Stable URL: http://www.jstor.org/stable/2336349
Page Count: 8
  • Read Online (Free)
  • Subscribe ($19.50)
  • Cite this Item
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Applications of the Annealing Algorithm to Combinatorial Problems in Statistics
Preview not available

Abstract

There are several problems in statistics which can be formulated so that the desired solution is the global minimum of some explicitly defined objective function. In many cases the number of candidate solutions increases exponentially with the size of the problem making exhaustive search impossible, but descent procedures, devised to reduce the number of solutions examined, can terminate with local minima. In this paper we describe the annealing algorithm, a widely applicable stochastic search procedure which can escape local optima, and we use the evolutionary tree problem to illustrate the method of application.

Page Thumbnails

  • Thumbnail: Page 
191
    191
  • Thumbnail: Page 
192
    192
  • Thumbnail: Page 
193
    193
  • Thumbnail: Page 
194
    194
  • Thumbnail: Page 
195
    195
  • Thumbnail: Page 
196
    196
  • Thumbnail: Page 
197
    197
  • Thumbnail: Page 
198
    198