Integer Programming Models for the Class Constrained Multi-Level Bin Packing Problem

Kordyl, A.N.

Integer Programming Models for the Class Constrained Multi-Level Bin Packing Problem

Bachelor thesis (2022)

Authors

A.N. Kordyl Electrical Engineering, Mathematics and Computer Science

Contributors

M.G. Horn Algorithmics - (mentor)

N. Yorke-Smith Algorithmics - (mentor)

T.J. Viering Computer Science & Engineering-Teaching Team - (graduation committee member)

Faculty

Electrical Engineering, Mathematics and Computer Science, Electrical Engineering, Mathematics and Computer Science

Integer Programming CPLEX Bin Packing NP-Hard Algorithms NP-hard problems Integer Linear Programming Mixed Integer Linear Programming Optimization Problem

To reference this document use:

http://resolver.tudelft.nl/uuid:7c8a224c-cb08-471e-8e28-9a93cb0ed811

More Info

expand_more

Published Date

24-06-2022

Language

English

Reuse Rights

Other 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.

Faculty

Electrical Engineering, Mathematics and Computer Science

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.

Files

CCMLBP_Research_Paper.pdf

(pdf | 0.419 Mb)

Unknown license