Minimasi Biaya Distribusi Es Balok Dan Es Kristal Menggunakan Metode Capacitated Vehicle Routing Problem Di PT Agronesia Es Saripetojo Bandung
DOI:
https://doi.org/10.47491/landjournal.v4i1.2924Keywords:
Cost Minimization, Distribution Route, Capacitated Vehicle Routing Problem (CVRP), Depot, Logware.Abstract
Companies can minimize distribution costs by determining the best distribution route from the company (depot) to customers spread across various locations. PT Agronesia Es Saripetojo Bandung Division has a problem determining the best distribution route because the distribution route changes every day depending on the customer's communication with the driver who asks to be served first. Thus the company cannot measure the performance of distribution costs and cannot evaluate the optimal number of vehicles to support distribution cost efficiency.
This problem can be solved using the Capacitated Vehicle Routing Problem (CVRP) method which takes into account the number and capacity of vehicles, the demand for each replacement, and the distance from the depot to the customer so that a minimum total distribution cost is obtained.
The results of the research provide a solution for the distribution of ice blocks and crystal ice using the Capacitated Vehicle Routing Problem (CVRP) method with the help of LOGWARE software, it has succeeded in determining the best route and at the same time minimizing distribution costs. Distribution cost efficiency can still be done by reducing 1 Mitsubishi Colt Diesel Engkel FE 71 vehicle, so there is an efficiency of = Rp. 267,000,-/day = 8.04%/day. Meanwhile, by reducing 1 Colt Diesel Engkel FE 71 vehicle, an efficiency of = Rp. 267,000,-/day = 7.92%/day. Meanwhile, vehicles that are not used can be rented or sold, thereby reducing the burden of fixed costs and variable costs.
References
Alt?nel, I. K. and Öncan, T., 2005, “A New Enhancement of The Clarke and Wright Savings Heuristic for the Capacitated Vehicle Routing Problem”. J Opl Res Soc 56: 954-961.
Desrosiers, J., et. al., 1995, “Time constrained routing and scheduling. Network Routing. In: Handbooks in Operations Research and Management Science”. eds. M.Ball, T.L.Magnanti, C.L.Monna, G.L.Nemhauser, North Holland, Amsterdam.
Duque, P. A.M., and Dolinskaya, I. S., Sörensen, K., 2015, “Network Repair Crew Scheduling and Routing for Emergency Relief Distribution Problem”. European Journal of Operational Research, 248, pp. 272–285
Kolen, A.W.J. et. al.(1987). Vehicle routing with time windows. Operations Research, 35, p.266-273.
Logware. 2023. Selected Computer Programs For Logistical Planning. Version 4.0, Ronald H. Ballou, Weatherhead School of Management Case Western Reserve University.
Pichpibul, T. and Kawtummachai, R. (2013). A Heuristic Approach Based on Clarke-Wright Algorithm for Open Vehicle Routing Proble. The Scientific World Journal.
Purnomo, A. (2018). Penentuan Rute Pengiriman Dan Biaya Transportasi Dengan Menggunakan Metode Clark And Wright Saving Heuristic (Studi Kasus Di Pt Teh Botol Sosro Bandung). Jurnal Logistik Bisnis Politeknik Pos Indonesia, 1(2), 97–117.
__________ (2017). Analisis Rute Distribusi Dengan Metode Capacity Vehicle Routing Problem (CVRP) pada Produk Coca Cola di Pusat Distribusi Bandung. Jurnal Competitive Politeknik Pos Indonesia, Volume 12, Nomor 2, ISSN : 0216-2539, pp. 1-15.
Toth, P., & Vigo, D. (2014). Vehicle Routing Problem, Methods, and Applications. Second edition, ed., Philadelphia; SIAM.
