Space defragmentation heuristic for 2D and 3D bin packing problems

Zhaoyi Zhang, Songshan Guo, Wenbin Zhu*, Wee-Chong Oon, Andrew Lim

*Corresponding author for this work

    Research output: Chapters, Conference Papers, Creative and Literary WorksRGC 32 - Refereed conference paper (with host publication)peer-review

    13 Citations (Scopus)

    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 languageEnglish
    Title of host publicationProceedings of the Twenty-Second International Joint Conference on Artificial Intelligence
    PublisherAAAI Press/International Joint Conferences on Artificial Intelligence
    Pages699-704
    Volume1
    ISBN (Electronic)978-1-57735-516-8
    ISBN (Print)978-1-57735-513-7
    DOIs
    Publication statusPublished - Jul 2011
    Event22nd International Joint Conference on Artificial Intelligence, IJCAI 2011 - Barcelona, Catalonia, Spain
    Duration: 16 Jul 201122 Jul 2011

    Conference

    Conference22nd International Joint Conference on Artificial Intelligence, IJCAI 2011
    PlaceSpain
    CityBarcelona, Catalonia
    Period16/07/1122/07/11

    Fingerprint

    Dive into the research topics of 'Space defragmentation heuristic for 2D and 3D bin packing problems'. Together they form a unique fingerprint.

    Cite this