Publication Search

Distribution is an important aspect that affects the operational efficiency of a company, especially in terms of goods delivery. This study aims to develop an optimization model for LPG gas distribution routes using Excel Solver based on geographic coordinate conversion. In this study, the method used includes converting geographic coordinates from decimal to Degree-Minute-Second (DMS) format, followed by conversion to kilometers to form a more accurate distance matrix. The optimization model was built using the Capacitated Vehicle Routing Problem (CVRP) approach, which takes into account vehicle capacity constraints (a maximum of 560 cylinders per truck) and the limited number of available fleets, which is only one truck. The results show that coordinate conversion produces high accuracy in calculating distances between distribution locations. By using Excel Solver, the optimization solution successfully minimizes the total distance traveled compared to the conventional route, where distribution is carried out more evenly to 57 scattered LPG base locations. The addition of Solver Parameters Evolutionary and All Different constraints proved effective in avoiding duplication of visits and producing optimal distribution routes. This solution not only improves distribution time and cost efficiency, but also improves service to customers by reducing delivery delays. The success of this optimization model is expected to be implemented by other distribution companies to improve their operational performance. This study also highlights the importance of selecting the right software to aid the distribution optimization process. Excel Solver, despite its simplicity, proved highly effective in solving complex distribution routing problems, especially when combined with coordinate conversion techniques that yield more accurate distances. Furthermore, the application of the CVRP method enabled more efficient decision-making in determining distribution routes, taking into account vehicle capacity and fleet limitations.

Waste transportation activities are an example of a form of Capacitated Vehicle Routing Problem (CVRP) related to finding the minimum route. The Tabu Search algorithm is one of the metaheuristic methods that can guide the heuristic local search procedure to explore the solution area outside the local optimal point. The Tabu Search algorithm can be used to find the optimal VRP solution, namely the route that has the minimum total mileage by considering vehicle capacity. The purpose of this research is to determine the optimal route for garbage transportation in the Capacitated Vehicle Routing Problem (CVRP) model in Padang Sidempuan City using the Tabu Search algorithm. Based on the results of the study, it is concluded that the optimal route for transporting waste in the Capacitated Vehicle Routing Problem (CVRP) model in Padang Sidempuan City using the Tabu Search algorithm obtained the shortest route in iteration 1 with the route (12-11-10-9-8-7-6-5-4-3-2-1-0) and route length 16.55 km.

Distribution routes are generally a problem for every company, including in the public company BULOG Medan Amplas. Distribution to the Medan Amplas BULOG public company, namely having to serve every stall that is far from the warehouse with scattered locations, and limited vehicle capacity. So far, driver considerations in distributing products have only been based on random intuitions of driver and does not consider the efficiency of the route taken. Therefore, this research uses Clarke and Wright Savings algorithm to obtain optimal mileage by taking into account every consumer demand and vehicle capacity. Calculation results using the Clarke and Wright Savings Algorithm obtained the vehicle mileage of 695.08 km with a savings of 11 km or 1.56%.