Optimization of bottle boxing using mathematical programming methods – Eder Cardoso Santana
Eder Cardoso Santana
Bachelor's thesis
Optimization of bottle boxing using mathematical programming methods
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 …more
Language used: English
Date on which the thesis was submitted / produced: 18. 3. 2023
Thesis defence
- Date of defence: 15. 5. 2023
- Supervisor: Ing. Robert Hlavatý, Ph.D.
- Reader: Tereza Sedlářová Nehézová, Ing.
Citation record
ISO 690-compliant citation record:
CARDOSO SANTANA, Eder. \textit{Optimization of bottle boxing using mathematical programming methods}. Online. Bachelor's thesis. Praha: Czech University of Life Sciences Prague, Faculty of Economics and Management. 2023. Available from: https://theses.cz/id/ej930i/.
Full text of thesis
Contents of on-line thesis archive
Published in Theses:- světu
Other ways of accessing the text
Institution archiving the thesis and making it accessible: Česká zemědělská univerzita v Praze, Provozně ekonomická fakultaCzech University of Life Sciences Prague
Faculty of Economics and ManagementBachelor programme:
Informatics
Theses on a related topic
-
Porovnání RPS a Best-fit na laserovém skeneru
Michal Ovčáčík -
3D Bin Packing Problem s využitím virtuální reality
Michael POMPL -
Transparentní packing pro optické experimenty v rotačním absorbéru
Jiří Hájek -
Bin Packing Problem
Karel Steinmetz -
Plošná optimalizace - Bin Packing Problem
Marek KYSELA
Name
Posted by
Uploaded/Created
Rights