Newsgroups: comp.ai.genetic
Path: cantaloupe.srv.cs.cmu.edu!europa.chnt.gtegsc.com!howland.reston.ans.net!vixen.cso.uiuc.edu!sdd.hp.com!hplabs!hplntx!news
From: Carl Staelin <staelin>
Subject: GA/GP solutions for knapsack problems?
Sender: news@hpl.hp.com (HPLabs Usenet Login)
Message-ID: <DAypz5.Gpn@hpl.hp.com>
Date: Fri, 30 Jun 1995 01:40:16 GMT
X-Url: news:comp.ai.genetic
Content-Transfer-Encoding: 7bit
Content-Type: text/plain; charset=us-ascii
Nntp-Posting-Host: cello.hpl.hp.com
Mime-Version: 1.0
X-Mailer: Mozilla 1.1N (X11; I; HP-UX A.09.04 9000/897)
Organization: Hewlett Packard Laboratories, Palo Alto, California
Lines: 16

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
it completely overwhelms most traditional knapsack solvers.  Any
hints/pointers/references/suggestions welcome!

Thanks,

	Carl
-- 
-------------------------------------------------------------------------------
Carl Staelin	
	at HPLabs:	staelin@hpl.hp.com		(415)857-6823
	at UCBerkeley:	staelin@cs.berkeley.edu		(510)642-6042
-------------------------------------------------------------------------------

