Vehicle Routing Problem as a Solution for Determining Goods Delivery Routes PT. Kreasi Beton Nusa Persada
DOI:
https://doi.org/10.23887/jstundiksha.v12i3.67809Kata Kunci:
Vehicle Routing, delivery, optimizationAbstrak
VRP distributions have had difficulty overcoming the problem of finding channels with minimal depots to locations that have different places with different total demand. The purpose of this study is to analyze the problem of transportation routes in the distribution of products obtained from the initial location of distribution to users. This type of research is qualitative research. This research was conducted at PT. Nusa Persada Concrete Creations. The Nearest Neighbor method is used to determine the distribution of routes. The Local Search method is carried out to evaluate and improve the distribution of routes carried out at the beginning with the Nearest Neighbors method. The data analysis process consists of several stages with the Nearest Neighbor method and the LocalSearch method. The results of the study, namely the Model Vehicle Routing Problem (VRP) applied in determining ready mix delivery routes at PT. Nusapersada Concrete Creation using nearest and local neighbor methods. Vehicle Routing Problem (VRP) models using nearest and local neighbor methods can be used applied in determining ready mix delivery routes to limited companies. Nusapersada Concrete Creations. This makes distance and time more effective, as well as more cost efficient. New routes generated This is a route improvement solution that PT. The application of the Nusapersada Concrete Creations model results in a new route that reduces the distance closer, faster completion time, and fuel cost savings for truck vehicles compared to the initial route. This makes distance and time more effective, as well as more cost efficient.
Referensi
Al Theeb, N., Abu-Aleqa, M., & Diabat, A. (2023). Multi-Objective Optimization of Two-Echelon Vehicle Routing Problem: Vaccines Distribution as a case study. Computers & Industrial Engineering, 187. https://doi.org/10.1016/j.cie.2023.109590.
Arnold, F., Gendreau, M., & Sörensen, K. (2019). Efficiently solving very large-scale routing problems. Computers & Operations Research, 107, 32–42. https://doi.org/10.1016/j.cor.2019.03.006.
Arnold, Florian, & Sörensen, K. (2019). Knowledge-guided local search for the vehicle routing problem. Computers & Operations Research, 105, 32–46. https://doi.org/10.1016/j.cor.2019.01.002.
Arvianto, A., Setiawan, A. H., & Saptadi, S. (2014). Model Vehicle Routing Problem dengan Karakteristik Rute Majemuk, Multiple Time Windows, Multiple Products dan Heterogeneous Fleet untuk Depot Tunggal. Jurnal Teknik Industri, 16(2), 85–96. https://doi.org/10.9744/jti.16.2.83-94.
Battarra, I., Accorsi, R., Lupi, G., Manzini, R., & Sirri, G. (2022). Location-allocation problem in a multi-terminal cross-dock distribution network for palletized perishables delivery. Transportation Research Procedia, 67, 172–181. https://doi.org/10.1016/j.trpro.2022.12.048.
Beheshtiniya, M. A., & Aarabi, A. (2017). A genetic algorithm for integration of vehicle routing problem and production scheduling in supply chain (case study: medical equipment supply chain). Advances in Industrial Engineering, 51(2), 147–160. https://doi.org/10.22059/JIENG.2017.62209.
Dastpak, M., Errico, F., & Jabali, O. (2023). Off-line approximate dynamic programming for the vehicle routing problem with a highly variable customer basis and stochastic demands. Computers & Operations Research, 159. https://doi.org/10.1016/j.cor.2023.106338.
Dhoruri, A., & Sari, E. R. (2016). Penyelesaian Capacitated Vehicle Routing Problem Menggunakan Saving Matriks, Sequential Insertion dan Nearest Neighbour di Victoria RO. Jurnal Matematika-S1, 5(3), 1–11. https://journal.student.uny.ac.id/index.php/jktm/article/view/4621.
Fan, L., Liu, C., Dai, B., Li, J., Wu, Z., & Guo, Y. (2023). Electric vehicle routing problem considering energy differences of charging stations. Journal of Cleaner Production, 418. https://doi.org/10.1016/j.jclepro.2023.138184.
Fatma, E., Kartika, W., & Madyanti, A. N. (2022). Penentuan Rute Pengangkut Limbah Medis Optimal Menggunakan Vehicle Routing Problem with Time Window pada Kasus Multi Depot. Jurnal Manajemen Dan Organisasi, 13(4), 324–335. https://doi.org/10.29244/jmo.v13i4.38587.
Ferdiansyah, A., Sholihah, S. A., Rifni, M., Grets, E. S., Situmorang, J. K., & Oktaviany, I. (2021). Analisis Perencanaan Rute Pengiriman Barang Menggunakan Metode Vehicle Routing Problem (VRP). Journal Sistem Transportasi Dan Logistik, 1(1), 4–9. https://doi.org/10.54324/jstl.v1i1.632.
Jia, M., & Chen, F. (2023). Upward scalable vehicle routing problem of automobile inbound logistics with pickup flexibility. Transportation Research Part E: Logistics and Transportation Review, 177. https://doi.org/10.1016/j.tre.2023.103253.
Juliandri, D., Mawengkang, H., & Bu’Ulolo, F. (2018). Discrete optimization model for vehicle routing problem with scheduling side cosntraints. IOP Conference Series: Materials Science and Engineering, 300(1). https://doi.org/10.1088/1757-899X/300/1/012024.
Kristina, S., Doddy Sianturi, R., & Husnadi, R. (2020). Application of the Capacitated Vehicle Routing Problem (CVRP) Model Using Google OR-Tools to Map Drug Delivery Routes to Pharmaceutical Wholesale Companies (Penerapan Model Capacitated Vehicle Routing Problem (CVRP) Menggunakan Google OR-Tools untuk Penen. Jurnal Telematika, 15(2), 101–106.
Kumari, M., De, P. K., Chaudhuri, K., & Narang, P. (2023). Utilizing a hybrid metaheuristic algorithm to solve capacitated vehicle routing problem. Results in Control and Optimization, 13. https://doi.org/10.1016/j.rico.2023.100292.
Lin, C., Choy, K. L., Ho, G. T., Chung, S. H., & Lam, H. Y. (2014). Survey of Green Vehicle Routing Problem: Past and future trends. Expert Systems with Applications, 41(4), 1118–1138. https://doi.org/10.1016/j.eswa.2013.07.107.
Lin, J., Zhou, W., & Wolfson, O. (2016). Electric Vehicle Routing Problem. Transportation Research Procedia, 12, 508–521. https://doi.org/10.1016/j.trpro.2016.02.007.
Liu, S., & Zhang, C. (2023). Robust optimization of agriculture products urban distribution path considering demand uncertainty. Alexandria Engineering Journal, 66, 155–165. https://doi.org/10.1016/j.aej.2022.12.004.
Lu, J., Chen, Y., Hao, J. K., & He, R. (2020). The Time-dependent Electric Vehicle Routing Problem: Model and solution. Expert Systems with Applications, 161. https://doi.org/10.1016/j.eswa.2020.113593.
Marinaki, M., Taxidou, A., & Marinakis, Y. (2023). A hybrid Dragonfly algorithm for the vehicle routing problem with stochastic demands. Intelligent Systems with Applications, 18. https://doi.org/10.1016/j.iswa.2023.200225.
Martono, S., & Warnars, H. L. H. S. (2020). Penentuan Rute Pengiriman Barang Dengan Metode Nearest Neighbor. PETIR, 13(1), 44–57. https://doi.org/10.33322/petir.v13i1.869.
Oktavia, C. W., Natalia, C., & Adigunawan, I. (2019). Penentuan Jalur Rute Distribusi Produk Fast Moving Consumer Goods (FMCG) dengan Menggunakan Metode Nearest Neighbour (Studi Kasus: PT.XYZ). Jurnal Al-Azhar Indonesia Seri Sains Dan Teknologi, 5(2), 101. https://doi.org/10.36722/sst.v5i2.357.
Panjaitan, D. J., Suwilo, S., & Opim, S. S. (2019). Optimization Model for a Location-Allocation-Routing in a Periodic Distribution Network. Journal of Physics: Conference Series, 1255(1). https://doi.org/10.1088/1742-6596/1255/1/012050.
Pillac, V., Gendreau, M., Guéret, C., & Medaglia, A. L. (2013). A review of dynamic vehicle routing problems. European Journal of Operational Research, 225(1), 1–11. https://doi.org/10.1016/j.ejor.2012.08.015.
Putra, I. N. A. (2019). Optimasi Proses Etl Dengan Metode Heuristik Untuk Membangun Data Warehouse. JST (Jurnal Sains Dan Teknologi), 8(1), 35–43. https://doi.org/10.23887/jstundiksha.v8i1.16002.
Putri, D. A. P. (2017). Vehicle Routing Problem Dengan Time Window Untuk Multiple Product Dan Multiple Route Menggunakan Algoritma Sequential Insertion. Jurnal Teknik Industri, 17(1), 22. https://doi.org/10.22219/jtiumm.vol17.no1.22-30.
Salmani, Y., & Partovi, F. Y. (2021). Channel-level resource allocation decision in multichannel retailing: A U.S. multichannel company application. Journal of Retailing and Consumer Services, 63. https://doi.org/10.1016/j.jretconser.2021.102679.
Saputra, R., & Pujotomo, D. (2019). Penyelesaian Vehicle Routing Problem dengan Karakteristik Time Windows dan Multiple Trips Menggunakan Metode Saving Matrix (Studi Kasus : PT. Coca Cola Bottling Indonesia-Wilayah Medan). Industrial Engineering Online Journal, 7(4). https://ejournal3.undip.ac.id/index.php/ieoj/article/view/22516.
Saraswati, R., Sutopo, W., & Hisjam, M. (2017). Penyelesaian Capacitated Vechile Routing Problem Dengan Menggunakan Algoritma Sweep Untuk Penentuan Rute Distribusi Koran : Studi Kasus. Jurnal Manajemen Pemasaran, 11(2), 41–44. https://doi.org/10.9744/pemasaran.11.2.41-44.
Shahab, M. L., & Irawan, M. I. (2016). Algoritma Genetika Ganda untuk Capacitated Vehicle Routing Problem. Jurnal Sains Dan Seni ITS, 4(2). https://doi.org/10.12962/j23373520.v4i2.11482.
Shi, Y., Lin, Y., Wang, S., Wen, H., Lim, M. K., & Li, Y. (2023). A simultaneous facility location and vehicle routing problem with recyclable express packaging consideration for sustainable city logistics. Sustainable Cities and Society, 98. https://doi.org/10.1016/j.scs.2023.104857.
Sitek, P., Wikarek, J., Rutczyńska-Wdowiak, K., Bocewicz, G., & Banaszak, Z. (2021). Optimization of capacitated vehicle routing problem with alternative delivery, pick-up and time windows: A modified hybrid approach. Neurocomputing, 423, 670–678. https://doi.org/10.1016/j.neucom.2020.02.126.
Soenandi, I. A., Marpaung, B., & Ginting, M. (2014). Optimasi Vehicle Routing Problem (VRP) dengan Pendekatan Metaheuristik (Studi Kasus Distribusi Bahan Baku Makanan). Jurnal Ilmiah Teknik Industri, 2(2). https://doi.org/10.24912/jitiuntar.v2i2.487.
Song, M., Cheng, L., & Lu, B. (2023). Solving the multi-compartment vehicle routing problem by an augmented Lagrangian relaxation method. Expert Systems with Applications, 237. https://doi.org/10.1016/j.eswa.2023.121511.
Sugiono, M. C. (2022). Model vehicle routing problem untuk penentuan rute distribusi unit sepeda motor dengan metode saving matrix. Journal Industrial Servicess, 7(2), 230. https://doi.org/10.36055/jiss.v7i2.14018.
Utama, D. M., Dewi, S. K., Wahid, A., & Santoso, I. (2020). The vehicle routing problem for perishable goods: A systematic review. Cogent Engineering, 7(1). https://doi.org/10.1080/23311916.2020.1816148.
Vacic, V., & Sobh, T. M. (2014). Vehicle Routing Problem With Time Windows. International Journal of Computing, 72–80. https://doi.org/10.47839/ijc.3.2.289.
Wang, X., Liang, Y., Tang, X., & Jiang, X. (2023). A multi-compartment electric vehicle routing problem with time windows and temperature and humidity settings for perishable product delivery. Expert Systems with Applications, 233. https://doi.org/10.1016/j.eswa.2023.120974.
Widyastiti, M., & Kamila, I. (2019). Model Vehicle Routing Problem Dalam Mengoptimumkan Rute Pengangkutan Sampah Di Kota Bogor. Jurnal Matematika, Statistika Dan Komputasi, 16(2), 241. https://doi.org/10.20956/jmsk.v16i2.7023.
Widyastiti, M., & Kamila, I. (2020). Model Vehicle Routing Problem Dalam Menentukan Banyaknya Rute Dan Armada Pengangkutan Sampah Di Kota Bogor. Ekologia, 19(1), 39–43. https://doi.org/10.33751/ekol.v19i1.1661.
Wu, M., Wang, Z., Chen, G., Zhang, M., & Sun, T. (2023). Synergistic effects and products distribution during Co-pyrolysis of biomass and plastics. Journal of the Energy Institute, 111. https://doi.org/10.1016/j.joei.2023.101392.
Xiao, Y., Zhao, Q., Kaku, I., & Xu, Y. (2012). Development of a fuel consumption optimization model for the capacitated vehicle routing problem. Computers and Operations Research, 39(7), 1419–1431. https://doi.org/10.1016/j.cor.2011.08.013.
Yu, V. F., Jodiawan, P., Schrotenboer, A. H., & Hou, M.-L. (2023). The two-echelon vehicle routing problem with time windows, intermediate facilities, and occasional drivers. Expert Systems with Applications, 234. https://doi.org/10.1016/j.eswa.2023.120945.
Zhang, L., Ding, P., & Thompson, R. G. (2023). A stochastic formulation of the two-echelon vehicle routing and loading bay reservation problem. Transportation Research Part E: Logistics and Transportation Review, 177. https://doi.org/10.1016/j.tre.2023.103252.
Unduhan
Diterbitkan
Cara Mengutip
Terbitan
Bagian
Lisensi
Hak Cipta (c) 2023 Dedy Juliandri Panjaitan, Rima Aprilia, Sarifah Anjeli
Artikel ini berlisensiCreative Commons Attribution-ShareAlike 4.0 International License.
Authors who publish with the Jurnal Sains dan Teknologi (JST) agree to the following terms:
- Authors retain copyright and grant the journal the right of first publication with the work simultaneously licensed under a Creative Commons Attribution License (CC BY-SA 4.0) that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work. (See The Effect of Open Access)
