Vehicle Routing Problem Settlement for Supply Chain Network of Batik SMEs in Pamekasan District Area

摘要

Distribution channels of batik material throughout the batik SMEs in Pamekasan District should be optimized because the characteristics of those channels will influence the production cost. These batik SMEs will have their supplier settled in Kolpajung, Pamekasan area, which will bebuilt by the Department of Industry and Commerce (Dinas Perindustrian dan Perdagangan or Disperindag) to reduce the competition between the SMEs and also to improve the competitiveness of Pamekasan District. This problem is called the vehicle routing problem (VRP), which has the aim of minimizingthe distance of the route in the distribution network. VRP is a complex combinatorial optimization problem, thus the metaheuristic optimization approach in this situation is excellent to solve the problem. This study uses the Deferential Evolution (DE) method, which is part of metaheuristicapproach. DE is well known for its fast optimization characteristics due to its simple optimization strategy. The results of this study showed that the shortest distance obtained to send raw materials to all of the 37 batik SMEs in Pamekasan is 390,16 kilometers. The number of the vehiclesneeded was as many as 16 vehicles in one-time shipment (16 routes), with the type of the vehicles used was box-trucks with six double wheels and 48 m~(3) of capacity per truck.