Track: Supply Chain Management

Abstract

PT Aksara Solopos is a newspaper publishing company with daily distribution. One of the problems that often occur in the Newspaper Industry is the delay in the delivery of newspapers to customers. In this study, the solution to the Capacitated Vehicle Routing Problem was solved using the Cheapest Insertion Heuristic algorithm and the sweep algorithm on the daily distribution. The sweep algorithm is a two-stage algorithm, the first stage consists of customer clustering in which the initial clustering is done by connecting the points in one cluster based on the maximum capacity of the vehicle, and the second stage is forming routes for each cluster. The Cheapest Insertion Heuristic Algorithm is an Insertion algorithm in which each additional auxiliary point to be inserted into the subtour has the minimum insertion weight. Data collection uses historical data aka secondary data, does not make direct observations due to the COVID-19 pandemic. The research only focuses on the distribution of newsagents in the Kartasura-Klaten-Sragen area and does not consider the rate of return. The addition of data that assumes the number of agents is 2, geographic coordinate data, namely latitude and longitude from the agent's location using Google Maps, and distance matrix data between agents and PT Aksara Solopos. Based on the distance traveled for each route that has been obtained, the three travel times is less than 5 hours of newspaper delivery. So that it is in accordance with the company's time windows policy.

Keywords

Best routing, Sweep clustering, Cheapest Insertion Heuristic, Capacitated Vehicle Routing Problem.