Method for optimising automatic paper roll handling and maximising truck loading capacity
Alves Siqueira, Andre (2022)
2022
Master's Programme in Information Technology
Informaatioteknologian ja viestinnän tiedekunta - Faculty of Information Technology and Communication Sciences
This publication is copyrighted. You may download, display and print it for Your own personal use. Commercial use is prohibited.
Hyväksymispäivämäärä
2022-01-21
Julkaisun pysyvä osoite on
https://urn.fi/URN:NBN:fi:tuni-202112099092
https://urn.fi/URN:NBN:fi:tuni-202112099092
Tiivistelmä
The pulp and paper industry delivers tonnes of paper rolls every day. The rolls are loaded into trucks from the paper roll storage. However, the trucks are not always loaded at their maximum cargo capacity. Optimisation algorithms can help to maximise loading capacity by selecting a set of rolls whose total weight could be equal to or close to the truck's maximum load capacity. Therefore, this thesis aims to develop a method to optimise paper roll handling to maximise the loading capacity.
The WMS holds the information about the location of each roll in the warehouse. Fully automated cranes are the agents that retrieve the rolls to be shipped according to the data sent by the WMS. The idea is to adapt the method to an optimisation algorithm and further integrate it into the WMS. Hence, the cranes could be driven by the method incorporated into the warehouse management system.
The method is based on the 0-1 knapsack problem and its variants, i.e., multiple knapsacks and bin packing. Moreover, the optimisation algorithms used in this work were greedy algorithm, dynamic programming and branch-and-bound.
We created an example that resembles a warehouse operation concerned with handling paper rolls to be loaded into trucks. In the exemplification, we incorporated the method into the algorithms, which used Google optimisation tools as a source code.
Conclusively, the outcomes derived from the usage of the method were satisfactory. However, the results also revealed that further investigation is needed before implementing the method into the warehouse management system.
The WMS holds the information about the location of each roll in the warehouse. Fully automated cranes are the agents that retrieve the rolls to be shipped according to the data sent by the WMS. The idea is to adapt the method to an optimisation algorithm and further integrate it into the WMS. Hence, the cranes could be driven by the method incorporated into the warehouse management system.
The method is based on the 0-1 knapsack problem and its variants, i.e., multiple knapsacks and bin packing. Moreover, the optimisation algorithms used in this work were greedy algorithm, dynamic programming and branch-and-bound.
We created an example that resembles a warehouse operation concerned with handling paper rolls to be loaded into trucks. In the exemplification, we incorporated the method into the algorithms, which used Google optimisation tools as a source code.
Conclusively, the outcomes derived from the usage of the method were satisfactory. However, the results also revealed that further investigation is needed before implementing the method into the warehouse management system.