Penyelesaian Capacitated Vehicle Routing Problem with Time Windows Menggunakan Algoritma Greedy dan Tabu Search pada Distribusi Pengiriman Farmasi

Migel Orvin Febryan, Siska Amelia, Yohannes Yohannes

Abstract


Distribusi farmasi merupakan salah satu rantai pasok kritis yang menuntut ketepatan waktu dan efisiensi operasional tinggi. Kompleksitas distribusi farmasi muncul dari ketatnya batasan waktu pengiriman, beragamnya jenis produk dengan karakteristik berat dan volume berbeda, serta keterbatasan kapasitas armada kendaraan yang harus melayani puluhan hingga ratusan titik pengiriman dalam satu hari operasional. Kegagalan memenuhi jendela waktu pelayanan dapat berdampak langsung pada ketersediaan obat di fasilitas kesehatan dan berpotensi membahayakan keselamatan pasien. Penelitian ini bertujuan menyelesaikan permasalahan Capacitated Vehicle Routing Problem with Time Windows (CVRPTW) pada sistem distribusi farmasi menggunakan kombinasi algoritma Greedy dan Tabu Search. Algoritma Greedy dengan strategi nearest neighbor digunakan untuk membentuk solusi awal, sedangkan Tabu Search digunakan untuk mengoptimasi solusi tersebut melalui mekanisme relocate inter-route dan local search 2-opt. Dataset yang digunakan memuat 78 titik pengiriman dengan batasan kapasitas kendaraan sebesar 400 kg berat dan 3 m³ volume. Fungsi objektif yang diminimalkan mencakup total jarak tempuh, total waktu, pelanggaran time window, serta kelebihan kapasitas. Hasil eksperimen menunjukkan bahwa Tabu Search mampu menghasilkan perbaikan nilai fungsi objektif dibandingkan solusi awal Greedy, dengan tetap mempertahankan feasibilitas seluruh rute. Penelitian ini membuktikan efektivitas kombinasi metaheuristik berbasis memori dengan konstruksi heuristik sederhana untuk permasalahan optimasi rute kendaraan berskala nyata.

Keywords


CVRPTW, Algoritma Greedy, Tabu Search, Distribusi Farmasi, Optimasi Rute.

Full Text:

PDF

References


Abass, L. A., Usuemerai, P. A., Ibikunle, O. E., Alemede, V., & Mbata, A. O. (2024). Optimizing Pharmaceutical Supply Chains for Public Health Resilience. In International Journal Of Engineering Research And Development (Vol. 20, Number 11). www.ijerd.com

Boysen, N., Fedtke, S., & Schwerdfeger, S. (2020). Last-mile delivery concepts: a survey from an operational research perspective. OR Spectrum 2020 43:1, 43(1), 1–58. https://doi.org/10.1007/S00291-020-00607-8

Bujel, K., Lai, F., Szczecinski, M., So, W., & Fernandez, M. (2018). Solving High Volume Capacitated Vehicle Routing Problem with Time Windows using Recursive-DBSCAN clustering algorithm. https://arxiv.org/pdf/1812.02300

Elshaer, R., & Awad, H. (2020). A taxonomic review of metaheuristic algorithms for solving the vehicle routing problem and its variants. Computers & Industrial Engineering, 140, 106242. https://doi.org/10.1016/J.CIE.2019.106242

Gmira, M., Gendreau, M., Lodi, A., & Potvin, J. Y. (2021). Tabu search for the time-dependent vehicle routing problem with time windows on a road network. European Journal of Operational Research, 288(1), 129–140. https://doi.org/10.1016/J.EJOR.2020.05.041

Gonçalves-Dosantos, J. C., Davila-Pena, L., & Casas-Méndez, B. (2024). Two-stage heuristic algorithm for a new variant of the multi-compartment vehicle routing problem with stochastic demands. https://arxiv.org/pdf/2410.17302

Hanafi, S., Wang, Y., Glover, F., Yang, W., & Hennig, R. (2023). Tabu search exploiting local optimality in binary optimization. European Journal of Operational Research, 308(3), 1037–1055. https://doi.org/10.1016/J.EJOR.2023.01.001

Konstantakopoulos, G. D., Gayialis, S. P., & Kechagias, E. P. (2020). Vehicle routing problem and related algorithms for logistics distribution: a literature review and classification. Operational Research 2020 22:3, 22(3), 2033–2062. https://doi.org/10.1007/S12351-020-00600-7

Laguna, M., Mart´i, R., Mart´i, M., Martinez-Gavara, A., Perez-Pel´o, S., Pel´o, P., & Resende, M. G. C. (2023). 20 years of Greedy Randomized Adaptive Search Procedures with Path Relinking. https://arxiv.org/pdf/2312.12663

Liu, F., Lu, C., Gui, L., Zhang, Q., Tong, X., & Yuan, M. (2023). Heuristics for Vehicle Routing Problem: A Survey and Recent Advances. https://arxiv.org/pdf/2303.04147

Marrouche, W., Harmanani, H. M., & Chlebíková, J. (2023). A Multi-objective Optimization Approach for the Capacitated Vehicle Routing Problem with Time Windows (CVRPTW). Studies in Computational Intelligence, 1119, 121–143. https://doi.org/10.1007/978-3-031-46221-4_6/SAVE-RESEARCH

Pan, Y., Wang, X., & Li, H. (2024). The Vehicle Routing Problem with Time Windows Based on a Multi-conditional Clustering and Tabu Search Approach. Lecture Notes in Operations Research, Part F3800, 270–282. https://doi.org/10.1007/978-981-97-4045-1_21/SAVE-RESEARCH

Vrani, A., Apostolidis, S. D., Kapoutsis, A. C., & Kosmatopoulos, E. B. (2025). Delivering data: A real-world dataset for last-mile delivery optimization. Data in Brief, 61. https://doi.org/10.1016/j.dib.2025.111762

Zhang, J., Luo, K., Florio, A. M., & Van Woensel, T. (2023). Solving large-scale dynamic vehicle routing problems with stochastic requests. European Journal of Operational Research, 306(2), 596–614. https://doi.org/10.1016/j.ejor.2022.07.015




DOI: https://doi.org/10.46576/device.v7i1.8804

Article Metrics

Abstract view : 0 times
PDF – 0 times

Refbacks

  • There are currently no refbacks.


Copyright (c) 2026 Siska Amelia, Yohannes Yohannes

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.

DEVICE : JOURNAL OF INFORMATION SYSTEM, COMPUTER SCIENCE AND INFORMATION TECHNOLOGY
Terindeks pada:

   

Member Of :


DEVICE : JOURNAL OF INFORMATION SYSTEM, COMPUTER SCIENCE AND INFORMATION TECHNOLOGY

Published by :
FAKULTAS TEKNIK DAN ILMU KOMPUTER
PROGRAM STUDI SISTEM INFORMASI
UNIVERSITAS DHARMAWANGSA

Alamat : Jl. K. L. Yos Sudarso No. 224 Medan
Kontak : Tel. 061 6635682 - 6613783  Fax. 061 6615190
E-mail  : admin_device@dharmawangsa.ac.id

 Creative Commons License

Device : Journal Of Information System, Computer Science And Information Technology by Universitas Dharmawangsa is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.

Based on a work at http://jurnal.dharmawangsa.ac.id/index.php/device