Optimalisasi On Time In Full (OTIF) Pengiriman Barang Dengan Metode Vehicle Routing Problem pada PT XYZ

Abstract

Ketepatan dan kelengkapan pengiriman barang merupakan indikator utama kinerja distribusi pada perusahaan jasa logistik yang diukur melalui On Time In Full (OTIF). PT XYZ masih menghadapi permasalahan rendahnya pencapaian On Time In Full (OTIF) akibat perencanaan rute pengiriman yang belum optimal. Penelitian ini bertujuan untuk mengoptimalkan OTIF pengiriman barang dengan menerapkan metode Vehicle Routing Problem. Metode Saving Matrix dan Nearest Neighbour dan Nearest Insertion digunakan untuk membentuk dan mengoptimalkan rute pengiriman dari segi kapasitas dan total jarak tempuh, metode Time Window digunakan untuk memastikan kesesuaian jadwal pengiriman sesuai dengan jadwal operasional setiap pelanggan, sedangkan Algoritma Prim dan Kruskal digunakan sebagai metode pelengkap dalam pembentukan jaringan rute minimum. Implementasi rute usulan mampu meningkatkan pencapaian OTIF dari 95,06% menjadi 100%.

The timeliness and completeness of goods delivery are key indicators of distribution performance in logistics service companies, measured through the On Time In Full (OTIF) metric. PT XYZ is still facing challenges in achieving optimal OTIF performance due to inefficient delivery route planning. This study aims to optimize delivery OTIF by applying the Vehicle Routing Problem approach. The Saving Matrix method was used to form delivery clusters based on vehicle capacity, while the Nearest Neighbour and Nearest Insertion methods were applied to determine customer visitation sequences and optimize total travel distance. The Time Window method was employed to ensure that delivery schedules were aligned with each customer's operating hours, whereas Prim's and Kruskal's algorithms were utilized as supporting methods in establishing a minimum route network. The implementation of the proposed routes increased OTIF achievement from 95.06% to 100%.