Penyelesaian Vehicle Routing Problem Dengan Algoritma Clarke And Wright Savings Di Perumahan Umum Bulog Medan Amplas
DOI:
https://doi.org/10.55606/jurrimipa.v2i1.723Keywords:
Clarke and Wright Savings Algorithm, Capacitated Vehicle Routing Problem, Distribution.Abstract
Distribution routes are generally a problem for every company, including in the public company BULOG Medan Amplas. Distribution to the Medan Amplas BULOG public company, namely having to serve every stall that is far from the warehouse with scattered locations, and limited vehicle capacity. So far, driver considerations in distributing products have only been based on random intuitions of driver and does not consider the efficiency of the route taken. Therefore, this research uses Clarke and Wright Savings algorithm to obtain optimal mileage by taking into account every consumer demand and vehicle capacity. Calculation results using the Clarke and Wright Savings Algorithm obtained the vehicle mileage of 695.08 km with a savings of 11 km or 1.56%.
References
Braysy OB, Gendreau M, 2005. Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms. Transportation Science, 39: 104-118.
Chopra S dan Peter M, 2010. Supply Chain Management: Strategy, Planning and Operation, Pearson Education. New Jersey: Prentice Hall.
Clarke G, Wright JW, 1964. Scheduling of Vehicles from a Central Depot to a Number of Delivery Points, Operations Research, 12(4): 568-581.
Dreo, J., A. Petrowsky, P. Siarry, E. Taillard. 2006. Meta – Heuriustic for Hard Optimization: Methods and case studies, Berlin: Springer
Ernawati D, Raharjo H, Aryani E, 2015. Minimalisasi Biaya Distribusi Kayu dengan Metode Clarke and Wright Savings Heuristic (Studi Kasus: CV Sumber Jaya Gresik). Jurnal Tekmapro, 10(1): 46-56.
Foulds, LR 1984. Combinatorial Optimization for Undergraduates. New York: Springer-Verlag, Inc.
Gunawan P, 2012. Enhanced Nearest Neighbors Algorithm for Design of Water Network. Chemical Engineering Science, 84: 197-206.
Iskandar. 2010. Model Optimasi Vehicle Routing Problem dan Implementasinya. Tesis Institut Pertanian Bogor.
Jong Jek Siang. 2004. Matematika Diskrit dan Aplikasinya pada Ilmu Komputer. Yogyakarta: ANDI.
Li F, Golden B, Wasil E, 2005. Very large-scala vehicle routing: new test problem, algorithm, and results. Computer and Operation Research 32(5): hal. 1165-1179.
Machado P, Tavares J, Pereira FB, dan Costa E, 2002. Vehichel routing problem:Doing it evolutionry way. Proceeding of GECCO.
Mittal, P. Garg, N. Ambashta, H dan Mehndiratta, Chanranjeev. 2017. Solving VRP in an Indian Transportation Firm through Clarke and Wright Algorithm: A Case Study. International Journal of Emerging Technologies in Engineering Research (IJETER) Vol. 5, Issue 10: 163 -168.
Munir, Rinaldi. 2016. Matematika Diskrit. Bandung: Informatika Bandung.
Octora, L. 2014. Pembentukan Rute Distribusi Menggunakan Algoritma Clarke and Wright Savings dan Algoritma Sequential Insertion. Jurnal Institut Teknologi Nasional. Bandung, 2(2).
Pertiwi PP, Iriani, Ariyni E. 2020. Penentuan Distribusi Produk dengan Metode Algoritma Clarke and Wright Saving Heuristic untuk Meminimumkan Biaya Distribusi di PT. X. Jurnal Manajemen Industri dan Teknologi. 1(2): 24-33.
Pop PC, et al. 2011. Heuristic algorithms for solving the generalized vehicle routing problem. International Journal of Computers Communicationsand Control 6(1): 158-165.
Roberto Cantu-Funes, et al. 2018. Multi Depot Periodic Vehicle Routing Problem with Due Dates and Time Windows, Journal of the Opertional Research Society, 62(2): 296- 306.
Taha. HA. 2007. Operations Research: An Introduction. Ed Ke-8. Pearson Education International. Singapore
Tonci Caric, Hrvoje Gold. 2008. Vehicle Routing Problem. University of Zagreb : In-teh Croatia.
Toth dan Vigo. 2002 Vehicle Routing Problem. Bologna: Universitas Degli Studi.
