For manufacturing companies, the supply chain operations can be very large. Both supplies and delivery to the end customer need to be strategically planned and executed. Inthis thesis, we have looked closer at one of the largest heavy vehicle brands in the world,Scania, and zoomed into a certain part of their supply chain. All parts that are in atruck have their origin, and from this origin, the parts are sent over and over again tothe production facilities of Scania as trucks and buses are being produced. To make surethat the flow of parts to the production units is as efficient as possible, Scania providesits own packaging to the suppliers, and that is what this thesis analyses.We investigate how Scania can make sure that their empty packaging is delivered to thesuppliers in the most cost and CO2 efficient way possible. We begin by describing thecurrent state of the packaging logistics network and what the transport flows look liketoday. From here, we describe the circumstances that are important for the supply chainoperations. Further on we describe theory related to the subject, such as various locationmodels, graphs, networks, and sustainability-related topics among other things. Withhelp from the presented theory and by data preprocessing, we are able to translate theproblem into a mixed integer linear program which tries to minimise the total transportation costs related to the distribution network of packaging. We present our findings anddiscuss the relevance of the results obtained. Finally, we give our recommendations andprovide suggestions for further studies within the area.
Identifer | oai:union.ndltd.org:UPSALLA1/oai:DiVA.org:umu-225767 |
Date | January 2024 |
Creators | Berglund, Max |
Publisher | Umeå universitet, Institutionen för matematik och matematisk statistik |
Source Sets | DiVA Archive at Upsalla University |
Language | English |
Detected Language | English |
Type | Student thesis, info:eu-repo/semantics/bachelorThesis, text |
Format | application/pdf |
Rights | info:eu-repo/semantics/openAccess |
Page generated in 0.0021 seconds