Implementation of the Greedy Algorithm to determine the nearest route Search in distributing food production. Issue 1 (February 2020)

• Record Type: Journal Article
• Authors: Fahmi, Hasanul; Zarlis, Muhammad; Nababan, Erna B; Sihombing, Poltak
• Is Part Of: IOP conference series. Volume 769:Issue 1(2020)
• Publication Date: 2020-02
• Subjects: Materials science -- Periodicals; 620.1105
• DOI: 10.1088/1757-899X/769/1/012005
• Languages: English
• ISSNs: 1757-8981

Abstract

Abstract: Distribution is the activity of allocating goods from producers to customers within allocated time. Managing product distribution is very important for the survival of a company, yet improper planning and management will cause the production is stacked in the warehouse thus this will cause unhealthy financial cycles and turnover to the company itself. Nowadays many companies produce foodstuffs but one of the major problems faced by the companies are the delays in distributing food production. It is found that the common difficulty faced by the food production companies in distributing the product due to long travelling distance, traffic congestion, natural disasters, ambiguous routes as well as unstructured routes. To overcome the problems, greedy algorithm is implemented. The algorithm able to identify the optimal pathway and time consumption by finding the closest distance, followed by the utmost distance. Therefore this will reduce the cost of distribution and other company resources. The results of this study show that the algorithm identifies Route 5 as the best route. This is because it will go through 5 cities, namely A-B-C-F-G-H with distance of 648KM. Although it is considered as long travelling distance, on the other hand the algorithm suggests that 648KM is the optimum distance to travelling to city H.