Newsgroups: comp.ai.genetic
Path: cantaloupe.srv.cs.cmu.edu!das-news2.harvard.edu!news2.near.net!howland.reston.ans.net!pipex!uknet!newsfeed.ed.ac.uk!ainews!aisb!andrewt
From: andrewt@aisb.ed.ac.uk (Andrew Tuson)
Subject: Re: crossover operators for permutations
Message-ID: <D4t2K3.HJ8@aisb.ed.ac.uk>
Sender: news@aisb.ed.ac.uk (Network News Administrator)
Reply-To: andrewt@aisb.ed.ac.uk (Andrew Tuson)
Organization: Dept of AI, University of Edinburgh, Scotland
References:  <3igof5$ler@oahu.cs.ucla.edu>
Date: Thu, 2 Mar 1995 09:04:50 GMT
Lines: 36

In article <3igof5$ler@oahu.cs.ucla.edu>, jnorthan@oahu.cs.ucla.edu (John Northan) writes:

Hi John,

# 	I'm working on a project that involves encoding partitions
# such that they can be manipulated by genetic operators. I have read in
# Goldberg's book about 3 relevent forms of crossover operators: order,
# partially-matched and cycle, but wonder if others can be recommended ?
# 
# I also understand that edge-based crossover has been applied to the
# travelling salesman problem .... does anyone know of other operators
# applied (successfully) to this problem ?

Colin Reeves (Coventry Univ.) has devised two; they are detailed in the paper:

Reeves C.R., A genetic algorithm for flowshop scheduling, to appear in
Computers and Ops.Res., 1993. 

Also one has been devised by Hugh Cartwright and Greg Mott from Oxford Univ.
It is detailed in a recent technicial report by myself:

Tuson, A.L. (1994). The Implementation of a Genetic Algorithm for the
Scheduling and Topology Optimisation of Chemical Flowshops. Technical Report
TRGA94-01, Oxford University, U.K.
[Available via anonymous ftp at muriel.pcl.ox.ac.uk in
pub/techreports/trga94-01.ps.Z].

The ftp site can also be reached via my home page:

http://www.dai.ed.ac.uk:80/students/andrewt/

Best of luck!

Andrew Tuson (andrewt@aisb.ed.ac.uk)

Department of Artificial Intelligence, University of Edinburgh, Scotland, UK.
