Proposed Package Distribution Routes at PT. Pos Indonesia Mail Processing Center Bandung

Arida Murti Martikasari; Irwan Yulianto

doi:10.37577/sainteks.v6i02.656

Arida Murti Martikasari ULBI
Irwan Yulianto Universitas Al Masoem

DOI: https://doi.org/10.37577/sainteks.v6i02.656

Keywords: Vehicle Routing Problem, Clarke and Wright Savings Algorithm, Nearest Neighbor Algorithm

Abstract

Pos Indonesia is a delivery service provider company that has a central distribution center in the
region of West Java, which is the Mail Processing Center Bandung. MPC Bandung has a function to regulate
the distribution of packages according to the destination area. The company has a target to minimize
transportation costs when shipping goods. The delivery process carried out by MPC Bandung can be
modeled as the Vehicle Routing Problem (VRP). This research focuses on the efficiency of the distribution
routes of documents and packages to 12 destination post offices in the secondary West Java Region. Analysis
was conducted using two classical heuristic methods, Clarke and Wright Savings and Nearest Neighbor, with
the aim of obtaining a more optimal route in order to minimize transportation costs. Alternative 2, which is
designed using the CAWSA method, was chosen to be the best alternative because it produces the shortest
mileage output of 894.2 km per day with a savings of 54.11% on the existing route, which has a total mileage
of 1,948.7 km. This alternative was chosen as a proposed route improvement for the company. The
transportation cost efficiency was obtained at 50.94% from Rp. 115.546.200 for the existing route to Rp.
56,686,500 for the selected route.

Downloads

Download data is not yet available.

References

Abadi dkk. (2014) : Penentuan Rute Kendaraan Distribusi Produk Roti Menggunakan Metode
Nearest Neighbor dan Metode Sequential Insertion”. Jurnal Institut Teknologi
Nasional,Vol(1).http://jurnalonline.itenas.ac.id. Diakses 8 April 2015.
Asteria, C., (2008): Penentuan Distribusi Dengan Algoritma Tabu Search Untuk VRP Dengan
Time Windows, Universitas Indonesia.
Ball, M.O., Golden, B.L., Assad, A.A., dan Bodin, L.D., (1983): Planning For Truck Fleet Size In
The Presence Of A Common-Carrier Option. A Journal Of The Decision Sciences
Institute, Decision Sciences, Volume14, Issue 1983, Pages 103-120
Ballou, R.H., (1999): Business Logistics Management: Planning organizing, and Controlling
the Supply Chain. 5th ed., Prentice-Hall, Inc. New Jersey
Bhagya, T.G., (2021). Algortitma Genetik Pada Penjadwalan Transportasi Kapal Laut (Studi Kasus PT. Pelni). Journal of Industrial and Manufacture Engineering, 5(2). 81-92.
Caric, T., dan Gold, H., (2008): Vehicle Routing Problem. University of Zagreb:In-the Croatia.
Chopra, Sunil, dan Meindl, P., (2010): Supply chain management: Strategy, planning, and
operations. New Jersey: Prentice Hall.
Clarke, G. dan Wright, J. W., (1964): Scheduling of Vehicles from a Central Depot to a Number
of Delivery Point. Operations Researc, 12(4): 568-581
Damayantie. A., (2021): Usulan Perbaikan Rute Kendaraan Perusahaan Distributor Air
Minum Dalam Kemasan PT. X Kota Bandung, Program Studi Magister Transportasi,
Sekolah Arsitektur, Perencanaan dan Pengembangan Kebijakan, Institut Teknologi
Bandung.
Dantzig, G.B. dan Ramser, J.H., (1959): The Truck Dispatching Problem. Management Science,
Vol 6, No. 1 pp 80-91.
Kallehauge, B., Larsen, J., dan Marsen, O.B.G., (2001): Lagrangean Duality Applied on Vehicle
Routing with Time Windows”, Technical Report, IMM, Technical University of
Denmark.
Kumar, Suresh N. dan Panneerselvam, Ramasamy. (2012). A Survey on The Vehicle Routing
Problem and Its Variants. Intelligent Information Management Vol. 04 No. 03 Page
66–74.
Miro, F., (2005): Perencanaan Transportasi untuk Mahasiswa, Perencana, dan Praktisi.
Erlangga. Jakarta.
Octora, L., (2014): Pembentukan Rute Distribusi Menggunakan Algoritma Clarke And Wright
Savings dan Algoritma Sequential Insertion. Jurnal Online Institut Teknologi
Nasional Bandung.
Suryani, S., Kuncoro, K.R., dan Fathimahhayati, L.D., (2018): Perbandingan Penerapan Metode
Nearest Neighbour Dan Insertion Untuk Penentuan Rute Distribusi Optimal
Produk Roti Pada Ukm Hasan Bakery Samarinda. Program Studi Teknik Industri,
Fakultas Teknik, Universitas Mulawarman.
Taha, H.A., (2017): Operations Research An Introduction, 10th edition. Pearson Education.
Toth, P. and Vigo, D., (2002): An Overview of vehicle routing problems. Editor. The Vehicle
Routing Problem. Philadelphia: Siam. Halaman 1-26.
Judul Artikel
hal. Vol. …., No. …, … 20…
Yeun, L.C., Ismail, W.R., Omar, K., Dan Zirour, M., (2008): Vehicle Routing Problem: Models
And Solutions. Journal Of Quality, Measurement and Analysis, Jqma 4(1) 2008,
205-218.
Zheng, W., Liao, Z., dan Qin, J., (2017). Using a four-step heuristic algorithm to design
personalized day tour route within a tourist attraction. Tour. Manag. (Vol. 62, pp.
335– 349).