Main Article Content

Ravi Prianka Jusup
Zaenal Muttaqin
Rani Sukmadewi

Abstract

This article presents a study conducted at PT Toyota Astra Motor Spare Parts Logistics Division (SPLD) focusing on improving the rerouting process for spare part distribution to ten part shops in Cikarang and Karawang City. Utilizing the nearest neighbor algorithm, the researcher aimed to devise an efficient route originating from the Centre Warehouse in Kawasan Industri MM 2100. The primary objectives were to minimize distance traveled and consolidate routes to achieve cost savings in transportation. Through meticulous route planning and optimization, the study successfully reduced the total distance from 282 km to 62.8 km, thereby demonstrating significant cost-saving potential. This article provides insights into the methodology, results, and implications of implementing the nearest neighbor algorithm in optimizing spare part distribution logistics for automotive industries

Downloads

Download data is not yet available.

Article Details

How to Cite
Jusup, R. P., Muttaqin, Z. . and Sukmadewi, R. . (2024) “Rerouting spare part distribution on pt tam spld with nearest neighbor method”, Jurnal Mantik, 8(1), pp. 684-691. doi: 10.35335/mantik.v8i1.5139.
References
Agafonov, A., & Yumaganov, A. (2018). Short-Term Traffic Flow Forecasting Using a Distributed Spatial-Temporal k Nearest Neighbors Model. 2018 IEEE International Conference on Computational Science and Engineering (CSE), 91–98. https://doi.org/10.1109/CSE.2018.00019
Allsop, R. E. (2012). Maps and Transport?: Foreword to ‘ Maps in Motion ’ Maps and Transport?: Foreword to ‘ Maps in Motion .’ 5647(2007). https://doi.org/10.1080/jom.2007.9710821
Ambe, I., & Badenhorst-Weiss, J. (2010). Strategic supply chain framework for the automotive industry. African Journal of Business Management, 4, 2110–2120.
Arif, M. (2018). Supply Chain Management. Deepublish. https://books.google.co.id/books?id=SMdiDwAAQBAJ
Bo, W., Bugayko, D., Grigorak, M., & Forum, W. E. (2018). ASSESSMENT OF THE NATIONAL ECONOMY THROUGH THE. Economic Thought Journal, 68–82.
Chisholm, D. C., & Norman, G. (2012). Market access and competition in product lines. International Journal of Industrial Organization, 30(5), 429–435. https://doi.org/https://doi.org/10.1016/j.ijindorg.2012.04.003
Chopra, S. (2019). Supply Chain Management: Strategy, Planning, and Operation (7th ed.). Pearson Education. https://books.google.co.id/books?id=l6oItAEACAAJ
Ghosh, S. (1999). Fundamental issues in intelligent transportation systems. Proceedings of the Institution of Mechanical Engineers, Part F: Journal of Rail and Rapid Transit, 213(2), 125–131. https://doi.org/10.1243/0954409991531083
Heizer, J., & Render, B. (2011). Operations Management 10th Edition (10th ed.). Pearson Education.
Hermawan, F. (2018). Optimization Of Transportation of Municipal Solid Waste from Resource to Intermediate Treatment Facility with Nearest Neighbour Method ( Study on six Sub Sub District in DKI Jakarta Province ). 1(1), 86–99.
Iijima, M., & Sugawara, S. (2005). Logistics innovation for Toyota’s world car strategy. International Journal of Integrated Supply Management, 1(4), 478–489. https://doi.org/10.1504/IJISM.2005.006307
Irawati, D., & Charles, D. (2010). The involvement of Japanese MNEs in the Indonesian automotive cluster. International Journal of Automotive Technology and Management, 10(2–3), 180–196. https://doi.org/10.1504/IJATM.2010.032623
Jacyna, M., & Semenov, I. (2020). Models of vehicle service system supply under information uncertainty. Eksploatacja i Niezawodno?? – Maintenance and Reliability, 22(4), 694–704. https://doi.org/10.17531/ein.2020.4.13
Kosasih, W., Laricha, L., Peng, K., Xun, Z., & Hu, M. (2023). Study vehicle routing problem using Nearest Neighbor Algorithm Neighbor Algorithm. Journal of Physics: Conference Series, 2421. https://doi.org/10.1088/1742-6596/2421/1/012027
Lenstra, J. K., & Kan, A. H. G. R. (1975). Some Simple Applications of the Travelling Salesman Problem. Journal of the Operational Research Society, 26(4), 717–733. https://doi.org/10.1057/jors.1975.151
Leymena, L., W, C. S. B., & Sutopo, W. (2019). Analisis Penentuan Rute Distribusi Menggunakan Metode Nerest Neigbor di PT.KALOG. Seminar Dan Konferensi Nasional IDEC, E14.1-E14.7. https://idec.ft.uns.ac.id/wp-content/uploads/2019/05/ID119.pdf
Li, Y. qiang. (2009). Solving travelling salesman problem based on nearest neighbor strategy. Computer Engineering and Applications.
Martínez-Zarzoso, I., & Nowak-Lehmann, F. D. (2007). Is distance a good proxy for transport costs? The case of competing transport modes. The Journal of International Trade \& Economic Development, 16(3), 411–434. https://doi.org/10.1080/09638190701527186
Mejjaouli, S., & Babiceanu, R. F. (2018). Cold supply chain logistics: System optimization for real-time rerouting transportation solutions. Computers in Industry, 95, 68–80. https://doi.org/https://doi.org/10.1016/j.compind.2017.12.006
Myles, J. P., & Hand, D. J. (1990). The multi-class metric problem in nearest neighbour discrimination rules. Pattern Recognition, 23(11), 1291–1297. https://doi.org/https://doi.org/10.1016/0031-3203(90)90123-3
Prasetyo, W., & Tamyiz, M. (2019). VEHICLE ROUTING PROBLEM DENGAN APLIKASI METODE NEAREST NEIHBOR. Journal of Research and Technology, 3(2). https://doi.org/10.5281/zenodo.2581833
Ruan, Y., Xiao, Y., Hao, Z., & Liu, B. (2021). A nearest-neighbor search model for distance metric learning. Information Sciences, 552, 261–277. https://doi.org/https://doi.org/10.1016/j.ins.2020.11.054
Sarjono, H. (2014). Determination of Best Route to Minimize Transportation Costs Using Nearest Neighbor Procedure. 8(62), 3063–3074.
Statistik, B. P. (2023). Statistika Indonesia 2023.
Wang, J., Neskovic, P., & Cooper, L. N. (2007). Improving nearest neighbor rule with a simple adaptive distance measure. Pattern Recognition Letters, 28(2), 207–213. https://doi.org/https://doi.org/10.1016/j.patrec.2006.07.002
Yoo, J. S., & Shekhar, S. (2005). In-Route Nearest Neighbor Queries. GeoInformatica, 9(2), 117–137. https://doi.org/10.1007/s10707-005-6671-1