Solving the Multi-Level Bin Packing Problem with Time Windows using Integer Programming

Bachelor thesis (2022)

Authors

M.L. Le Blansch Electrical Engineering, Mathematics and Computer Science

Contributors

M.G. Horn Algorithmics - EEMCS (mentor)
N. Yorke-Smith Algorithmics - EEMCS (mentor)
T.J. Viering Computer Science & Engineering-Teaching Team - EEMCS (graduation committee member)
Faculty
Electrical Engineering, Mathematics and Computer Science, Electrical Engineering, Mathematics and Computer Science
Copyright: © 2022 Max Le Blansch
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

This paper introduces and studies the Multi-Level Bin Packing Problem with Time Windows. This is a NP-hard problem with real-world applications in logistics. This problem states that items with certain sizes need to be packed inside bins without exceeding their capacity. These bins then again need to be assigned to other bins while minimizing the cost of the used bins. At the same time, each item has a time interval and there must be a common time point between all the items that are packed in the same bin that should be as early as possible. Not much research has been done regarding this problem. In this paper, we suggest multiple models that can be solved using Integer Programming and compare their performance. The results show slight differences in performance between the models.

Files

Research_Paper.pdf
(pdf | 0.421 Mb)
Unknown license