pat@cs.strath.ac.UK (Pat Prosser) (06/14/88)
Date-Received: Fri, 10 Jun 88 13:42:39 +0100 To: mcvax!cwi.nl!comp-ai-digest@uunet.UU.NET Path: strath-cs!pat From: Pat Prosser <mcvax!cs.strath.ac.uk!pat@uunet.UU.NET> Newsgroups: comp.ai.digest Subject: Re: [csrobe@icase.arpa: Traveling Salesman Problem (a request)] Summary: Genetic Algorithms and Simulated Annealing Keywords: GA, SA, TSP Date: Fri, 10 Jun 88 08:42 EDT References: <19880602041252.1.NICK@JONES.AI.MIT.EDU> Reply-To: mcvax!cs.strath.ac.uk!pat@uunet.UU.NET Organization: Comp. Sci. Dept., Strathclyde Univ., Scotland. Lines: 13 Just incase: two search strategies tried on the TSP recently have been Simulated Annealing and Genetic Algorithms. Papers that cover the TSP and these techniques are: Optimisation by Simulated Annealing, Kirkpatrick, Gelatt and Vecchi, Science, May 1983, Volume 220, pages 671-680. This paper compares SA to Lin and Kernighan. Allels, Loci, and the Traveling Salesman Problem, Goldberg and Lingle Probably in one of the Proceedings on GA.