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.