The GA Playground: Weish01 - A Multiple 0/1 Knapsack Problem
A multiple knapsack problem with 5 knapsacks and 30 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 KnapsackWeish01.par
- The problem map file (profit and weight values) is KnapsackWeish01.gmp
- The capacities of the knapsacks are 400,500,500,600,600
- The optimum value is 4554
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
|
Home Page |
Floys |
iFloys |
eFloys |
tFloys |
Floys Description |
Java CA |
Wica |
Doll House |
Picture-Browser |
Download |
Alife Database |
GA Playground |
Experiments |
Ariel Dolan
aridolan@netvision.net.il
Tel. 972-3-7526264
Fax. 972-3-5752173
Last modified on: Tuesday, 30 June, 1998.