The GA Playground: Weing1 - A Multiple 0/1 Knapsack Problem

A multiple knapsack problem with 2 knapsacks and 28 objects

Description

A knapsack problem (see description in the Single Knapsack Problem file), where there are multiple knapsacks, and each object has a different weight for each knapsack.

Formulation:

Maximize sum(x(i)*p(i))

Subject to sum(x(i)*w(i,j)) <= C(j)

x(i) = 0 or 1

Problem Specific Notes:

The problem definition file is KnapsackWeing1.par
The problem map file (profit and weight values) is KnapsackWeing1.gmp
The capacity of each knapsack is 600
The optimum value is 141278

Instructions:

The applet requires a browser that supports JDK 1.1.5 or above
The applet has a relatively long loading time
Hide browser's toolbars to make the whole applet visible without scrolling
Optionally select 'Parameters' from the 'GA' menu to modify problem attributes
Select 'Execute' from the 'GA' menu to run the program
Status bar help tips can be toggled On or Off through the 'Options' menu
Text window reporting can be toggled On or Off through the 'Options/Switches' menu

You either do not have Java support or it is disabled in your browser

Ariel Dolan
aridolan@netvision.net.il