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 need an accessible version of this item please contact JSTOR User Support

Generalized Simulated Annealing for Function Optimization

Ihor O. Bohachevsky, Mark E. Johnson and Myron L. Stein
Technometrics
Vol. 28, No. 3 (Aug., 1986), pp. 209-217
DOI: 10.2307/1269076
Stable URL: http://www.jstor.org/stable/1269076
Page Count: 9
  • Download ($14.00)
  • Cite this Item
If you need an accessible version of this item please contact JSTOR User Support
Generalized Simulated Annealing for Function Optimization
Preview not available

Abstract

A generalized simulated annealing method has been developed and applied to the optimization of functions (possibly constrained) having many local extrema. The method is illustrated in some difficult pedagogical examples and used to solve a problem analyzed by Bates (Technometrics, 25, pp. 373-376, 1983), for which we identify an improved optimum. The sensitivity of the solution to changes in the constraints and in other specifications of the problem is analyzed and discussed

Page Thumbnails

  • Thumbnail: Page 
209
    209
  • Thumbnail: Page 
210
    210
  • Thumbnail: Page 
211
    211
  • Thumbnail: Page 
212
    212
  • Thumbnail: Page 
213
    213
  • Thumbnail: Page 
214
    214
  • Thumbnail: Page 
215
    215
  • Thumbnail: Page 
216
    216
  • Thumbnail: Page 
217
    217