Penentuan Rute Distribusi Pengiriman Hemodialisa Pack Untuk Menurunkan Biaya dan Waktu Pengiriman Dengan Menggunakan Metode Vehicle Routing Problems

  • Dina Sari Dewi S Universitas 17 Agustus 1945 Surabaya
  • Asmungi Universitas 17 Agustus 1945 Surabaya
Keywords: Distribution, Mixed Integer Linear Programming, Algoritma Sweep, Time, CVRPTW

Abstract

Raska Jaya Medika is one of company location in supplying Hemodialysis medical equipment packs located at Ruko De Farda RK-1, Jl. Keboan Anom Village, Keboan Hamlet, Keboananom, Kec. Gedangan, Sidoarjo Regency, East Java. Hemodialysis Pack is a device to detoxifying the patient's blood to remove hazardous or poisonous metabolitic chemical substances. With high numbers of requests that move randomly, to minimize distances, it is necessary to improve effective delivery routes. The author also considers the use of only 1 fleet for comparative analysis in determining distribution routes. In this study, the sweep algorithm is implemeted for all client clusters and then continues mixed integer linear programming is used to minimize costs by finding the best route without exceeding vehicle capacity. that already exists, the mixed integer linear programming model can save Rp.451,719 or save 4.31% in expendicture. Meanwhile, the time saves 1.070% and the proposed distance is 1.018%.

 

References

W. K. Cahyaningsih, “Penyelesaian Capacitated Vehicle Routing Problem (Cvrp) Menggunakan Algoritma Sweep Untuk Optimasi Rute Distribusi Surat Kabar Kedaulatan Rakyat,” Semin. Nas. Mat. DAN Pendidik. Mat. Univ. Negeri Yogyakarta, 2015.

Wibisono, Logika Logistik. Surabaya: Graha Ilmu, 2018.

Martono, Manajemen Logistik. Jakarta: PT. Gramedia Pustaka Utama, 2018.

D. J. Bowersox, Integrasi Sistem -Sistem Manajemen Distribusi Fisik dan Manajemen Material. Jakarta: PT. Bumi Aksara.

A. Salim, Manajemen Transportasi. Jakarta: PT. Rajagrafindo Persada, 2012.

D. A. Andika, “Vehicle Rounting Problem,” Optimus Tek. Ind. Univesitas Indraparsta PGRI, 2019.

K. W. Buana, “Menggunakan Medote Nearest Neighbors dan Metode Branch and Bound,” Optimus Tek. indutri Univesitas indraparsta pgri, 2018.

Q. Ainia, “Optimasi, Distribusi, Mixed Integer Linear Programing, Algoritma Sweep, CVRPTW, Biaya, Jarak, Waktu,” Fak. Tek., 2020.

Published
2023-09-19
How to Cite
[1]
D. S. D. S and Asmungi, “Penentuan Rute Distribusi Pengiriman Hemodialisa Pack Untuk Menurunkan Biaya dan Waktu Pengiriman Dengan Menggunakan Metode Vehicle Routing Problems”, JTMSI, vol. 2, no. 2, pp. 107-114, Sep. 2023.