资源分类
》 资源 》论文》Space Defragmentation Heuristic for 2D and 3D Bin Packing Problems

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

2019-11-12 | |  82 |   51 |   0

Abstract One of main dif?culties 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 twoand three-dimensional Bin Packing Problems. In conjunction with a bin shuf?ing strategy for incremental improvement, our resultant algorithm outperforms all leading meta-heuristic approaches.

上一篇：A Hybrid Recursive Multi-Way Number Partitioning Algorithm

下一篇：First-Order Extension of the FLP Stable Model Semantics via Modified Circumscription

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...