Newsgroups: comp.ai.genetic
Path: cantaloupe.srv.cs.cmu.edu!das-news2.harvard.edu!news2.near.net!howland.reston.ans.net!math.ohio-state.edu!caen!hearst.acc.Virginia.EDU!murdoch!fulton.seas.Virginia.EDU!jpi6g
From: jpi6g@fulton.seas.Virginia.EDU (James P. Ignizio)
Subject: Re: eight-queen
Message-ID: <D1KuAr.3FC@murdoch.acc.Virginia.EDU>
Sender: usenet@murdoch.acc.Virginia.EDU
Organization: University of Virginia
References: <3dsgph$qfj@news.csie.nctu.edu.tw>
Date: Thu, 29 Dec 1994 14:44:51 GMT
Lines: 32

In article <3dsgph$qfj@news.csie.nctu.edu.tw>,
Biing-Kuen Lin <lbk@tem.nctu.edu.tw> wrote:
>Dear friend,
>     
>     Has anyone tried to solve the n-queens with optimization with GA
>
>     eq. 
>          4-queens
>          +---+---+---+---+
>          | 4 | 3 | 1 | 2 |
>          +---+---+---+---+     the number is cost
>          | 2 | 4 | 1 | 3 |
>          +---+---+---+---+     and,we want to get min. cost 
>          | 4 | 1 | 5 | 6 |
>          +---+---+---+---+
>          | 6 | 1 | 9 | 8 |
>          +---+---+---+---+ 
>
>      I would be interested to see how effective GA can be at this problem
>
> B.K. Lin
> gis83520@cis.nctu.edu.tw  

We employed EVOLVER to solve the n-queens problem and then compared
those results with Minimal Conflict Scheduling (see Ignizio &
Cavalier, LINEAR PROGRAMMING, Prentice-Hall, 1994, pp 480-6). The
latter method proved superior in all respects.
--

James P. Ignizio			Phone: 804-924-5394
Professor and Chair			FAX: 804-982-2972
Department of Systems Engineering	Email: ignizio@virginia.edu
