Determining the vehicles routes by considering its different types and capacity (heterogeneous) to minimize the total distribution cost

Packaged sugar is one of the products in sugar cane manufacture, PT Madubaru Yogyakarta. Currently, the company deals with a high distribution cost because there is no plan to determine the vehicle route, vehicle type, and capacity for distributing the product. In this research, the optimum route of the distributing vehicles is developed. The company has three different types and capacity of vehicles: L300, HD, and PS. A problem in determining the distribution route here is called as Vehicle Routing Problem (VRP). The basic form of classic VRP says that all vehicles owned by a company have the same capacity (homogenous), meanwhile not all companies have the vehicles with same capacity. The heterogeneous variant is used to minimize the fixed cost of vehicles and distribution variant cost using Sequential Insertion Algorithm. This research has three purposes; are minimizing the number of vehicles used (NV), Total time of Completion tour (TCT) and Distribution Total Cost (TCD). The results based on a test calculation of a shipment date (August 19, 2016) of the company show three alternative solutions to distribute the packaged sugar to 12 consumers. The third alternative solution is the optimal solution and chosen as the decision result of the packaged sugar shipment. Based on the calculation results, it is needed 2 vehicles type HD with capacity 7,000 kg and type PS with capacity 3,500 kg, with total time of completion tour (TCT) is 828.49 minutes or 13.81 hours, and distribution total cost is IDR. 959,011.

Abstract licence: CC BY

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.