Newsgroups: comp.ai.genetic
Path: cantaloupe.srv.cs.cmu.edu!bb3.andrew.cmu.edu!newsfeed.pitt.edu!gatech!news.cse.psu.edu!uwm.edu!math.ohio-state.edu!howland.reston.ans.net!newsfeed.internetmci.com!news2.cais.net!news.cais.net!van-bc!unixg.ubc.ca!news!cln.etc.bc.ca!chenness
From: chenness@cln.etc.bc.ca (CRAIG HENNESSEY)
Subject: Help solving the traveling salesman problem.
X-Nntp-Posting-Host: cln.etc.bc.ca
Message-ID: <1996May2.031257.16699@news.etc.bc.ca>
Originator: chenness@cln
Sender: news@news.etc.bc.ca (System Administration)
Reply-To: chenness@cln.etc.bc.ca (CRAIG HENNESSEY)
Organization: The Education Technology Centre of British Columbia. (Canada)
Date: Thu, 2 May 1996 03:12:57 GMT
Lines: 19


Hello there. I was wondering if you could help me on a problem.
It's the traveling salesman one.

Allright, I've got 5 cities. each some distance from the other.
I have it set up were I build two random routes. Say
(AB)CDE and EA(DCB) - I mutate them at 2-3 and get the children
ABEDC and EABCD - using a number to letter formula I found in a book
I then have four routes. Interesting in it's own right, but I don't
know which route is best. And I'm not sure how I'm supposed to find
out which one is, making a truth table like A to B is 5 units 
A to C is 8 units, etc. Seems to be a slow way of solving this
problem. Any ideas?

Please reply to my e-mail at chenness@cln.etc.bc.ca

Thanks,

Craig Hennessey.
