PENENTUAN RUTE KUNJUNGAN COLLECTOR ANGSURAN PINJAMAN MENGGUNAKAN METODE ALGORITMA SWEEP DI AREA KECAMATAN MENGANTI
DOI:
https://doi.org/10.51804/jiso.v3i2.71-78Keywords:
penentuan rute kunjungan, Algoritma SweepAbstract
Penelitian ini membahas tentang aplikasi Algoritma Sweep untuk membuat rute penagihan yang terbaik. Algoritma Sweep adalah Algoritma dari dua kelompok, yaitu kelompok pertama yang terdiri dari pengelompokan antar titik dan yang kedua mengatur rute untuk setiap kelompok. Penelitian ini menggunakan metode titik terdekat. Langkah metode ini adalah memasukkan satu per satu alamat konsumen dari jarak terdekat. Langkah ini diulang sampai setiap alamat konsumen dikunjungi. Dari perhitungan yang telah dilakukan menggunakan Algoritma Sweep, total jarak 39,45 km diperoleh dengan penghematan jarak tempuh meningkat 17,85 km jauh lebih kecil dari total jarak awal 57,3 km. Ini menunjukkan bahwa Algoritma Sweep dapat digunakan untuk mendapatkan solusi untuk meningkatkan rute penagihan terbaik guna meningkatkan kinerja para field collector angsuran pinjaman kredit di kecamatan Menganti.
References
Agustina, D. (2016). Integrated vehicle scheduling and routing policies for cross-dock systems [Nanyang Technological University]. https://doi.org/10.32657/10356/68868
Alves, F., Alvelos, F., Rocha, A., Pereira, A., & Leitão, P. (2019). Periodic Vehicle Routing Problem in a Health Unit. Proceedings of the 8th International Conference on Operations Research and Enterprise Systems, 384–389. https://doi.org/10.5220/0007392803840389
Anshori, M., & Fudhla, A. F. (2017, December). Cross Dock Location Analysis and Vehicle Route in Metropolis City Using Weighted Center of Gravity and Clustered Capacitated Sweep Method (study case of Surabaya). The First International Conference on Combinatorics, Graph Theory and Network Topology.
Anshori, Moch., Fudhla, A. F., & Hidayat, A. (2017). Penentuan Lokasi Fasilitas Crossdock Pada Kota Metropolis Dengan Pendekatan Center Of Gravity. Teknika: Engineering and Sains Journal, 1(2), 83. https://doi.org/10.51804/tesj.v1i2.111.83-88
Blocho, M. (2020). Exact algorithms for solving rich vehicle routing problems. In Smart Delivery Systems (pp. 93–99). Elsevier. https://doi.org/10.1016/B978-0-12-815715-2.00008-7
Dalmeijer, K., & Desaulniers, G. (2020). Addressing Orientation Symmetry in the Time Window Assignment Vehicle Routing Problem. INFORMS Journal on Computing, ijoc.2020.0974. https://doi.org/10.1287/ijoc.2020.0974
Dondo, R., & Cerdá, J. (2013). A sweep-heuristic based formulation for the vehicle routing problem with cross-docking. Computers & Chemical Engineering, 48, 293–311. https://doi.org/10.1016/j.compchemeng.2012.09.016
Fontaine, P., Taube, F., & Minner, S. (2020). Human solution strategies for the vehicle routing problem: Experimental findings and a choice-based theory. Computers & Operations Research, 120, 104962. https://doi.org/10.1016/j.cor.2020.104962
Fudhla, A. F., Pujawan, I. N., & Rahman, A. (2010). Pengembangan Model Matematis untuk Penjadwalan Rute Kendaraan Cross Docking Dalam Rantai Pasok dengan Mempertimbangkan Batasan Kelas Jalan dan Kendaraan Yang Heterogen. Prosiding Seminar Nasional Manajemen Teknologi XI, A6-1 sd A6-8. http://mmt.its.ac.id/download/SEMNAS/SEMNAS XI/MI/06. Prosiding Ahmad Fatih-ok Print.pdf
Gadegaard, S. L., & Lysgaard, J. (2020). A symmetry-free polynomial formulation of the capacitated vehicle routing problem. Discrete Applied Mathematics. https://doi.org/10.1016/j.dam.2020.02.012
Kouider, T., Cherif-Khettaf, W., & Oulamara, A. (2019). Large Neighborhood Search for Periodic Electric Vehicle Routing Problem. Proceedings of the 8th International Conference on Operations Research and Enterprise Systems, 169–178. https://doi.org/10.5220/0007409201690178
Kristanto, T., Muliawati, E. C., Arief, R., & Hidayat, S. (2018). Pengembangan Sistem Dinamik dalam Pengelolaan Manajemen Distribusi Logistik Terhadap Perkembangan Teknologi Informasi pada PT Sunan Inti Perkasa. Jurnal INFORM, 3(1), 26–31. https://doi.org/10.25139/ojsinf.v3i1.475
Kunnapapdeelert, S., & Kachitvichyanukul, V. (2018). New enhanced differential evolution algorithms for solving multi-depot vehicle routing problem with multiple pickup and delivery requests. International Journal of Services and Operations Management, 31(3), 370. https://doi.org/10.1504/IJSOM.2018.095562
Liao, T. W. (2020). Integrated Outbound Vehicle Routing and Scheduling Problem at a Multi-Door Cross-Dock Terminal. IEEE Transactions on Intelligent Transportation Systems, 1–14. https://doi.org/10.1109/TITS.2020.2987986
Liu, C., Hu, D., & Cai, R. (2019). Research on Two-Echelon Open Location Routing Problem with Simultaneous Pickup and Delivery Base on Perishable Products. CICTP 2019, 4539–4550. https://doi.org/10.1061/9780784482292.392
Ma?dziuk, J., & ?wiechowski, M. (2017). UCT in Capacitated Vehicle Routing Problem with traffic jams. Information Sciences, 406–407, 42–56. https://doi.org/10.1016/j.ins.2017.04.020
Marinakis, Y. (2015). An improved particle swarm optimization algorithm for the capacitated location routing problem and for the location routing problem with stochastic demands. Applied Soft Computing, 37, 680–701. https://doi.org/10.1016/j.asoc.2015.09.005
PAN, L., & FU, Z. (2013). Time difference insertion heuristics algorithm for vehicle routing problem with hard time window. Journal of Computer Applications, 32(11), 3042–3043. https://doi.org/10.3724/SP.J.1087.2012.03042
Schönberger, J. (2015). The Two-Commodity Capacitated Vehicle Routing Problem with Synchronization. IFAC-PapersOnLine, 48(3), 168–173. https://doi.org/10.1016/j.ifacol.2015.06.076
Spliet, R., Dabia, S., & van Woensel, T. (2018). The Time Window Assignment Vehicle Routing Problem with Time-Dependent Travel Times. Transportation Science, 52(2), 261–276. https://doi.org/10.1287/trsc.2016.0705
Spliet, R., & Gabor, A. F. (2015). The Time Window Assignment Vehicle Routing Problem. Transportation Science, 49(4), 721–731. https://doi.org/10.1287/trsc.2013.0510
Sundar, K., Venkatachalam, S., & Rathinam, S. (2016). Formulations and algorithms for the multiple depot, fuel-constrained, multiple vehicle routing problem. 2016 American Control Conference (ACC), 6489–6494. https://doi.org/10.1109/ACC.2016.7526691
Vigo, D. (1996). A heuristic algorithm for the Asymmetric Capacitated Vehicle Routing Problem. European Journal of Operational Research, 89(1–2), 108–126. https://doi.org/10.1016/0377-2217(96)00223-8
Yang, Q., Hu, D., Chu, H., & Xu, C. (2018). An Electric Vehicle Routing Problem with Pickup and Delivery. CICTP 2018, 176–184. https://doi.org/10.1061/9780784481523.017
Zou, H., & Dessouky, M. M. (2018). A look-ahead partial routing framework for the stochastic and dynamic vehicle routing problem. Journal on Vehicle Routing Algorithms, 1(2–4), 73–88. https://doi.org/10.1007/s41604-018-0006-5
Downloads
Published
Issue
Section
License
With the receipt of the article by JISO Editorial Board and the decision to be published, the copyright regarding the article will be transferred to JISO. The copyright transfer form can be downloaded here.
JISO has the right to multiply and distribute the article and every author is not allowed to publish the same article that was published in this journal.
JISO is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
Under the following terms:
Attribution — You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
ShareAlike — If you remix, transform, or build upon the material, you must distribute your contributions under the same license as the original.
