Optimization of bottle boxing using mathematical programming methods

Eder Cardoso Santana

Bakalářská práce

Abstract:

This work proposes a solution to improve the quality of work in warehouses and tests several bin-packing algorithms and the Knapsack algorithm that guide workers to correctly pack items. As part of the study, real data was collected and modeled, based on which test instances were created for the Next Fit, First Fit, Best Fit and Worst Fit algorithms, the results of which were then processed by the DPS3UK knapsack algorithm. With the help of the obtained data, a graphic representation of optimal packaging solutions was created to help workers make better decisions. The proposed solution aims to reduce the number of accidents that occur due to poorly packed products and further optimize the use of filler materials and ensure that items are packed in the right size boxes. The study demonstrates the feasibility of this approach, although it has several limitations. However, the results offer promising potential for future improvements and applications in other industries that require efficient packaging solutions.

Keywords

Knapsack Problems, Linear Programming, Packing, Bin-packing, Graphical representations, Warehouse operations, Guillotine cut, Worse fit, Best fit

Jazyk práce: angličtina

Datum vytvoření / odevzdání či podání práce: 18. 3. 2023

Obhajoba závěrečné práce

• Obhajoba proběhla 15. 5. 2023
• Vedoucí: Ing. Robert Hlavatý, Ph.D.
• Oponent: Tereza Sedlářová Nehézová, Ing.

Česká zemědělská univerzita v Praze

Provozně ekonomická fakulta

Bakalářský studijní program:
Informatics