Determining The Delivery Of Goods Using The K-Nearest Neighbor Algorithm And The Saving Matrix Method To Obtain The Optimal Route And Save Costs

Abstract

Delivery of goods is a transaction or agreement between the seller and the buyer that produces an item to be transported and sent to the buyer. This study found problems with the late delivery of goods, namely limited vehicle capacity which resulted in delays in delivery of goods by sellers, delays in receiving goods by customers, and expensive transportation costs as a result where customers became dissatisfied with delivery services, decreased number of purchases, decreased delivery of goods and losses incurred suffered by the company or the seller in terms of costs or profits. The k-nearest neighbor algorithm is a classification technique by choosing a distance based on the size of the shortest distance and a saving matrix method that will form a delivery route taking into account vehicle capacity and saving on transportation costs. And later it will be formed into several new routes that aim to facilitate the delivery of goods with the advantage of providing satisfaction to customers and being able to save on transportation costs. So this research was developed for the route of delivery of goods by taking into account the capacity and number of vehicles which in previous studies regarding delivery routes. The results of this study solve the problem quite optimally at 12.67% or Rp. 757,356 cost savings while the delivery of goods resulted in 6 shipping lines instead of 11 shipping lines which cut 5 shipping lines or 11.11% for a total of 1532.15 Km.