Bin Packing Problem (1DBPP)
 

Does anyone have an Excel template that performs optimization to solve the
"Bin Packing Problem". In the simplest example assume I produce orange juice
and each day of the week I will have a different total volume. Once I know
the volume i have I want to prepare 3 different size containers for shipping
the juice, making the most efficient use of the containers with the least air
space left over. I need to know how many of each size container to prepare in
advance. Looking for something a bit more optimal than best-fit or
decreasing-fit algorithms.

Bin Packing Problem (1DBPP)
 

The two other algorithms I can think as follows

1) Try every possibility
2) Make a model of the problem. Run the model 1000 times using
random inputs (amount of OJ) and get the results. Then change
parameters (size of containers) and run the model again. Repeat
process. The solution is the results with the optimum results.


I took a Gradute Engineering course on modeling where the teacher said
modeling is sometimes the only method to solve complicated statistical
problems.


--
joel
------------------------------------------------------------------------
joel's Profile: 229
View this thread: http://www.thecodecage.com/forumz/sh...d.php?t=192520

http://www.thecodecage.com/forumz

Bin Packing Problem (1DBPP)
 

Gary -

Your problem seems much like the classical "cutting stock" linear
programming problem. An example that you might be able to modify is
available on the Solver web site from the Production and Manufacturing
Examples page at http://www.solver.com/procenter.htm, specifically,
http://www.solver.com/procutstock.htm

- Mike
http://www.MikeMiddleton.com


"Gary" wrote in message
...
Does anyone have an Excel template that performs optimization to solve the
"Bin Packing Problem". In the simplest example assume I produce orange
juice
and each day of the week I will have a different total volume. Once I know
the volume i have I want to prepare 3 different size containers for
shipping
the juice, making the most efficient use of the containers with the least
air
space left over. I need to know how many of each size container to prepare
in
advance. Looking for something a bit more optimal than best-fit or
decreasing-fit algorithms.