Zibo Zhou: Two-dimensional irregular bin packing problem
- Speaker
- Zibo Zhou
- Affiliation
- University of Electronic Science and Technology of China
- Date
- Time
- – Asia/Shanghai
- Venue
- 518, Research Building 4
Abstract
We proposes a local search combined with DJD heuristic approach for the two-dimensional irregular bin packing problem (2DIBPP) with limited rotations. The objective of 2DIBPP is to pack a given set of irregular pieces into the minimum number of rectangular bins. This is a core problem of the Manufacturing Execution system. A little improvement can lead to a considerable reduction of raw material and labour source. To solve this problem, we merge pieces by customized fitness value, and use tabu search to prohibit poor merging. Finally, we use the DJD heuristic to place the merged pieces and the pieces that cannot be merged on the bins. The standard benchmark results show that our approach improves the results for most of the instances in the literature.