Integer Programming Models for the Class Constrained Multi-Level Bin Packing Problem
A.N. Kordyl (TU Delft - Electrical Engineering, Mathematics and Computer Science)
M.G. Horn – Mentor (TU Delft - Algorithmics)
Neil Yorke-Smith – Mentor (TU Delft - Algorithmics)
Tom Viering – Graduation committee member (TU Delft - Computer Science & Engineering-Teaching Team)
More Info
expand_more
GitHub repository with source code and reproducibility package for the project.
https://github.com/agatak7/CCMLBPOther than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
Abstract
The Multi-Level Bin Packing problem is a generalisation of the widely-known NP-hard Bin Packing problem. This work aims to investigate approaching this problem, as well as a version including Class Constraints, through integer programming. By modelling the problems in two ways: standard, and with a network flow approach. The studying of the performance of these formulations on various instances, provides a greater insight into the possibilities of integer programming for this purpose. Furthermore, evaluating the two approaches gives an initial suggestion for developing effective models for solving the aforementioned problems.