Completion of the CVRP Model for the Case of Distribution of Leather Raw Materials in Garut Using the Sweep Alghorithm Approach
taptajani dedi; Andri Ikhwana; Yusuf Mauluddin; Rina Kurniawati; dody Chandrahadinata

Sekolah Tinggi Teknologi Garut

Abstract

Vehicle Routing Problem (VRP) is a problem related to determining optimal routes and involves more than one vehicle that pays attention to several obstacles to serve a number of agents according to demand. One variant of VRP is the capacitated vehicle routing problem (CVRP). This variant adds vehicle capacity constraints as one of the considerations in distributing it to each agent. The purpose of this paper is to explain the formation of a model of CVRP for the problem of the distribution of leather raw materials to each craftsman or agent while the solution is to use a sweep algorithm approach. Algorithm This is an algorithm that consists of two stages, the first stage is agent clustering and the next stage is to form a delivery route for each cluster using the Nearest Neighbor method. This study is very important in order to apply the basis for understanding the possibility of increasing service levels in the process of distributing leather raw materials in Garut Regency.

Keywords: capacitated vehicle routing problem; sweep algorithm; Nearest Neighbor

Topic: Industry Engineering