one of the first papers on the application of simulated annealing to
np-hard problems (which used approximate solution of the travelling
salesman problem as an extended example) was by kirkpatrick, 1983,
published in science, and is a good reference. you can find the paper
(in ps and pdf), a short bibliography of papers on SA applied to NP-hard
probs, and some lecture slides of mine (which might be able to serve as
a sort of tutorial) at:
http://www.nat.vu.nl/~kate/simulated_annealing/kate mullen
--
http://www.nat.vu.nl/~kate/On Mon, 11 Oct 2004, Owen Densmore wrote:
> Does anyone have a pointer to using simulated annealing to solve the
> traveling salesman problem? .. or a good tutorial on SA?
>
> -- Owen
>
> Owen Densmore -
http://backspaces.net -
[hidden email]
>
>
> ============================================================
> FRIAM Applied Complexity Group listserv
> Meets Fridays 9AM @ Jane's Cafe
> Lecture schedule, archives, unsubscribe, etc.:
>
http://www.friam.org>
Locked
