Optimization of distribution routes in resolving traveling salesman problems using the tabu search algorithm (case study: CV. Bintang anugerah sukses pekanbaru

https://doi.org/10.24042/djm.v4i3.9811

Sri Basriati, Elfira Safitri, Resi Anggraini

Abstract


CV. Bintang Anugerah Sukses is a company engaged in the distribution of product PT. Belfoods Indonesia. Distribution of frozen goods distributes to 12 customer agencies using one vehicle. The route distribution is determined based on the experience and subjective decisions of a salesman in charge of distributing goods. The problem will be solved using the Travelling Salesman Problem (TSP) approach, so the best route for distributing goods can be obtained that can minimum mileage and time. One of the methods applied to the traveling salesman problem is the Tabu Search algorithm. Tabu Search is one of the metaheuristic methods with the process of searching moving from one solution to the next. The algorithm uses a taboo list to store a set of solutions that have just been evaluated, the result will be adjusted first to the contents of the taboo list to see whether the solution already exists or not. If the solution already exists then the solution will not be evaluated. The calculation results obtained a minimum mileage of 53.6 km and a minimum of time 305 minutes or 5 hours 5 minutes.


Full Text:

PDF

References


Amin, I. H. Al. (2009). Artificial intelligence dalam proses industri manufaktur. Jurnal Teknologi Informasi DINAMIK, XIV(2).

Fachrudin, H. (2019). Optimasi penentuan rute perjalanan sales pada ud. aster. Universitas Islam Majapahit Mojokerto.

Fatmawati, Prihandono, B., & Noviani, E. (2015). Penyelesaian travelling salesman problem dengan metode tabu search. Buletin Ilmiah Mat. Stat. Dan Terapannya (Bimaster), 04 no. 1(1).

Irman, A., Ekawati, R., & Febriana, N. (2017). Optimalisasi rute distribusi air minum quelle dengan algoritma clarke & wright saving dan model vehicle routing problem. Ejournal.Itn.Ac.Id.

Miswanto, Pernando, F., & Aditya Firmansyah, I. (2018). Implementasi algoritma tabu search untuk mengoptimasi penjadwalan preventive maintenancept solusi aplikasi interaktif. Sentika, 2018(Sentika), 23–24. http://prosiding.uika-bogor.ac.id/index.php/semnati/article/view/93

Naufal Hays, R. (2017). Implementasi firefly algorithm - tabu search untuk penyelesaian traveling salesman problem. Jurnal Online Informatika, 2(1).

Nurlathifah, E., Pudjiantoro, F. K. P., Ammar, N., Sutopo, W., & Yuniaristanto, Y. (2020). Optimalisasi rute distribusi bbm dengan penerapan capacitated vehicle routing problem dan excel solver di kabupaten magetan. Jurnal Teknologi Industri, 26(2). https://doi.org/https://doi.org/10.20885/teknoin.vol26.iss2.art3

Pradhana, F. E., Sugiharti, E., & Kharis, M. (2012). Penerapan algoritma tabu search vehicle routing problem untuk menyelesaikan. Unnes Journal of Mathematics, 1(1). https://doi.org/10.15294/ujm.v1i1.604

Riswan, Sahari, A., & Lusiyanti, D. (2020). Penentuan rute terpendek pendistribusian tabung gas lpg 3 kg pt. fega gas palu pratama menggunakan algoritma tabu search. JURNAL ILMIAH MATEMATIKA DAN TERAPAN, 16(2). https://doi.org/10.22487/2540766x.2019.v16.i2.15004

Rohman, S., Zakaria, L., Asmiati, A., & Nuryaman, A. (2020). Optimisasi travelling salesman problem dengan algoritma genetika pada kasus pendistribusian barang pt. pos indonesia di kota bandar lampung. Jurnal Matematika Integratif, 16(1). https://doi.org/10.24198/jmi.v16.n1.27804.61-73

Saleh, K., Helmi, & Prihandono, B. (2015). Penentuan rute terpendek dengan menggunakan algoritma cheapest insertion heuristic (studi kasus: PT. wicaksana overseas international tbk. cabang pontianak). Bimaster : Buletin Ilmiah Matematika, Statistika Dan Terapannya, 4(3). https://doi.org/http://dx.doi.org/10.26418/bbimst.v4i03.11888

Sihol, J., & Baringbing, S. (2019). Optimalisasi rute dan jumlah bus trans pontianak khatulistiwa menggunakan vehicle routing problem dan simulasi. Jurnal TIN Universitas Tanjungpura, 3(1).

Sulistiono, S., & Mussafi, N. S. M. (2015). Rancang bangun vehicle routing problem menggunakan algoritma tabu search. Jurnal Fourier, 4(2). https://doi.org/10.14421/fourier.2015.42.113-122

Suparmi, S., Suyitno, H., & Rosyida, I. (2020). Pengoptimalan rute distribusi produk tisu di cv maple semarang dengan menggunakan metode saving matrix dan nearest insertion. Unnes Journal of Mathematics, 9(2). https://doi.org/https://doi.org/10.15294/ujm.v9i2.37849

Sutoni, A., & Apipudin, I. (2019). Optimalisasi penentuan rute distribusi pupuk untuk meminimalkan biaya transportasi dengan metode saving matrix. SPEKTRUM INDUSTRI, 17(2). https://doi.org/10.12928/si.v17i2.13139




DOI: https://doi.org/10.24042/djm.v4i3.9811

Article Metrics

Abstract views : 39 | PDF downloads : 15

Refbacks

  • There are currently no refbacks.


Copyright (c) 2021 Desimal: Jurnal Matematika

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

  Creative Commons License
Desimal: Jurnal Matematika is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.