Path: utzoo!utgpu!news-server.csri.toronto.edu!dgp.toronto.edu!elf
Newsgroups: comp.graphics
From: elf@dgp.toronto.edu (Eugene Fiume)
Subject: Re: Simulated Annealing (QUERY)
Message-ID: <1990May4.093929.17025@jarvis.csri.toronto.edu>
Organization: CSRI, University of Toronto
References: <2183@awdprime.UUCP> <11390030@hpldola.HP.COM> <578@ghidrah.tessi.UUCP> <1990May2.205156.21471@ux1.cso.uiuc.edu>
Date: 4 May 90 13:39:29 GMT
Lines: 23

In article <1990May2.205156.21471@ux1.cso.uiuc.edu> page@ferrari.ece.uiuc.edu.UUCP (Ward Page) writes:
>
>Please post a summary.  I am also interested in any references on
>simulated annealing.
>
The standard reference is:
	N. Metropolis, A. Rosenbluth, M. Rosenbluth, A. Teller, E. Teller,
	"Equations of state calcuations by fast computing machines",
	Journal of Chemical Physics 21, 1087-1091 (1953).

More recent, topical and controversial is:
	S. Kirkpatrick, C.D. Gelatt Jr., M.P. Vecchi, "Optimization by
	Simulated Annealing", Science 220, 4598 (May 1983), 671-680.

For an application (and I cite this only because it's a simpleminded
application--I did it with my own two hands!), you might check out:
	E. Fiume and M. Ouellette, "On distributed, probabilistic
	algorithms for computer graphics", Proceedings of Graphics Interface
	'89 [Morgan Kaufmann Publishers], 211-218.
-- 
Eugene Fiume, Dynamic Graphics Project
Department of Computer Science, University of Toronto
elf@dgp.toronto.edu, (416) 978-5472