Open Access

Alexander Kieroth

• This thesis analyses how the Travelling Salesman Problem can be solved by applying the Simplex LP and the Evolutionary Algorithm with regards to driven kilometres. Each algorithm is solved by using the Excel Solver add-in provided by Microsoft Excel. The results of the two different algorithms are compared with the results of the route planning software PTV Map&Guide Online for the purpose of having a proof that the software works efficiently. Using a cost analysis, the costs for delivering goods are calculated and compared with an external supplier who acted as the outbound logistics for the company HODEY. Now that the delivery is insourced, the costs can be reduced and HODEY gains more control over the outbound logistics. An approach on how to reduce the stop times at the customers’ homes is analysed. Thus, the analysis provides information regarding where the delivery driver wastes most of their time. Additionally, an available space calculation of the delivery vehicles is carried out for the dispatching department of the company to avoid interim loading or unloading not planned for a delivery or retrieval tour