Optimal Rice Distribution Route using the Greedy’s Algorithm

Abstract

Distribution is the activity of distributing goods directly or indirectly to consumers. Rice is the main food ingredient for Indonesian people. This study aims to determine the shortest route that is effective in distribution so that the company gets the minimum cost and prevents losses. The research was conducted at one of the rice distributors in Medan, it is known that the distributor does not yet have an optimal distribution channel. The data analysis method used to solve the distribution route problem is the Greedy Algorithm. The greedy algorithm is an algorithm that solves problems step by step, and it was one of the methods in optimization problems. The calculation results show that the shortest and fastest routes to be taken based on the Dijkstra algorithm are: A-20-19-18-17-E-B-12-13-14-15-29-28-F-26-C-8-9-D with a distance of 50.21 km.