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.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence |
| Publisher | AAAI Press/International Joint Conferences on Artificial Intelligence |
| Pages | 699-704 |
| Volume | 1 |
| ISBN (Electronic) | 978-1-57735-516-8 |
| ISBN (Print) | 978-1-57735-513-7 |
| DOIs | |
| Publication status | Published - Jul 2011 |
| Event | 22nd International Joint Conference on Artificial Intelligence, IJCAI 2011 - Barcelona, Catalonia, Spain Duration: 16 Jul 2011 → 22 Jul 2011 |
Conference
| Conference | 22nd International Joint Conference on Artificial Intelligence, IJCAI 2011 |
|---|---|
| Place | Spain |
| City | Barcelona, Catalonia |
| Period | 16/07/11 → 22/07/11 |