Solving bin pack problem
Posted: Thu Nov 12, 2009 11:32 pm
Hi All
Solving bin pack problem
I have a single dimensional array of values which contains product weight. which are always a value equal to 40 or less than 40. I need to pack these container which has maximum capacity of 40 . We need an optimized way of packing which is should reduce the number of container and also each container should fill at a maximum weight of products.
Consider if there is product 40 it should be packed in single container
if on 35, 5. it should be packed in one container
if 35,3, 2 it should be in one packet
if we have 15, 15, 15 we should pack them in two container 30, 15 ..
I hope you all make sense, whats my issue .
Please help me to solve these issue.
thanks
joban
http://phpqa.in
Solving bin pack problem
I have a single dimensional array of values which contains product weight. which are always a value equal to 40 or less than 40. I need to pack these container which has maximum capacity of 40 . We need an optimized way of packing which is should reduce the number of container and also each container should fill at a maximum weight of products.
Consider if there is product 40 it should be packed in single container
if on 35, 5. it should be packed in one container
if 35,3, 2 it should be in one packet
if we have 15, 15, 15 we should pack them in two container 30, 15 ..
I hope you all make sense, whats my issue .
Please help me to solve these issue.
thanks
joban
http://phpqa.in