<![CDATA[AbstrakProses pengadaan bahan baku merupakan suatu kegiatan yang krusial dalam industri manufaktur,sehingga dituntut untuk lebih efektif dan efisien. Dalam pengadaan bahan baku, salah satu proses yangsangat berpengaruh terhadap biaya yang harus dikeluarkan perusahaan adalah proses transportasi.Sehingga, penelitian ini bertujuan untuk meminimasi biaya transportasi yang timbul pada PT HinoMotors Manufacturing Indonesia dengan melakukan optimasi rute penjemputan bahan baku denganmemanfaatkan sistem milkrun. Dimana dalam penentuan rute optimalnya akan dilakukan dengancapacited vehicle routing problem menggunakan metode saving matrix dan pengurutan rute denganmetode nearest neighbor. Diperoleh hasil tiga rute dengan urutan penjemputan rute 1 (HMMI-CHINTC-GMU-HMMI),rute 2 (HMMI-DSI-SGT-HMMI) dan rute 3 (HMMI-OTI-TBI-3M-HMMI),sehingga mampu mereduksi jarak tempuh truk sebesar 350 km dan biaya transportasi sebesar 30,8%per hari. Atau sekitar Rp2.871.153,-.Kata kunci: milkrun delivery; nearest neighbor; saving matrix; vehicle routing problem. Abstract Procurement process of material is a crucial activity in manufacturing industry, so it’s demanded to beboth effective and efficient. In procurement of material, one of the processes that spends the most ofcost is transportation process. So that the aim of this research is to minimize the transportation cost inPT Hino Motors Manufacturing Indonesia dengan incurred by optimizing the pick up route of materialusing milkrun system. Capacited Vehicle Routing Problem (CVRP) with saving matrix and nearestneighbor will be used to determine the optimal route to reach the goal. From the computation andanalysis, there are three routes obtained with the sequence of route 1 (HMMI-CHI-NTC-GMU-HMMI),route 2 (HMMI-DSI-SGT-HMMI) and route 3 (HMMI-OTI-TBI-3M-HMMI). With the suggested routeand sequence will be able to reduce 350 km truck daily mileage and 30,8% of the daily transportationcost or around Rp2.871.153,-. Keywords: milkrun delivery; nearest neighbor; saving matrix; vehicle routing problem]]>
