Penentuan Rute Pembukaan Gerai Baru dengan Vehicle Routing Problem with Time Windows Pendekatan Nearest Neighbor

Authors

  • Granita Hajar Program Studi Teknik Logistik, Telkom University
  • Desita Nur Rachmaniar Program Studi Teknik Logistik, Telkom University
  • Muhammad Dzulfikar Fauzi Program Studi Informatika, Telkom University

DOI:

https://doi.org/10.35261/gijtsi.v5i01.11323

Abstract

The food and beverage industry are gaining significant attention among the public, as evidenced by the increasing number of food and drink outlets emerging. In some cities, there are even dozens of outlets due to the high level of enthusiasm among people. One particularly popular type of drink outlet currently is boba or bubble tea. Previous research has been conducted to identify potential locations for new outlets. Following the recommendations for new outlets, the research continued by determining the delivery routes for raw materials. The objective of this research is to establish new distribution routes for existing beverage outlets across several locations to minimize travel distance and transportation costs. This study utilizes the Vehicle Routing Problem with Time Windows (VRPTW), which is the most used VRP model in the industrial sector. The results of this research yielded two routes, with distances of 96.4 km and 35.7 km respectively, and travel times of 289.2 minutes and 163.5 minutes.

Downloads

Download data is not yet available.

References

"Badan Pusat Statistik [Online]. Available: https://www.bps.go.id/id/statistics-table/2/MTA0IzI=/pertumbuhan-ekonomi--triwulan-iv-2023.html. [Accessed: April 2024]

M. Ramadhani and N. E. Ikhsan, "Pengaruh Experiental Marketing dan Variasi Produk Terhadap Minat Beli Ulang Pada Outlet Street Boba Cabang Rawamangun," JAMBIS: Jurnal Administrasi Bisnis, vol. 2, no. 4, pp. 595-607, 2022.

M. T. Veronica and I. M. B. Ilmi, "Minuman Kekinian di Kalangan Mahasiswa Depok dan Jakarta," Indonesian Journal of Health Development, vol. 2, no. 2, pp. 83-91, 2020.

M. D. Fauzi, G. Hajar and A. Kholik, "Penentuan Pembukaan Gerai dengan Menggunakan Analytic Hierarchy Process Empat Layer," JSON: Jurnal Sistem Komputer dan Informatika, vol. 3, no. 4, pp. 458-463, 2022.

P. Toth and D. Vigo, “The Vehicle Routing Problem”, SIAM Monographs on Discrete Mathematics and Applications, 2014.

P. Toth and D. Vigo, Vehicle Routing Problems, Methods, and Applications, 2nd ed., USA: SIAM, 2014.

G. Laporte, "Fifty Years of Vehicle Routing," Transportation Science, vol. 43, no. 4, pp. 408–416, 2009.

M. K. Karim, B. D. Setiawan and P. P. Adikara, "Optimasi Vehicle Routing Problem With Time Windows (VRPTW) pada Rute Mobile Grapari (MOGI) Telkomsel Cabang Malang Menggunakan Algoritma Genetika," Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer, vol. 2, no. 8, pp. 2702-2709, 2018.

D. M. Kamal, L. Nafisah and M. S. A. Khannan, "Analisis Penentuan Rute Distribusi dengan Pendekatan Vehicle Routing Problem Mempertimbangkan Time Windows dan Permintaan untuk Meminimasi biaya Transportasi," Prosiding Industrial Engineering Conference (IEC), 2020.

T. Bektas and G. Laporte, "The Multiple Traveling Salesman Problem: An Overview of Formulations and Solution Procedures," Omega, vol. 39, no. 4, pp. 325–336, 2011.

M. P. De Aragão dan A. Subramanian, "A Fast and Effective Heuristic for the Vehicle Routing Problem with Time Windows based on the Fast Nearest Neighbor Algorithm," European Journal of Operational Research, vol. 233, no. 3, pp. 568-578, 2014

X. Xu and K. Ohno, "An improved nearest neighbor algorithm for vehicle routing problems with time windows," Procedia Engineering, vol. 137, pp. 398-405, 2016

J. Halim, R. M. Heryanto and D. T. Liputra, “Penentuan Rute Distribusi Menggunakan Metode Savings Matrix dengan Algoritma Nearest Insert, Nearest Neighbour, dan Farther Insert pada UMKM Peralatan Plastik”, Go-Integratif: Jurnal Teknik Sistem dan Industri, vol. 04, no. 01, pp. 33-47, 2023

E. Fatma, W. Kartika and A. N. Madyanti, "Penentuan Rute Pengangkut Limbah Medis Optimal Menggunakan Vehicle Routing Problem With Time Windows pada Kasus Multi Depot," JMO: Jurnal Manajemen dan Organisasi, vol. 13, no. 4, pp. 324-335, 2022.

S. A. Silalahi, “Rute Distribusi Limbah Medis Covid-19 dengan Metode VRPTW dan Nearest Neighbor”, JMTRANSLOG: Jurnal Manajemen Transportasi dan Logistik, vol. 08, no.03, pp. 285-298, 2021

A. Chandra and B. Setiawan, “Optimasi Jalur Distribusi dengan Metode Vehicle Routing Problem (VRP)”, Jurnal Manajemen Transportasi dan Logistik, vol. 05, no.02, pp. 105-116, 2018

Published

2024-05-30

How to Cite

[1]
G. Hajar, D. N. Rachmaniar, and M. D. Fauzi, “Penentuan Rute Pembukaan Gerai Baru dengan Vehicle Routing Problem with Time Windows Pendekatan Nearest Neighbor”, GIJTSI, vol. 5, no. 01, pp. 12–21, May 2024.