Newsgroups: comp.ai.genetic
Path: cantaloupe.srv.cs.cmu.edu!rochester!udel!news.mathworks.com!uunet!in1.uu.net!hearst.acc.Virginia.EDU!murdoch!uvacs.cs.Virginia.EDU!rcc6p
From: rcc6p@uvacs.cs.Virginia.EDU (Robert C. Craighurst)
Subject: Hamming distance for TSP?
X-Nntp-Posting-Host: cobra-fo.cs.virginia.edu
Message-ID: <D67pyC.2Mr@murdoch.acc.Virginia.EDU>
Originator: rcc6p@cobra.cs.Virginia.EDU
Sender: usenet@murdoch.acc.Virginia.EDU
Organization: University of Virginia Computer Science Department
Date: Wed, 29 Mar 1995 17:30:12 GMT
Lines: 20

I want to get some kind of measure of the diversity of my GA population.
One approach is to us some sort of Hamming distance measure.  But
I'm working with the Travelling Salesperson Problem, so simplistic bit 
comparison, or gene comparison, between solutions does not make sense.
So far, the only thing I can think of is counting the edges both solutions
have in common and subtracting that number from the total number of edges
in any solution.   (Total # edges in solution = number cities in problem.)
This technique would give some measure of disimilarity between solutions.
However, it would not necessarily correlate with the number of steps
necessary to convert one solution to the other.

Does anyone know of any other approach or of any papers addressing the 
issue of measuring diversity in a population of TSP solutions?

Thanks for your assistance.

-- Rob
-- 
-- Rob Craighurst   --   rcc6p@virginia.edu    --   CS Dept, UVa ----
- I can think of nothing in my life less important than watching TV -
