Proceedings

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

Download BibTeX Cite

Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence. Pages 699-703.

https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-123

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.

Zhaoyi Zhang, Songshan Guo, Wenbin Zhu, Wee-Chong Oon, and Andrew Lim. 2011. Space Defragmentation Heuristic for 2D and 3D Bin Packing Problems. In Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence, IJCAI-11. IJCAI, 699–703. https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-123
Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards