Large proper gaps in bin packing and dual bin packing problems
- 181 Downloads
We consider the one-dimensional skiving stock problem, also known as the dual bin packing problem, with the aim of maximizing the best known dual and proper dual gaps. We apply the methods of computational search of large gaps initially developed for the one-dimensional cutting stock problem, which is related to the bin packing problem. The best known dual gap is raised from 1.0476 to 1.1795. The proper dual gap is improved to 1.1319. We also apply a number of new heuristics developed for the skiving stock problem back to the cutting stock problem, raising the largest known proper gap from 1.0625 to 1.1.
KeywordsSkiving stock problem Cutting stock problem Bin packing problem Dual bin packing problem Integer round-up property Equivalence of classes Proper gap
The authors would like to thank Dresden Technical University for providing computing power and Damir Akhmetzyanov, who helped to improve English in this paper.
- 15.Peeters, M.: One dimensional cutting and packing: new problems and algorithms. Ph.D. thesis, Katholieke Universiteit Leuven (2002)Google Scholar
- 18.Scheithauer, G., Terno, J.: About the gap between the optimal values of the integer and continuous relaxation one-dimensional cutting stock problem. In: Operations Research Proceedings 1991, pp. 439–444. Springer (1992)Google Scholar