Optimal Vehicle Routing Problem (VRP) For The Distribution Of Medical Devices By Applying The Clarke-Wright Algorithm
DOI:
https://doi.org/10.51601/ijse.v3i1.56Abstract
In the current era of modernization, the development of the need for medical devices is increasing,g so that the companies need goods distribution system with criteria that have speed, safety, and convenience to distribute various kinds of products according to optimal distribution routes. The aim of this study is to overcome the problem of the distribution route for medical devices from PT Alkes Medan because the number of demand for goods varies for each consumers, vehicle capacites, delivery time limits, average speed that can be reached on certain routes and times and the existence of the different conditions of multiple trips at the customer's location. A heuristic algorithm named Clarke-Wright Algorithm is applied in this problem. This algorithm will be later provide an optimal solution to route problem in the distribution of medical devices and provide effectiveness in finding the shortest optimal route of medical device goods distributed to consumers. The optimal route will be described in the results section of this study
Downloads
References
H. Cipta, M. A. Adri, D. J. Panjaitan, “Vehicle routing problem (VRP) dalam penentuan rute terpendek
pendistribusian tabung gas LPG dengan mempertimbangkan jumlah permintaan,” J. Ilm. Mat. dan Terapan.,
vol. 19, no. 1 Juni 2022, pp. 49–57, 2022.
F. D. Putra, F. Rakhmawati, and H. Cipta, “Penentuan Rute Transportasi Kendaraan Umum Kota Medan Dengan
Menggunakan Nearest Neighbor Method Dan Closed Insertion Method,” Zeta-Math Jurnal., vol. 6, no. 2, pp.
–10, 2021, doi: 10.31102/zeta.2021.6.2.6-10.
V. Cempírek, O. Stopka, P. Meško, I. Dočkalíková, and L. Tvrdoň, “Design of distribution centre location for
small e-shop consignments using the clark-wright method,” Transp. Res. Procedia, vol. 53, no. 2019, pp. 224–
, 2021, doi: 10.1016/j.trpro.2021.02.029.
A. Segerstedt, “A simple heuristic for vehicle routing-A variant of Clarke and Wright’s saving method,” Int. J.
Prod. Econ., vol. 157, no. 1, pp. 74–79, 2014, doi: 10.1016/j.ijpe.2013.09.017.
C. H. Häll et al., “V ehicle R outing,” Public Transp., vol. 1, no. 3, pp. 573–586, 2006, [Online]. Available:
O. Stopka, “Draft model of delivery routes at a city logistics scale when applying the Clarke-Wright method,”
Arch. Automot. Eng. Arch. Motoryz., vol. 87, no. 1, pp. 67–80, 2020, doi: 10.14669/am.vol87.art6.
P. Singanamala, K. Dharma Reddy, and P. Venkataramaiah, “Solution to a Multi Depot Vehicle Routing
Problem Using K-means Algorithm, Clarke and Wright Algorithm and Ant Colony Optimization,” Int. J. Appl.
Eng. Res., vol. 13, no. 21, pp. 15236–15246, 2018, [Online]. Available: http://www.ripublication.com.
A. Desiana et al., “Penyelesaian Vehicle Routing Problem Untuk Minimasi Total Biaya Transportasi Pada Pt
Xyz Dengan Metode Algoritma Genetika,” e-Proceeding Eng., vol. 3, no. 2, pp. 2566–2574, 2016.
G. Barbarosoglu and D. Ozgur, “A tabu search algorithm for the vehicle routing problem,” Comput. Oper. Res.,
vol. 26, no. 3, pp. 255–270, 1999, doi: 10.1016/S0305-0548(98)00047-1.
International Journal of Science and Environment
L. C. Yeun, W. a N. R. Ismail, K. Omar, and M. Zirour, “Vehicle Routing Problem : Models and Solutions,” J.
Qual. Meas. Anal., vol. 4, no. 1, pp. 205–218, 2008.
A. Chandra and B. Setiawan, “Optimasi Jalur Distribusi dengan Metode Vehicle Routing Problem (VRP)
Optimizing the Distribution Routes Using Vehicle Routing Problem (VRP) Method,” J. Manaj. Transp.
Logistik, vol. 05, no. 02, pp. 105–116, 2018, [Online]. Available: http://ejournal.stmttrisakti.ac.id/index.php/jmtranslog.
D. Vigo, “Heuristic algorithm for the asymmetric capacitated vehicle routing problem,” Eur. J. Oper. Res., vol.
, no. 1, pp. 108–126, 1996, doi: 10.1016/0377-2217(96)00223-8.
R. Liu, X. Xie, V. Augusto, and C. Rodriguez, “Heuristic algorithms for a vehicle routing problem with
simultaneous delivery and pickup and time windows in home health care,” Eur. J. Oper. Res., vol. 230, no. 3,
pp. 475–486, 2013, doi: 10.1016/j.ejor.2013.04.044.
M. Furqan and H. Mawengkang, “Developing a framework of hybrid method for tackling large-scale mixed
integer nonlinear programming problems,” Int. J. Civ. Eng. Technol., vol. 9, no. 12, pp. 720–728, 2018.
A. Tarhini, K. Danach, and A. Harfouche, “Swarm intelligence-based hyper-heuristic for the vehicle routing
problem with prioritized customers,” Ann. Oper. Res., vol. 308, no. 1–2, pp. 549–570, 2022, doi:
1007/s10479-020-03625-5.
B. Cao, “Solving vehicle routing problems using an enhanced clarke-wright algorithm: A case study,” Lect.
Notes Comput. Sci. (including Subser. Lect. Notes Artif. Intell. Lect. Notes Bioinformatics), vol. 7555
LNCS, pp. 190–205, 2012, doi: 10.1007/978-3-642-33587-7_14.
A. Hariati, N. H. Prasetya, and H. Cipta, “The Effectiveness of Clarke Wright and Sequential Insertion
Algorithm in Distribution Routing Aqua,” Quadratic J. Innov. Technol. Math. Math. Educ., vol. 1, no. 1, pp.
–22, 2021, doi: 10.14421/quadratic.2021.011-03.
Y. Sheng and W. Lan, “Application of Clarke-Wright saving mileage heuristic algorithm in logistics distribution
route optimization,” Key Eng. Mater., vol. 474–476, pp. 1538–1542, 2011, doi:
4028/www.scientific.net/KEM.474-476.1538.
A. K. Pamosoaji, P. K. Dewa, and J. V. Krisnanta, “Proposed Modified Clarke-Wright Saving Algorithm for
Capacitated Vehicle Routing Problem,” Int. J. Ind. Eng. Eng. Manag., vol. 1, no. 1, pp. 9–16, 2019, doi:
24002/ijieem.v1i1.2292.
T. Pichpibul and R. Kawtummachai, “New enhancement for clarke-wright savings algorithm to optimize the
capacitated vehicle routing problem,” Eur. J. Sci. Res., vol. 78, no. 1, pp. 119–134, 2012.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2023 Hendra Cipta, May Fitriana Hasibuan
This work is licensed under a Creative Commons Attribution 4.0 International License.
