1876. Solving the 2DBPP on circular bins
Invited abstract in session MC-21: Irregular packing and cutting, stream Cutting and packing (ESICUP).
Monday, 12:30-14:00Room: Esther Simpson 2.12
Authors (first author is the speaker)
| 1. | Mauro Dell'Amico
|
| DISMI, Università degli Studi di Modena e Reggio Emilia | |
| 2. | Andrea Corsini
|
| Department of Science and Methods for Engineering, University of Modena and Reggio Emilia | |
| 3. | Matteo Magnani
|
| Sciences and Methods for Engineering, University of Modena and Reggio Emilia | |
| 4. | Giovanni Tamburoni
|
| Engineering, University of Modena and Reggio Emilia |
Abstract
The classical Two Dimensional Bin Packing Problem (2DBPP) asks to pack a given set of rectangular objects into the minimum number of identical rectangular bins. Recently [1] a variant has been introduced in which the bins are circles (2DCBPP. These problems find application in industrial settings, such as the placement of chips on circular silicon wafer. In this work we study how effective solution methods developed for 2DBPP can be adapted to the 2DCBPP, by highlighting the challenges posed by the circularity of the bin. We also propose a Non-Linear convex mathematical model for the exact solution of the problem. We analyze the behavior of the exact and heuristic approaches through extensive computational experiments.
[1] T. Zhang, R. Wang, H. Zhang, Q. Liu and L. Wei (2024), “A skyline-based heuristic for orthogonal packing rectangles in a circle”, Computer and Oper. Res. 167.
Keywords
- Combinatorial Optimization
- Metaheuristics
- Programming, Nonlinear
Status: accepted
Back to the list of papers