Model dan Aplikasi Single Depot mTSP Berbasis Fuzzy untuk Efisiensi Deposit Carrying
Abstract
Penelitian ini membahas permasalahan Multiple Traveling Salesman Problem (mTSP) dengan pendekatan single depot berbasis penugasan, di mana biaya perjalanan antar node dinyatakan sebagai bilangan fuzzy trapezoid. Tujuan utama penelitian ini adalah meminimalkan biaya perjalanan dalam pengambilan deposit (Deposit Carrying) dari kantor pusat ke cabang-cabang Bank Mandiri di Pekanbaru. Formulasi yang disusun mencakup penyesuaian bobot biaya menjadi bilangan fuzzy trapezoid, yang kemudian dikonversi menjadi nilai crisp menggunakan Ranking Score Method (RSM). Kasus ini melibatkan 21 node (1 kantor pusat dan 20 cabang), dengan batas atas dan bawah kunjungan per node untuk memastikan efisiensi penjadwalan kru. Hasil optimasi menunjukkan bahwa biaya minimum yang diperlukan untuk menjangkau seluruh cabang adalah sebesar Rp 192.943,5, menggunakan kendaraan operasional berbahan bakar pertamax. Penelitian ini menunjukkan efektivitas model mTSP berbasis fuzzy dalam meminimalkan biaya perjalanan dan memberikan solusi yang relevan bagi industri perbankan, khususnya dalam pengelolaan operasional yang melibatkan ketidakpastian biaya.
Full Text:
PDF (Bahasa Indonesia)References
I. Kara and T. Bektas, “Integer linear programming formulations of multiple salesman problems and its variations,” European Journal of Operational Research, vol. 174, no. 3, pp. 1449–1458, 2006, doi: 10.1016/j.ejor.2005.03.008.
Rahmawati and Indrayanto A., I. M. Society, Prosiding Konferensi Nasional Matematika XVIII Diterbitkan oleh Indonesian Mathematical Society ( IndoMS ).
F. Nuriyeva and G. Kizilates, “a New Heuristic Algorithm for Multiple Traveling Salesman Problem,” Twms Journal of Applied and Engineering Mathematics, vol. 7, no. 1, pp. 101–109, 2017.
Y. Kaempfer and L. Wolf, “Learning the Multiple Traveling Salesmen Problem with Permutation Invariant Pooling Networks,” no. i, pp. 1–22, 2018, [Online]. Available: http://arxiv.org/abs/1803.09621
J. K. Thenepalle and P. Singamsetty, “An open close multiple travelling salesman problem with single depot,” Decision Science Letters, vol. 8, no. 2, pp. 121–136, 2019, doi: 10.5267/j.dsl.2018.8.002.
Z. H. Ahmed, “An exact algorithm for the clustered travelling salesman problem,” Opsearch, vol. 50, no. 2, pp. 215–228, 2013, doi: 10.1007/s12597-012-0107-0.
R. Nand, K. Chaudhary, and B. Sharma, “Single Depot Multiple Travelling Salesman Problem Solved With Preference-Based Stepping Ahead Firefly Algorithm,” IEEE Access, vol. 12, no. February, pp. 26655–26666, 2024, doi: 10.1109/ACCESS.2024.3366183.
A. S. Bhadoriya, D. Deka, and K. Sundar, “Equitable Routing -- Rethinking the Multiple Traveling Salesman Problem,” no. March, pp. 1–10, 2024, [Online]. Available: http://arxiv.org/abs/2404.08157
Taha, H.A. Operation Research: An Introduction, Eight Editions, Pearson Education, Inc. United States of America. 2007.
S. Liu and C. Kao, “Network Flow Peoblems With Fuzzy Arc Lengths,” vol. 34, no. 1, pp. 765–769, 2004.
A. V. Aho, M. R. Garey, and J. D. Ullman, “The Transitive Reduction of a Directed Graph,” SIAM Journal on Computing, vol. 1, no. 2, pp. 131–137, 1972, doi: 10.1137/0201008.
P. Pandian and G. Natarajan, “A new algorithm for finding a fuzzy optimal solution for fuzzy transportation problems,” Applied Mathematical Sciences, vol. 4, no. 1–4, pp. 79–90, 2010.
Y. L. P. Thorani, P. Phani, B. Rao, and N. R. Shankar, “Ordering Generalized Trapezoidal Fuzzy Numbers,” Int. J. Contemp. Math. Sciences, vol. 7, no. 12, pp. 555–573, 2012.
S. Chandran and G. Kandaswamy, “A fuzzy approach to transport optimization problem,” Optimization and Engineering, vol. 17, no. 4, pp. 965–980, 2016, doi: 10.1007/s11081-012-9202-6.
DOI: http://dx.doi.org/10.24014/jsms.v11i1.35628
Refbacks
- There are currently no refbacks.
Jurnal JSMS
p-ISSN : 2460-4542 (print)
e-ISSN : 2615-8663 (online)
Alamat : Program Studi Matematika
Fakultas Sains dan Teknologi, UIN Suska Riau
Jl. H.R Soebrantas, No. 155, Tampan, Pekanbaru.
Website : http://ejournal.uin-suska.ac.id/index.php/JSMS
e-mail : jsmsfst@uin-suska.ac.id