Name
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. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.5591/978-1-57735-516-8/IJCAI11-123 | IJCAI |
Keywords | Field | DocType |
defragmentation technique,free space,additional item,bin packing problem,fragmented space,main difficulty,space defragmentation heuristic,bin shuffling strategy,multi-dimensional packing problem,leading meta-heuristic approach,continuous usable space,incremental improvement | USable,Mathematical optimization,Heuristic,Bin,Packing problems,Computer science,Defragmentation,Fragmentation (computing),Shuffling,Bin packing problem | Conference |
Citations | PageRank | References |
5 | 0.46 | 8 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhaoyi Zhang | 1 | 11 | 0.90 |
| Songshan Guo | 2 | 46 | 6.50 |
| Wenbin Zhu | 3 | 214 | 15.34 |
| Wee-chong Oon | 4 | 111 | 12.72 |
| Andrew Lim | 5 | 937 | 89.78 |