Professional Documents
Culture Documents
Bin Packing
Bin Packing
Example:
Groups 3, 1, 6, 4, 5, 2 of people need to fit into a
minibus of capacity of 7 but must stay
together in their groups.
Lower bound:
3+1+6+4+5+2/7
=21/7
=3.
So, lower bound is 3.
Bin Packing- example #2
Lower bound:
3+1+6+4+5+2/7
=21/7
=3.
So, lower bound is 3.
Bin Packing- example #2
1 ……
.5 .7 .5 .2 .4 .2 .5 .1 .6
.2 .4 .2 .1
.5 .5 .5 .6
.7
Items to be packed
Bin Packing- example #2
1 ……
.5 .7 .5 .2 .4 .2 .5 .1 .6
Optimal Packing
.1
.5 .2
.5
.6 N0 = 4
.5 .7
.4
.2
Next Fit Packing
Algorithm
Bin Packing Problem
.5 .7 .5 .2 .4 .2 .5 .1 .6
.1
.5 .2
.5
.6 N0 = 4
.5 .7
.4
.2
Ν N=6
2
Ν 0
First Fit Packing
Algorithm
.5 .7 .5 .2 .4 .2 .5 .1 .6
Next Fit Packing Algorithm
.2 .1
.2
.7 .6
.5 .5 .4 .5
.2
.7 .6
.5 .4 .5
N=5
Ν
1.7 (Proof omitted)
Ν0
First Fit Packing
Algorithm
.7 .6 .5 .5 .5 .4 .2 .2 .1
First Fit-decreasing
Packing Algorithm
.7 .6 .5 .5 .5 .4 .2 .2 .1
Next Fit Packing Algorithm
.2 .1
.2
.7 .6
.5 .5 .4 .5
N=4