Newsgroups: comp.ai.genetic
Path: cantaloupe.srv.cs.cmu.edu!rochester!udel!gatech!howland.reston.ans.net!news.nic.surfnet.nl!ruu.nl!nmr!leef
From: leef@nmr.chem.ruu.nl (Bas Leeflang)
Subject: NEEDED: GA for permutation problem
Message-ID: <1995May9.062600.5487@cc.ruu.nl>
Sender: leef@RUUCI9 (Bas Leeflang)
Organization: ACCU
Date: Tue, 9 May 1995 06:26:00 GMT
Lines: 29

I am just a beginner in the field of GA, so I can need some advise.

My problem is a sorting problem of typically 100 to 150 items.
The information available is basically short range information.
That is for each item I have probabilitie lists of what the next
(i->i+1) item can be. I also have for each item lists for further 
'neighbours' (i->i+2) (i->i+3) and (i->i+4)

On the basis of those list I can derive an evaluation function to scrore
the current permuation.

A brute force method is out of the question, therefore I would like to turn
to GA.

I know several programs must be available that can perform this task.

Please suggest me suitable programs.



----------------------------------------------------------------------
                                     Bas R. Leeflang

    _/      _/   _/     _/   _/_/_/  Department of the Bijvoet Center
   _/_/    _/   _/_/ _/_/   _/   _/  for Biomolecular Research
  _/  _/  _/   _/  _/ _/   _/_/_/    Padualaan 8, 3584 CH  Utrecht
 _/    _/_/   _/     _/   _/   _/    Tel. : int+31.30.533295
_/      _/   _/     _/   _/    _/    Fax  : int+31.30.537623
                                     Email: leef@nmr.chem.ruu.nl
