Determination of Optimal Route for Newspaper Distribution Using Sweep Algorithm and Nearest Neighbour Method: Case Study

Abstract

In general, the problem of production and distribution in the paper supply chain is the integration of plans
to minimize total costs. Delivery times are required to be fast, sometimes not fulfilled due to problems in
the production and distribution process. One of the problems with newspaper companies in Surakarta is the
slow distribution process due to the determination of the wrong distribution channel. This article aims to
solve the problem of determining the route of a newspaper company in the city of Surakarta by comparing
two alternative choices, where the first alternative uses two fleets and the second alternative uses three
fleets. This research uses the Sweep Algorithm and the Nearest Neighbor method in order to minimize
time and cost and to determine the best delivery path. From the results of data processing, it was found that
the best proposal was the first alternative, namely by using two fleets because the distance traveled was
shorter with a difference of 0.45 km and resulted in savings of Rp. 467,940.00 every month.