Minimum tiling of a rectangle by squares
- 106 Downloads
We consider a two-dimensional problem in which one is required to split a given rectangular bin into the smallest number of items. The resulting items must be squares to be packed, without overlapping, into the bin so as to cover all the given rectangle. We present a mathematical model and a heuristic algorithm that is proved to find the optimal solution in some special cases. Then, we introduce a relaxation of the problem and present different exact approaches based on this relaxation. Finally, we report computational experiments on the performances of the algorithms on a large set of randomly generated instances.
KeywordsTwo-dimensional packing Mathematical models Exact algorithms Computational experiments
This research was supported by the Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES), Brazil under Grant PVE 030479/2013-01. Thanks are due to an anonymous referee for helpful comments.
- Lodi, M., Martello, M., Monaci, M., & Vigo, D. (2010). Two-dimensional bin packing problems. In: Paradigms of combinatorial optimization (pp. 107–129). Wiley/ISTE.Google Scholar
- Lueker, G. (1975). Two NP-complete problems in nonnegative integer programming. Technical report, Report No. 178, Computer Science Laboratory, Princeton.Google Scholar
- Martello, S., & Toth, P. (1990). Knapsack problems: Algorithms and computer implementations. Chichester: Wiley.Google Scholar
- Pietrobuoni, E. (2015). Two-dimensional bin packing problem with guillotine restrictions. Ph.D. thesis, University of Bologna, Bologna, Italy. http://amsdottorato.unibo.it/6810/.