Transportation Distances Reduction at Surabaya Distribution Center Using Anylogistix Software
Main Article Content
Abstract
The delivery method of finished goods by the company Surabaya Distribution Center is to deliver to one customer location (single drop), and the truck size used will be adjusted based on the demand. The company considers the single drop inefficient since the usage of small trucks is significantly higher than that of larger trucks. Therefore, it is essential to change finished goods previously delivered using small modes of transportation to large ones. Since it is impossible to control customer demand, it might be possible to increase truck size by combining several destinations into one truck (multidrop), which would shorten the transportation distance. The problem of determining the optimal route to reduce the delivery route distance by considering the vehicle capacity is included in the Capacitated Vehicle Routing Problem with Time Windows (CVRPTW), which can be solved using Anylogistix. Anylogistix software was selected as a software tool for applying the simulation modeling approach based on the functionality, accessibility, simplicity, and convenience of use, as well as the degree of suitability of the models to the conditions of reality. The simulation begins with selecting the appropriate type of simulation, inputting data, applying research assumptions, and verifying and validating until a verified and validated simulation is obtained. Through a systematic approach, the Anylogistix simulation can reduce the distance of the routes, initially 280,258.7 km, to 203,905.93 km (a 27.2% distance reduction). In addition, the results showed that the delivery of goods from small modes of transportation allocated to large modes of transportation was 181 shipments, with an optimal utilization of >70%.
Article Details
This work is licensed under a Creative Commons Attribution 4.0 International License.
This work is licensed under a Creative Commons Attribution 4.0 International License.
References
Chopra, S., & Meindl, P. (2007). Supply Chain Management: Strategy, Planning and Operation. Pearson.
Confessore, G., Galiano, G., & Stecca, G. (2008). An Evolutionary Algorithm for Vehicle Routing Problem with Real Life Constraints. The 41st CIRP Conference on Manufacturing Systems. 225-228.
Giyantoro, R. (2018, August 6). APLIKASI SIMULASI PERHITUNGAN BALIK MODAL USAHA DENGAN PENDEKATAN ANALISIS ROI (RETURN ON INVESMENT). Retrieved from Repositori Universitas Siliwangi: http://repositori.unsil.ac.id/id/eprint/144
Kurniawan, A. C., Mustafa, F. W., & Redi, A. A. (2023). Transportation Optimization in The Distribution of Gaslink CNG C-CYL Products Using Anylogistix Case Study : PT.Gagas Energi Indonesia. Infotech Journal, 116-123.
Nurlathifah, E., Pudjiantoro, F. K., Ammar, N., Sutopo, W., & Yuniaristanto. (2020). Optimalisasi Rute Distribusi BBM dengan Penerapan Capacitated Vehicle Routing Problem dan Excel Solver di Kabupaten Magetan. Teknoin, 116-126.
Puspitasari, D. A., Trihelmina, F. R., Wulandari, M. K., Parastikasari, A., & Khusna, A. (2021). Angraini, YN, Rosita, M. & Taufiq, AAP (2016). Transition Mode of Transportation for Delivery Services Using the Analytical Hierarchy Process (AHP) Method: Case Study of PT. XYZ. Performance: Industrial Engineering Scientific Media, 15(2), 154-159. Retrie. INFERENSI, 137-144.
Putri, K. A., Rachmawati, N. L., Lusiani, M., & Redi, A. A. (2021). Genetic Algorithm with Cluster-first Route-second to Solve the Capacitated Vehicle Routing Problem with Time Windows:A Case Study. Jurnal Teknik Industri, 75-82.
Wijanarko, W. S., & Sepadyati, N. (2022). Optimasi Rute Pengiriman Capacitated Vehicle Routing Problem with Time Windows PT. X. Jurnal Titra, 513-520.
Yuliza, E., Puspita, F., Yahdin, S., & Emiliya, R. (2020). Solving capacitated vehicle routing problem using of Clarke and Wright algorithm and LINGO in LPG distribution. Journal of Physics: Conference Series, 1-6.