Solving the Capacitated Vehicle Routing Problem with Heterogeneous Fleet Using Heuristic Algorithm in Poultry Distribution

Abstract

The problem that is often experienced in the delivery of goods from distributor to the destination is the delivery route that is not sufficient with the vehicle's capacity. This matter is crucial because it can affect the clients' trust on the shippers in the distributor. This problem can be analyzed using Capacitated Vehicle Routing Problem (CVRP) with Clarke and Wright Algorithm. This research begins with determining the distance between all coordinates with Euclidean Distance, making the distance matrix between places to go. After that, the calculation CVRP using Clarke and Wright Algorithm is exected in this study, a calculate CVRP using Clarke and Wright algorithm can help of Python. The study was conducted at 16 customers coordinates, the results obtained by 4 routes with total load 4751 kg and distance 436 km. Route of delivery the first route 924 kg load and distance 80 km, second route 962 kg load and distance 112 km, third route 1450 kg load and distance 144 km, and the fourth route 1415 kg load and distance 100 km.

Using Routing Heuristics to Improve Cost Interoperability: Strategy, Modelling Annotations, and Dynamism

“…In terms of distribution speed relative to the traveling distance, it is advisable to focus on rapid deployment as possible because the delivery of goods along predetermined routes could reduce resource waste, optimizes cost utilization, and reduces errors in the distribution of tasks (Chen et al, 2023;Ochelska-Mierzejewska, Poniszewska-Marańda, & Marańda, 2021;Ouhader & El kyal, 2017a;Sularno, Mulya, Astri, & Mulya, 2021). The distribution of goods among available logistics warehouses and customer demand is strongly correlated in previous studies as among the main contributors toward cost optimality (Fitriani, Pratama, Zahro, Utomo, & Martini, 2021;Kasanah, Qisthani, & Munang, 2022).…”

Distribution Path Segmentation Using Route Relocation and Savings Heuristics for Multi-Depot Vehicle Routing

“…The outcomes are comparable to performance assessments made using standard benchmarks and analysis of the selected algorithms. Using poultry distribution from Indonesia, the issue of vehicle routing with capacity has also been solved [10]. This study used Euclidean distance to calculate the distance between all coordinates, create a distance matrix between destinations and perform calculations using combinatorial calculations.…”