Genetic Algorithms Digest    Monday, 25 September 1989    Volume 3 : Issue 13

 - Send submissions to GA-List@AIC.NRL.NAVY.MIL
 - Send administrative requests to GA-List-Request@AIC.NRL.NAVY.MIL

Today's Topics:
	- A quiet summer
	- GAs for factory type scheduling
	- Known TSP tours
	- Partial matching in classifier systems
	- Ecology models

--------------------------------

From: John Grefenstette <GA-List-Request@AIC.NRL.NAVY.MIL>
Date: Mon, 25 Sep 89 09:05:12 EST
Subject: A quiet summer

Dear GA-Listers:

I've gotten several messages asking if GA-List had died.  No it
hasn't, but it's been slumbering this summer. Maybe everyone was
GA-tired after the successful Conference in June.  In any case,
keep those cards and letters coming, and keep your colleagues
up to date on your latest breakthroughs!

Your Moderator,

	JJG

--------------------------------

From: Mark Hughes <mrh@camcon.co.uk>
Date: Thu, 31 Aug 89 14:12:58 BST
Subject: GAs for factory type scheduling

I will be grateful for any anecdotes/references for work on factory
scheduling using GAs.  So far I'm aware of two papers; one by Davis
(1985) and one by Hilliard et al (1987), from the first and second GA
conference procs. respectively. (These are on order).

thanks in advance

------------------- mrh@camcon.co.uk      or  mrh@camcon.uucp
|   Mark Hughes   | Tel: +44 (0) 223 420024   Cambridge Consultants Ltd. 
|(Compware . CCL) | Tlx: 931 211 0193 (KZ G)  The Science Park, Milton Road,
------------------- BT Gold: 72:MAG70076      Cambridge UK. (Own opinions etc.)

--------------------------------

Date:     Wed, 13 Sep 89 18:00:02 EDT
From: Gilbert Syswerda <syswerda@BBN.COM>
Subject:  Known TSP tours

I have a TSP optimizer that I would like to try on some collections of
cities with known short tours. Does anyone out there have some they could
send me, or know where I might get some?

--------------------------------

Date: Tue, 12 Sep 89 17:49:42 +0200
From: vub.vub.ac.be!arti6!bernard@prlb.philips.be (Bernard Manderick)
Subject: Partial matching in classifier systems

I have two questions concerning the use of partial matching in classifier
systems?

Dave Goldberg gives in his book "Genetic Algorithms in Search, Optimization
and Machine Learning" a brief discussion of partial matching is given (pp.
277-278). One of the things he states there is that the original partial
match score used by Booker in his thesis [Booker 1982], i.e.

              if the taxon matches
	        NCARES + (taxon length)
match score = 
	      otherwise, 1 for each correct attribute
	        plus 0.75 for each #,

has been critizied and due to that criticism Booker has introduced other
match scores in his ICGA85-paper [Booker 85].

Does anybody know what these critics are?

Goldberg states also that a lot of people oppose partial matching.

Can anybody tell me what the arguments of the opposants are against partial
matching?

Bernard Manderick
AI Lab - Building K - 4th floor
VUB
Pleinlaan 2
B-1050 Brussels
Belgium
email: bernard@arti.vub.ac.be

--------------------------------

Date: Tue, 8 Aug 89 14:26:57 EST
From: Gary Berg-Cross <garybc@potomac.ads.com>
Subject: Ecology models

Several weeks ago Bob Loy posted an announcement about source code
to a program called Whales and Plankton - a model of a small ecology used to
study genetic algorithms.  Unfortunately I was away during the posting an
my mailer deleted the relevant files from comp.sources.misc by the time of
my return.  Does anyone have a good internet address for Bob Loy or a pointer
to the C-program files?  


--------------------------------

End of Genetic Algorithms Digest
********************************

