ML Anthology

Space Defragmentation Heuristic for 2D and 3D Bin Packing Problems

Zhaoyi Zhang, Songshan Guo, Wenbin Zhu, Wee-Chong Oon, Andrew Lim
IJCAI 2011 pp. 699-704
doi:10.5591/978-1-57735-516-8/IJCAI11-123 /ijcai/2011/zhang2011ijcai-space/

Abstract

One of main difficulties of multi-dimensional packing problems is the fragmentation of free space into several unusable small parts after a few items are packed. This study proposes a defragmentation technique to combine the fragmented space into a continuous usable space, which potentially allows the packing of additional items. We illustrate the effectiveness of this technique on the two- and three-dimensional Bin Packing Problems. In conjunction with a bin shuffling strategy for incremental improvement, our resultant algorithm outperforms all leading meta-heuristic approaches.

PDF IJCAI Semantic Scholar

Cite

Text

Zhang et al. "Space Defragmentation Heuristic for 2D and 3D Bin Packing Problems." International Joint Conference on Artificial Intelligence, 2011. doi:10.5591/978-1-57735-516-8/IJCAI11-123

Markdown

[Zhang et al. "Space Defragmentation Heuristic for 2D and 3D Bin Packing Problems." International Joint Conference on Artificial Intelligence, 2011.](https://mlanthology.org/ijcai/2011/zhang2011ijcai-space/) doi:10.5591/978-1-57735-516-8/IJCAI11-123

BibTeX

@inproceedings{zhang2011ijcai-space,
  title     = {{Space Defragmentation Heuristic for 2D and 3D Bin Packing Problems}},
  author    = {Zhang, Zhaoyi and Guo, Songshan and Zhu, Wenbin and Oon, Wee-Chong and Lim, Andrew},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2011},
  pages     = {699-704},
  doi       = {10.5591/978-1-57735-516-8/IJCAI11-123},
  url       = {https://mlanthology.org/ijcai/2011/zhang2011ijcai-space/}
}