PENERAPAN ALGORITMA PALGUNADI PADA SPLIT DELIVERY VEHICLE ROUTING PROBLEM UNTUK PENDISTRIBUSIAN MULTI PRODUK

Sri Wulandari, Kusrini Kusrini, M. Rudyanto Arief

Sari


 

                    Transportation is one area in the supply chain management that determines how and when to send goods to consumers. Determination of distribution routes has an effect on transportation costs. In delivering goods, the company must be able to determine the configuration of the distribution line appropriately so that shipping becomes fast and does not cost much. This study, we will develop a SDVRP solution method for multiple-products distribution. Solving the SDVRP problem for multiple-products distribution will use the Palgunadi Algorithm with the aim of determining the distribution route so that the minimum total distribution costs are obtained. This study uses data about the distribution of fuel in the NTT region with many agents 8 and many types of products 3. There are 3 types of tankers used. The results of the study produced 3 alternative distributions based on the type of tanker used. The use of type 2 (3,500) tankers results in a minimum total distribution cost with the number of routes and tankers used is 2.

 

Keywords: SDVRP, Palgunadi Algorithm, Multiple Products


Teks Lengkap:

PDF

Referensi


Bodin, L., Golden, B., Assad, A., and Ball, M., Routing and Scheduling of Vehicles and Crews. (1983) The State of the Art, Computer and Operations Research, 10, pp. 63-211

Gendreau, M., Taillard, E.D., and Laporte, G. (1997) Vehicle Routing Problem with Multiple Use of Vehicles, Journal of the Operation Research Society, 36(3),pp. 919–935.

Braysy, O., and Gendreau, M. (2001) Genetic Algorithms for the Vehicle Routing Problem with Time Windows, Arpakannus, 1 pp.33-38

Suprayogi. (2003) Vehicle routing problem: definition, variants, and application, Proceeding Seminar Nasional Perencanaan Sistem industri (SPNSI 2003), Bandung.

Archetti, C., Speranza, M. G., & Hertz, A. (2006) Tabu Search Algorithm for The Split Delivery Vehicle Routing Problem. Transportation Science Vol. 40, No. 1, 64-73

Ika Tofika Rini, Y.s. Palgunadi, Bambang Harjito. (2015) Algoritma Palgunadi Untuk menyelesaikan Single dan Multi Product Vihicle Routing Problem, Seminar Nasional Teknologi Informasi dan Komunikasi 2015 (SENTIKA 2015)

D.B. Pailin dan Erlon Wattimena. (2015) Penerapan Algoritma Sequential Insertion Dalam Pendistribusian BBM di Kawasan Timur Indonesia (Studi Kasus Pada PT. Pertamina UPMS VIII Terminal Transit Wayeme-Ambon), ARIKA, Vol. 09, No. 1

Suprayogi, Daniel Bunga Paillin. (2017) Algoritma Genetika untuk Pemecahan Masalah Rute Kendaraan dengan Ukuran dan Campuran Armada, Trip Majemuk, Pengiriman Terbagi, Produk Majemuk dan Kendaraan dengan Kompartemen Majemuk, Jurnal Teknik Industri, Vol. 19, No. 2.

Putri Elkagianda L.A. dan Sarngadi Palgunadi. (2014) Implementasi Algoritma Palgunadi Sebagai Algoritma Baru dalam Optimalisasi Vehicle Routing Problem With Time Window (VRPTW). Prosiding Seminar Nasional TI 2014 ISSN 1829-9156 Vol. II No 1, Fakultas Teknologi Informasi Universitas Tarumanegara Jakarta.

Astri Desiana, AriYanuar Ridwan, Rio Aurachman.(2016) Penyelesaian Vehicle Routing Problem Untuk Minimasi Total Biaya Transportasi Pada PT XYZ dengan Metode Algoritma Genetika, e-Proceeding of Engineering Vol.3, No.2, Page 2566.

Toth, P. And Vigo, D. (2002) Vehicle Routing Problem, Methods and Applications Second Edition. Philadelphia: Society for Industrial and Applied Mathematics.

Ary Arvianto, Aditya Setiawan, Singgih Saptadi. (2014) Model Vehicle Routing Problem dengan Karakteristik Rute Majemuk, Multiple Time Windows, Multiple Products dan Heterogeneous Fleet untuk Depot Tunggal. Jurnal Teknik Industri, Vol. 16, N0. 2, 85-96.


Refbacks

  • Saat ini tidak ada refbacks.


##submission.license.cc.by-nc-nd4.footer##

Program Studi Teknik Informatika Unversitas Janabadra