Track: Supply Chain and Logistic Competition

Abstract

The newspaper industry has different policies from other industries, especially in the distribution process. This is because there is a time limit for sending newspapers so that the information that reaches customers remains up-to-date. The process of distributing newspapers has determined the number of requests and several destination agents scattered in several areas, so the problem of newspaper distribution is categorized in the Vehicle Routing Problem with Time Windows (VRPTW). The purpose of this study is to obtain the shortest route and minimal distribution costs based on demand data and agent coordinate data that have been determined and the assumptions used by researchers. Determination of the optimal route is done by using the DE (Differential Evolution) algorithm with shipping plans with other newspaper industries (joint delivery). The results of the calculation of route distance, travel time and distribution costs will be compared with the current initial conditions. Based on the results of calculations using the DE algorithm, obtained a total distance of 142,95 km with a travel time of 2 hours 51 minutes and a total distribution cost of IDR. 45.565. With joint delivery planning, savings of 53,62% in terms of distribution costs are obtained.