Heuristics for Large Strip Packing Problems with Guillotine Patterns: An Empirical Study
In this paper, we undertake an empirical study which examines the effectiveness of eight simple strip packing heuristics on data sets of different sizes with various characteristics and known optima. We restrict this initial study to techniques that produce guillotine patterns (also known as slicing floor plans) which are important industrially. Our chosen heuristics are simple to code, have very fast execution times, and provide a good starting point for our research. In particular, we examine the performance of the eight heuristics as the problems become larger, and demonstrate the effectiveness of a preprocessing routine that rotates some of the rectangles by 90 degrees before the heuristics are applied. We compare the heuristic results to those obtained by using a good genetic algorithm (GA) that also produces guillotine patterns. Our findings suggest that the GA is better on problems of up to about 200 rectangles, but thereafter certain of the heuristics become increasingly effective as the problem size becomes larger, producing better results much more quickly than the GA.
KeywordsStrip packing Heuristics Genetic algorithm.
Unable to display preview. Download preview PDF.
- D. J. Cavicchio. Adaptive Search Using Simulated Evolution. PhD thesis, University of Michigan, Ann Arbor, 1970.Google Scholar
- E. G. Coffman Jr., M. R. Garey, and D. S. Johnson. Approximation algorithms for bin packing — an updated survey. In G. Ausiello, N. Lucertini, and P. Serafini, editors, Algorithm Design for Computer Systems Design, pages 49–106. Springer-Verlag, Vienna, 1984.Google Scholar
- S. M. Hwang, C. Y. Kao, and J. T. Horng. On solving rectangle bin packing problems using genetic algorithms. In Proceedings of the 1994 IEEE International Conference on Systems, Man and Cybernetics, pages 1583–1590, 1994.Google Scholar
- R. M. Karp, M. Luby, and A. Marchetti-Spaccamela. Probabilistic analysis of multi-dimensional bin-packing problems. In Proceedings of the 16th ACM Symposium on the Theory of Computing, pages 289–298, 1984.Google Scholar
- I. M. Oliver, D. J. Smith, and J. R. C. Holland. A study of permutation crossover operators on the travelling salesman problem. In Genetic Algorithms and their Applications: Proceedings of the Second International Conference on Genetic Algorithms, pages 224–230, 1987.Google Scholar
- C. L. Valenzuela and P. Y. Wang. A Genetic Algorithm for VLSI Floorplanning. In Parallel Problem Solving from Nature — PPSN VI, Lecture Notes in Computer Science 1917, pages 671–680, 2000.Google Scholar
- C. L. Valenzuela and P. Y. Wang. Data set generation for rectangular placement problems. European Journal of Operational Research, 134 (2): 150–163, 2001.Google Scholar