Newsgroups: comp.ai.genetic
Path: cantaloupe.srv.cs.cmu.edu!rochester!udel!news.mathworks.com!news.kei.com!simtel!harbinger.cc.monash.edu.au!aggedor.rmit.EDU.AU!matilda.vut.edu.au!rhh
From: rhh@matilda.vut.edu.au (Robert Hinterding)
Subject: Re: GA/GP solutions for knapsack problems?
Message-ID: <DBBJqp.C7n@matilda.vut.edu.au>
Organization: Victoria University of Technology
References: <DAypz5.Gpn@hpl.hp.com> <3t1l24$dqv@Germany.EU.net> <3tbmg2$luf@nic-nac.CSU.net>
Date: Thu, 6 Jul 1995 23:54:25 GMT
Lines: 34

sgordon@zippy.sonoma.edu (Scott Gordon) writes:

>Joerg Heitkoetter (jh@Germany.EU.net) wrote:
>: In article <DAypz5.Gpn@hpl.hp.com>, Carl Staelin <staelin> writes:
>: |> Does anyone know of a genetic algorith / genetic programming
>: |> solution for large knapsack problems?  Our problem will probably
>: |> have tens-hundreds of sacks and hundreds-thousands of items, so
>:         Sami Khuri, Thomas B\"ack, and J\"org Heik\"otter.
>:         The Zero/One Multiple Knapsack Problem and Genetic Algorithms.
>:         In Proceedings of the 1994 ACM Symposium on Applied Computing
>:         (SAC'94), 188--193. March 1994, Phoenix AZ, ACM
>:         Press, 1994. Genetic Algorithms and Optimization Track.

>And in the same proceedings:
>  Gordon, Bohm, Whitley: "A Note on the Performance of Genetic Algorithms
>   on Zero-One Knapsack Problems".

>But our paper does not deal with knapsack problems that involve hundreds
>of thousands of items.  Our approach would probably be inapplicable.

>Scott

See also:
Hinterding, R.:"Mapping, Order-indepentent genes and the Knapsack Problem"
In Proceedings of the 1994 First IEEE Conference on Evolutionary Computation,
Florida. pp-13-17.
The same restrictions apply, largest problem attempted is 100 items.

Robert
-- 
Robert Hinterding
VICTORIA UNIVERSITY OF TECHNOLOGY            Email: rhh@matilda.vut.edu.au 
P.O. Box 14428, Melb Mail Centre             Fax:   +61 3 688 4050
AUSTRALIA 3000                               Phone: +61 3 688 4686                                 
