Case Studies: Bin Packing & The Traveling Salesman Problem
description
Transcript of Case Studies: Bin Packing & The Traveling Salesman Problem
![Page 1: Case Studies: Bin Packing & The Traveling Salesman Problem](https://reader035.fdocuments.us/reader035/viewer/2022062323/56815a34550346895dc77358/html5/thumbnails/1.jpg)
© 2010 AT&T Intellectual Property. All rights reserved. AT&T and the AT&T logo are trademarks of AT&T Intellectual Property.
Case Studies: Bin Packing &
The Traveling Salesman Problem
David S. JohnsonAT&T Labs – Research
Bin Packing: Part II
![Page 2: Case Studies: Bin Packing & The Traveling Salesman Problem](https://reader035.fdocuments.us/reader035/viewer/2022062323/56815a34550346895dc77358/html5/thumbnails/2.jpg)
Asymptotic Worst-Case Ratios
• Theorem: R∞(FF) = R∞(BF) = 17/10.
• Theorem: R∞(FFD) = R∞(BFD) = 11/9.
![Page 3: Case Studies: Bin Packing & The Traveling Salesman Problem](https://reader035.fdocuments.us/reader035/viewer/2022062323/56815a34550346895dc77358/html5/thumbnails/3.jpg)
Average-Case Performance
![Page 4: Case Studies: Bin Packing & The Traveling Salesman Problem](https://reader035.fdocuments.us/reader035/viewer/2022062323/56815a34550346895dc77358/html5/thumbnails/4.jpg)
Progress?
![Page 5: Case Studies: Bin Packing & The Traveling Salesman Problem](https://reader035.fdocuments.us/reader035/viewer/2022062323/56815a34550346895dc77358/html5/thumbnails/5.jpg)
Progress:Faster Computers Bigger Instances
![Page 6: Case Studies: Bin Packing & The Traveling Salesman Problem](https://reader035.fdocuments.us/reader035/viewer/2022062323/56815a34550346895dc77358/html5/thumbnails/6.jpg)
Definitions
![Page 7: Case Studies: Bin Packing & The Traveling Salesman Problem](https://reader035.fdocuments.us/reader035/viewer/2022062323/56815a34550346895dc77358/html5/thumbnails/7.jpg)
Definitions, Continued
![Page 8: Case Studies: Bin Packing & The Traveling Salesman Problem](https://reader035.fdocuments.us/reader035/viewer/2022062323/56815a34550346895dc77358/html5/thumbnails/8.jpg)
Theorems for U[0,1]
![Page 9: Case Studies: Bin Packing & The Traveling Salesman Problem](https://reader035.fdocuments.us/reader035/viewer/2022062323/56815a34550346895dc77358/html5/thumbnails/9.jpg)
![Page 10: Case Studies: Bin Packing & The Traveling Salesman Problem](https://reader035.fdocuments.us/reader035/viewer/2022062323/56815a34550346895dc77358/html5/thumbnails/10.jpg)
Proof Idea for FF, BF:View as a 2-Dimensional Matching
Problem
![Page 11: Case Studies: Bin Packing & The Traveling Salesman Problem](https://reader035.fdocuments.us/reader035/viewer/2022062323/56815a34550346895dc77358/html5/thumbnails/11.jpg)
Distributions U[0,u]
Item sizes uniformly distributed in the interval (0,u], 0 < u < 1
![Page 12: Case Studies: Bin Packing & The Traveling Salesman Problem](https://reader035.fdocuments.us/reader035/viewer/2022062323/56815a34550346895dc77358/html5/thumbnails/12.jpg)
Average Waste for BF under U(0,u]
![Page 13: Case Studies: Bin Packing & The Traveling Salesman Problem](https://reader035.fdocuments.us/reader035/viewer/2022062323/56815a34550346895dc77358/html5/thumbnails/13.jpg)
Measured Average Waste for BF under U(0,.01]
![Page 14: Case Studies: Bin Packing & The Traveling Salesman Problem](https://reader035.fdocuments.us/reader035/viewer/2022062323/56815a34550346895dc77358/html5/thumbnails/14.jpg)
Conjecture
![Page 15: Case Studies: Bin Packing & The Traveling Salesman Problem](https://reader035.fdocuments.us/reader035/viewer/2022062323/56815a34550346895dc77358/html5/thumbnails/15.jpg)
FFD on U(0,u]
Experimental Results from [Bentley, Johnson, Leighton, McGeoch, 1983]
N =
FFD
(L)
– s(
L)
u = .6
u = .5
u = .4
![Page 16: Case Studies: Bin Packing & The Traveling Salesman Problem](https://reader035.fdocuments.us/reader035/viewer/2022062323/56815a34550346895dc77358/html5/thumbnails/16.jpg)
FFD on U(0,u], u 0.5
![Page 17: Case Studies: Bin Packing & The Traveling Salesman Problem](https://reader035.fdocuments.us/reader035/viewer/2022062323/56815a34550346895dc77358/html5/thumbnails/17.jpg)
FFD on U(0,u], u 0.5
![Page 18: Case Studies: Bin Packing & The Traveling Salesman Problem](https://reader035.fdocuments.us/reader035/viewer/2022062323/56815a34550346895dc77358/html5/thumbnails/18.jpg)
FFD on U(0,u], 0.5 u 1
1984 – 2011?)
![Page 19: Case Studies: Bin Packing & The Traveling Salesman Problem](https://reader035.fdocuments.us/reader035/viewer/2022062323/56815a34550346895dc77358/html5/thumbnails/19.jpg)
Discrete Distributions
![Page 20: Case Studies: Bin Packing & The Traveling Salesman Problem](https://reader035.fdocuments.us/reader035/viewer/2022062323/56815a34550346895dc77358/html5/thumbnails/20.jpg)
Courcoubetis-Weber
![Page 21: Case Studies: Bin Packing & The Traveling Salesman Problem](https://reader035.fdocuments.us/reader035/viewer/2022062323/56815a34550346895dc77358/html5/thumbnails/21.jpg)
y
x
z
(0,0,0)
(2,1,1)
(0,2,1)
(1,0,2)
![Page 22: Case Studies: Bin Packing & The Traveling Salesman Problem](https://reader035.fdocuments.us/reader035/viewer/2022062323/56815a34550346895dc77358/html5/thumbnails/22.jpg)
Courcoubetis-Weber Theorem
![Page 23: Case Studies: Bin Packing & The Traveling Salesman Problem](https://reader035.fdocuments.us/reader035/viewer/2022062323/56815a34550346895dc77358/html5/thumbnails/23.jpg)
A Flow-Based Linear Program
![Page 24: Case Studies: Bin Packing & The Traveling Salesman Problem](https://reader035.fdocuments.us/reader035/viewer/2022062323/56815a34550346895dc77358/html5/thumbnails/24.jpg)
Theorem [Csirik et al. 2000]
Note: The LP’s for (1) and (3) are both of size polynomial in B, not log(B), and hence “pseudo-polynomial”
![Page 25: Case Studies: Bin Packing & The Traveling Salesman Problem](https://reader035.fdocuments.us/reader035/viewer/2022062323/56815a34550346895dc77358/html5/thumbnails/25.jpg)
0.25
0.00
0.75
0.50
1.00
1/3
1
2/3
Discrete Uniform Distributions
U{3,4}U{6,8}U{12,16}U(0,¾]
![Page 26: Case Studies: Bin Packing & The Traveling Salesman Problem](https://reader035.fdocuments.us/reader035/viewer/2022062323/56815a34550346895dc77358/html5/thumbnails/26.jpg)
Theorem [Coffman et al. 1997]
(Results analogous to those for the corresponding U(0,u])
![Page 27: Case Studies: Bin Packing & The Traveling Salesman Problem](https://reader035.fdocuments.us/reader035/viewer/2022062323/56815a34550346895dc77358/html5/thumbnails/27.jpg)
Experimental Results for Best Fit
0 ≤ u ≤ 1, 1 ≤ j ≤ k = 51
Averages of 25 trials for each distribution, N = 2,048,000
![Page 28: Case Studies: Bin Packing & The Traveling Salesman Problem](https://reader035.fdocuments.us/reader035/viewer/2022062323/56815a34550346895dc77358/html5/thumbnails/28.jpg)
Average Waste under Best Fit(Experimental values for N = 100,000,000 and
200,000,000)
[GJSW, 1993]
Linear Waste
![Page 29: Case Studies: Bin Packing & The Traveling Salesman Problem](https://reader035.fdocuments.us/reader035/viewer/2022062323/56815a34550346895dc77358/html5/thumbnails/29.jpg)
Average Waste under Best Fit(Experimental values for N = 100,000,000 and
200,000,000)
[GJSW, 1993][KRS, 1996]Holds for all j = k-2
![Page 30: Case Studies: Bin Packing & The Traveling Salesman Problem](https://reader035.fdocuments.us/reader035/viewer/2022062323/56815a34550346895dc77358/html5/thumbnails/30.jpg)
Average Waste under Best Fit(Experimental values for N = 100,000,000 and
200,000,000)
[GJSW, 1993]
Still Open
![Page 31: Case Studies: Bin Packing & The Traveling Salesman Problem](https://reader035.fdocuments.us/reader035/viewer/2022062323/56815a34550346895dc77358/html5/thumbnails/31.jpg)
Theorem [Kenyon & Mitzenmacher, 2000]
![Page 32: Case Studies: Bin Packing & The Traveling Salesman Problem](https://reader035.fdocuments.us/reader035/viewer/2022062323/56815a34550346895dc77358/html5/thumbnails/32.jpg)
Average wBF(L)/s(L) for U{j,85}
![Page 33: Case Studies: Bin Packing & The Traveling Salesman Problem](https://reader035.fdocuments.us/reader035/viewer/2022062323/56815a34550346895dc77358/html5/thumbnails/33.jpg)
Average wBFD(L)/s(L) for U{j,85}
![Page 34: Case Studies: Bin Packing & The Traveling Salesman Problem](https://reader035.fdocuments.us/reader035/viewer/2022062323/56815a34550346895dc77358/html5/thumbnails/34.jpg)
Averages on the Same Scale
![Page 35: Case Studies: Bin Packing & The Traveling Salesman Problem](https://reader035.fdocuments.us/reader035/viewer/2022062323/56815a34550346895dc77358/html5/thumbnails/35.jpg)
The Discrete Distribution U{6,13}
![Page 36: Case Studies: Bin Packing & The Traveling Salesman Problem](https://reader035.fdocuments.us/reader035/viewer/2022062323/56815a34550346895dc77358/html5/thumbnails/36.jpg)
“Fluid Algorithm” Analysis: U{6,13}
Size = 6 5 4 3 2 1
Amount = β β β β β β
Bin Type =
Amount =
6
6
β/2
β/2β/2
4
4
4
β/3
β/6
β/2
5
5
33
3
3
3
β/8
β/24
22
222
2
β/24
¾β
![Page 37: Case Studies: Bin Packing & The Traveling Salesman Problem](https://reader035.fdocuments.us/reader035/viewer/2022062323/56815a34550346895dc77358/html5/thumbnails/37.jpg)
Expected Waste
![Page 38: Case Studies: Bin Packing & The Traveling Salesman Problem](https://reader035.fdocuments.us/reader035/viewer/2022062323/56815a34550346895dc77358/html5/thumbnails/38.jpg)
Theorem[Coffman, Johnson, McGeoch, Shor, & Weber, 1994-
2011]
![Page 39: Case Studies: Bin Packing & The Traveling Salesman Problem](https://reader035.fdocuments.us/reader035/viewer/2022062323/56815a34550346895dc77358/html5/thumbnails/39.jpg)
U{j,k} for which FFD has Linear Waste
j
k
![Page 40: Case Studies: Bin Packing & The Traveling Salesman Problem](https://reader035.fdocuments.us/reader035/viewer/2022062323/56815a34550346895dc77358/html5/thumbnails/40.jpg)
Minumum j/k for which Waste is Linear
k
j/k
![Page 41: Case Studies: Bin Packing & The Traveling Salesman Problem](https://reader035.fdocuments.us/reader035/viewer/2022062323/56815a34550346895dc77358/html5/thumbnails/41.jpg)
Values of j/k for which Waste is Maximum
k
j/k
![Page 42: Case Studies: Bin Packing & The Traveling Salesman Problem](https://reader035.fdocuments.us/reader035/viewer/2022062323/56815a34550346895dc77358/html5/thumbnails/42.jpg)
Waste as a Function of j and k (mod 6)
![Page 43: Case Studies: Bin Packing & The Traveling Salesman Problem](https://reader035.fdocuments.us/reader035/viewer/2022062323/56815a34550346895dc77358/html5/thumbnails/43.jpg)
K = 8641 = 26335 + 1
![Page 44: Case Studies: Bin Packing & The Traveling Salesman Problem](https://reader035.fdocuments.us/reader035/viewer/2022062323/56815a34550346895dc77358/html5/thumbnails/44.jpg)
Pairs (j,k) where BFD beats FFD
k
j
![Page 45: Case Studies: Bin Packing & The Traveling Salesman Problem](https://reader035.fdocuments.us/reader035/viewer/2022062323/56815a34550346895dc77358/html5/thumbnails/45.jpg)
Pairs (j,k) where FFD beats BFD
k
j
![Page 46: Case Studies: Bin Packing & The Traveling Salesman Problem](https://reader035.fdocuments.us/reader035/viewer/2022062323/56815a34550346895dc77358/html5/thumbnails/46.jpg)
Beating BF and BFD in Theory
![Page 47: Case Studies: Bin Packing & The Traveling Salesman Problem](https://reader035.fdocuments.us/reader035/viewer/2022062323/56815a34550346895dc77358/html5/thumbnails/47.jpg)
Plausible Alternative Approach
![Page 48: Case Studies: Bin Packing & The Traveling Salesman Problem](https://reader035.fdocuments.us/reader035/viewer/2022062323/56815a34550346895dc77358/html5/thumbnails/48.jpg)
The Sum-of-Squares Algorithm (SS)
![Page 49: Case Studies: Bin Packing & The Traveling Salesman Problem](https://reader035.fdocuments.us/reader035/viewer/2022062323/56815a34550346895dc77358/html5/thumbnails/49.jpg)
SS on U{j,100} for 1 ≤ j ≤ 99
j
SS(L
)/s(
L)
BF for N = 10M
SS for N = 1M
SS for N = 100K
SS for N = 10M
![Page 50: Case Studies: Bin Packing & The Traveling Salesman Problem](https://reader035.fdocuments.us/reader035/viewer/2022062323/56815a34550346895dc77358/html5/thumbnails/50.jpg)
Discrete Uniform Distributions II
![Page 51: Case Studies: Bin Packing & The Traveling Salesman Problem](https://reader035.fdocuments.us/reader035/viewer/2022062323/56815a34550346895dc77358/html5/thumbnails/51.jpg)
j
h
![Page 52: Case Studies: Bin Packing & The Traveling Salesman Problem](https://reader035.fdocuments.us/reader035/viewer/2022062323/56815a34550346895dc77358/html5/thumbnails/52.jpg)
K = 101
j
h
![Page 53: Case Studies: Bin Packing & The Traveling Salesman Problem](https://reader035.fdocuments.us/reader035/viewer/2022062323/56815a34550346895dc77358/html5/thumbnails/53.jpg)
K = 120
j
h
![Page 54: Case Studies: Bin Packing & The Traveling Salesman Problem](https://reader035.fdocuments.us/reader035/viewer/2022062323/56815a34550346895dc77358/html5/thumbnails/54.jpg)
j
h
K = 100
h = 18
![Page 55: Case Studies: Bin Packing & The Traveling Salesman Problem](https://reader035.fdocuments.us/reader035/viewer/2022062323/56815a34550346895dc77358/html5/thumbnails/55.jpg)
Results for U{18..j,k}
j
A(L
)/s(
L)
BFSSOPT
![Page 56: Case Studies: Bin Packing & The Traveling Salesman Problem](https://reader035.fdocuments.us/reader035/viewer/2022062323/56815a34550346895dc77358/html5/thumbnails/56.jpg)
Is SS Really this Good?
![Page 57: Case Studies: Bin Packing & The Traveling Salesman Problem](https://reader035.fdocuments.us/reader035/viewer/2022062323/56815a34550346895dc77358/html5/thumbnails/57.jpg)
Conjectures [Csirik et al., 1998]
![Page 58: Case Studies: Bin Packing & The Traveling Salesman Problem](https://reader035.fdocuments.us/reader035/viewer/2022062323/56815a34550346895dc77358/html5/thumbnails/58.jpg)
Why O(log n) Waste?
![Page 59: Case Studies: Bin Packing & The Traveling Salesman Problem](https://reader035.fdocuments.us/reader035/viewer/2022062323/56815a34550346895dc77358/html5/thumbnails/59.jpg)
Theorem [Csirik et al., 2000]
![Page 60: Case Studies: Bin Packing & The Traveling Salesman Problem](https://reader035.fdocuments.us/reader035/viewer/2022062323/56815a34550346895dc77358/html5/thumbnails/60.jpg)
Proving the Conjectures: A Key Lemma
![Page 61: Case Studies: Bin Packing & The Traveling Salesman Problem](https://reader035.fdocuments.us/reader035/viewer/2022062323/56815a34550346895dc77358/html5/thumbnails/61.jpg)
Linear Waste Distributions
![Page 62: Case Studies: Bin Packing & The Traveling Salesman Problem](https://reader035.fdocuments.us/reader035/viewer/2022062323/56815a34550346895dc77358/html5/thumbnails/62.jpg)
Good News
![Page 63: Case Studies: Bin Packing & The Traveling Salesman Problem](https://reader035.fdocuments.us/reader035/viewer/2022062323/56815a34550346895dc77358/html5/thumbnails/63.jpg)
SSF for U{18.. j,100}
![Page 64: Case Studies: Bin Packing & The Traveling Salesman Problem](https://reader035.fdocuments.us/reader035/viewer/2022062323/56815a34550346895dc77358/html5/thumbnails/64.jpg)
Handling Unknown Distributions
![Page 65: Case Studies: Bin Packing & The Traveling Salesman Problem](https://reader035.fdocuments.us/reader035/viewer/2022062323/56815a34550346895dc77358/html5/thumbnails/65.jpg)
SS* for U{18.. j,100}
![Page 66: Case Studies: Bin Packing & The Traveling Salesman Problem](https://reader035.fdocuments.us/reader035/viewer/2022062323/56815a34550346895dc77358/html5/thumbnails/66.jpg)
Other Exponents
![Page 67: Case Studies: Bin Packing & The Traveling Salesman Problem](https://reader035.fdocuments.us/reader035/viewer/2022062323/56815a34550346895dc77358/html5/thumbnails/67.jpg)
Variants that Don’t Always Work
![Page 68: Case Studies: Bin Packing & The Traveling Salesman Problem](https://reader035.fdocuments.us/reader035/viewer/2022062323/56815a34550346895dc77358/html5/thumbnails/68.jpg)
Offline Packing Revisited:
The Cutting-Stock Problem
![Page 69: Case Studies: Bin Packing & The Traveling Salesman Problem](https://reader035.fdocuments.us/reader035/viewer/2022062323/56815a34550346895dc77358/html5/thumbnails/69.jpg)
Gilmore-Gomory vs Bin Packing Heuristics
![Page 70: Case Studies: Bin Packing & The Traveling Salesman Problem](https://reader035.fdocuments.us/reader035/viewer/2022062323/56815a34550346895dc77358/html5/thumbnails/70.jpg)
Some Remaining Open Problems