Penentuan Rute Terpendek Di Kantor Pos Kabupaten Blitar Dalam Pendistribusian Paket Menggunakan Algoritma Clarke And Wright Savings

Wildan Faried Anshoriy Puji Wianto, Juhari Juhari, Achmad Nasichuddin

Abstract


Marketing strategy is a very important part in the execution of the overall corporate strategy, especially in a very tight competitor state. Route is a very important aspect considered by goods distribution companies. An effective and efficient distribution process is one of the factors whose conditions begin to align with other indicators in an effort to achieve customer satisfaction. The strategy that can be done is to involve calculating algorithms in contributing systematic and measurable solutions. The  Clarke and  Wright Savings algorithm is an effective method in determining the shortest route of distributing goods, because the Clarke and Wright Savings method  has its own heuristics which make savings in   the form of mileage or distribution time. This study aims to determine the shortest route at the Blitar checkpoint post office (KPRK) in distributing express service type bags to each branch post office point (KPC) using the Clarke and Wright Savings Algorithm.  The results of the discussion on the application of  the Clarke and Wright Savings  method to determine the shortest route for the service bag distribution fleet from the KPRK Blitar post office to KPC can be concluded that, there are two initial routes owned by the company with a total delivery distance of 189.7 km. After calculation, two routes with the shortest distance will be traveled with a total delivery distance of 171 km. Route group 1 is Blitar Post Office à KPC Garum à KPC Nglegokà KPC  Gandusarià KPC Talun KPC Wlingi à KPC Doko à KPC Kesamben à KPC Selopuroà KPC  Binangun à KPC  Kanigoro à KPC Lodoyo à  KPC Kademangan à Post Office with a distance of 116.7 km. As for route 2, namely the blitar  post office à KPC Sanan Kulon à KPC Ponggok à KPC Srengat à KPC Kademangan à KPC Udanawu à Blitar post office with a distance of 54.3 km. With the establishment of routes with the closest distance, the company can save mileage by 9.85%.


Keywords


Clarke and Wright Savings; VRP; Graph; Pos Indonesia

Full Text:

PDF

References


Pos Indonesia, “Sejarah Pos Indonesia,” Pos Indonesia, 2003. https://www.posindonesia.co.id/id/content/sejarah-pos (diakses Feb 01, 2022).

R. Haryanto, “Kualitas Pelayanan Pt. Pos Indonesia (Persero) Kota Dumai,” Angew. Chemie Int. Ed. 6(11), 951–952., vol. 4, no. 2, hal. 763–773, 2014.

G. Chartrand dan P. Zhang, CHROMATIC GRAPH THEORY. New York: CRC Press, 1986.

Andriansyah, Manajemen Transportasi Dalam Kajian dan Teori. Jakarta Pusat: Fakultas Ilmu Sosial dan Ilmu Politik Universitas Prof. Dr. Moestopo Beragama, 2015.

H. I. Salam, J. Widodo, dan M. Zulianto, “Strategi Pemasaran Pada Pt Nuansa Wisata Prima Nusantara Tour & Travel Jember,” J. Pendidik. Ekon. J. Ilm. Ilmu Pendidikan, Ilmu Ekon. dan Ilmu Sos., vol. 13, no. 1, hal. 66, 2019, doi: 10.19184/jpe.v13i1.10422.

A. Irman, R. Ekawati, dan N. Febriana, “Optimalisasi Rute Distribusi Air Minum Quelle Dengan Algoritma Clarke & Wright Saving Dan Model Vehicle Routing Problem,” Semin. Nas. Inov. Dan Apl. Teknol. Di Ind., hal. 1–7, 2017, [Daring]. Tersedia pada: http://ejournal.itn.ac.id/index.php/seniati/article/view/839.

S. Darwis, “Sifat kedua yang dimiliki oleh pengusaha yang diberkahi ‘sifat amanah,’” Nasihat Pekanan Insa. Tak., hal. 1–4, 2013.

G. Clarke dan J. W. Wright, “Scheduling of Vehicles from a Central Depot to a Number of Delivery Points,” Oper. Res., vol. 12, no. 4, hal. 568–581, 1964, doi: 10.1287/opre.12.4.568.

P. Toth dan D. Vigo, “An Overview of Vehicle Routing Problems,” Veh. Routing Probl., hal. 1–26, 2002, doi: 10.1137/1.9780898718515.ch1.

A. Aliyuddin, P. S. Puspitorini, dan M. Muslimin, “Metode Vehicle Routing Problem (VRP) dalam Mengoptimalisasikan Rute Distribusi Air Minum PT. SMU,” Semin. Nas. Tek. Ind. 2017, hal. 147–153, 2017.

D. K. Damayanti, I. Purnamasari, dan Wasono, “Penentuan Rute Terpendek dengan Menggunakan Metode Algoritma Clarke and Wright Savings,” J. EKSPONENSIAL, vol. 12, no. 1, hal. 65–72, 2021.

L. Octora, A. Imran, dan S. Susanty, “Pembentukan Rute Distribusi Menggunakan Algoritma Clarke & Wright Savings dan Algoritma Sequential Insertion,” Reka Integr., vol. 2, no. 2, hal. 1–11, 2014.

P. Rezki, A. Sahari, dan Resnawati, “Penetuan Rute Pendistribusian Tabung Gas LPG 3 Kg Menggunakan Metode Clarke and Wright,” J. Ilm. Mat. dan Terap., vol. 13, no. 1, hal. 60–69, 2016.

L. Bouhafs, A. Hajjam, dan A. Koukam, “A hybrid ant colony system approach for the capacitated vehicle routing problem,” Lect. Notes Comput. Sci. (including Subser. Lect. Notes Artif. Intell. Lect. Notes Bioinformatics), vol. 3172 LNCS, hal. 414–415, 2004, doi: 10.1007/978-3-540-28646-2_42.

F. D. Putra, F. Rakhmawati, dan H. Cipta, “Penentuan Rute Transportasi Kendaraan Umum Kota Medan Dengan Menggunakan Nearest Neighbor Method Dan Closed Insertion Method,” Zeta - Math J., vol. 6, no. 2, hal. 6–10, 2021.




DOI: https://doi.org/10.18860/jrmm.v2i6.22413

Refbacks

  • There are currently no refbacks.