The GA Playground: Binpack1 u120_00 Bin Packing Problem
120 objects uniformly distributed in (20,100), bins of size 150
Description:
It is required to put a given number of objects, each having a different size, into a minimal number of bins of a given size
Formulation:
Given a finite set of elements E={e1,...en} with associated weights W={w1,...wn} such that 0 =< wi =< w(bin). Partition E into N subsets such that the sum of weights in each partition is at most w(bin) and that N is the minimum.
Problem Specific Notes:
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.