SWEEP ALGORITHM IN CVRP TO OPTIMIZE DELIVERY AUTOMOTIVE SPARE PART

Alvina Putri Utami; Bonivasius Prasetyo Ichtiarto

doi:10.22441/pasti.2021.v15i3.002

Authors

Alvina Putri Utami Universitas Mercu Buana, Indonesia
Bonivasius Prasetyo Ichtiarto Universitas Mercu Buana,

DOI:

https://doi.org/10.22441/pasti.2021.v15i3.002

Keywords:

Capacitated Vehicle Routing Problem, Sweep Algorithm, Distribution, Automotive Spareparts

Abstract

The CVRP to solve many optimization and application problems distribution especially of the automotive spare parts industry, West Java, Indonesia is presented has 120 customers who aim to optimize and maximize the capacity and cost of vehicles owned, namely 10 colts 6 diesel type vehicles. Vehicle routes are compared against the existing daily distribution routes showing that significant savings can be gained on the daily cost of transportation-related expenses. The objective of this research is to find a set of optimal routes that minimize the number of vehicles required and total distance traveled for all vehicles to serve customers with a result from 10 to 9 using vehicles with a total distance increase from the Sweep method of 253.8347 km and cost benefits or cost savings with a total usage cost of Rp 17.800.000 to be Rp 17,709,503 in cost efficiency of 4.47% or Rp 90,496.58 a day.

Downloads

Download data is not yet available.

Author Biography

Alvina Putri Utami, Universitas Mercu Buana

Mahasiswi Magister Teknik Industri, Universitas Mercu Buana

References

A., M., Jannat, Z., & Murase, K. (2017). Capacitated Vehicle Routing Problem Solving using Adaptive Sweep and Velocity Tentative PSO. International Journal of Advanced Computer Science and Applications, 8(12), 288–295. https://doi.org/10.14569/ijacsa.2017.081237

AISI. (2021). Distribution Domestic by Category 2021. ASSOCIATION OF INDONESIA MOTORCYCLE INDUSTRY. https://www.aisi.or.id/statistic/

Akhand, M. A.H., Zahrul Jannat, T. D. & A.-M. (2017). Optimization of Capacitated Vehicle Routing Problem using Producer-Scrounger Method. 5–24. https://doi.org/10.1109/WIECON-ECE.2015.7443922

Akpinar, S. (2016). Hybrid large neighbourhood search algorithm for capacitated vehicle routing problem. Expert Systems with Applications, 61, 28–38. https://doi.org/10.1016/j.eswa.2016.05.023

Altabeeb, A. M., Mohsen, A. M., & Ghallab, A. (2019). An improved hybrid firefly algorithm for capacitated vehicle routing problem. Applied Soft Computing Journal, 84, 105728. https://doi.org/10.1016/j.asoc.2019.105728

Cari, T., Gali, A., Fosin, J., Gold, H., & Reinholz, A. (2008). A Modelling and Optimization Framework for Real-World Vehicle Routing Problems. Vehicle Routing Problem, September. https://doi.org/10.5772/5790

Chen, M. (2015). 2015 International Conference on Control , Automation and Robotics A Hybrid Two-stage Sweep Algorithm for Capacitated Vehicle Routing Problem. 195–199. https://doi.org/10.1109/ICCAR.2015.7166030

Dantzig, G. B., & Ramser, J. H. (1959). The Truck Dispatching Problem. Management Science, 6(1), 80–91. https://doi.org/10.1287/mnsc.6.1.80

GAIKINDO. (2020). Geliat, Prospek, dan Tantangan Industri Otomotif Indonesia. https://www.gaikindo.or.id/geliat-prospek-dan-tantangan-industri-otomotif-indonesia/

Hannan, M. A., Akhtar, M., Begum, R. A., Basri, H., Hussain, A., & Scavino, E. (2018). Capacitated vehicle-routing problem model for scheduled solid waste collection and route optimization using PSO algorithm. Waste Management, 71, 31–41. https://doi.org/10.1016/j.wasman.2017.10.019

Herry Gunawan. (2019). Pengantar Transportasi dan Logistik (1st ed.). PT Raja Grafindo Persada Depok.

Hertrich, C., Hungerländer, P., & Truden, C. (2019). Sweep Algorithms for the Capacitated Vehicle Routing Problem with Structured Time Windows. January, 127–133. https://doi.org/10.1007/978-3-030-18500-8_17

Islam, M. A., Gajpal, Y., & ElMekkawy, T. Y. (2021). Hybrid particle swarm optimization algorithm for solving the clustered vehicle routing problem. Applied Soft Computing, 110, 107655. https://doi.org/10.1016/j.asoc.2021.107655

Jalel Euchi, A. S. (2020). Hybrid genetic-sweep algorithm to solve the vehicle routing problem with drones. Physical Communication, 1–37. https://doi.org/10.1016/j.phycom.2020.101236

Kirci, P. (2016). An optimization algorithm for a capacitated vehicle routing problem with time windows. Sadhana - Academy Proceedings in Engineering Sciences, 41(5), 519–529. https://doi.org/10.1007/s12046-016-0488-5

Li, J., & Hae, Y. (2016). New circle clustering algorithm for vehicle routing problem New circle clustering algorithm for vehicle routing problem. MAY 2015. https://www.researchgate.net/publication/283487507_New_circle_clustering_algorithm_for_vehicle_routing_problem_chalyang-gyeonglomunjeleul_wihan_saeloun_seokeul_keulleoseuteoling_bangbeob

Liao, E., & Liu, C. (2018). A hierarchical algorithm based on density peaks clustering and ant colony optimization for traveling salesman problem. IEEE Access, 6, 38921–38933. https://doi.org/10.1109/ACCESS.2018.2853129

M. F. Ibrahim, M. M. Putri, D. Farista, D. M. U. (2021). An Improved Genetic Algorithm for Vehicle Routing Problem. Advances in Intelligent Systems and Computing, 1282(1), 163–169. https://doi.org/10.1007/978-3-030-62743-0_23

Marinaki, M., & Marinakis, Y. (2016). A Glowworm Swarm Optimization algorithm for the Vehicle Routing Problem with Stochastic Demands. Expert Systems with Applications, 46, 145–163. https://doi.org/10.1016/j.eswa.2015.10.012

Mikael Hang Surynato. (2016). Sistem Operasional Manajemen Distribusi (Trian Lesmana (ed.); 1st ed.). Kompas Gramedia.

Ng, K. K. H., Lee, C. K. M., Zhang, S. Z., Wu, K., & Ho, W. (2017). A multiple colonies artificial bee colony algorithm for a capacitated vehicle routing problem and re-routing strategies under time-dependent traffic congestion. Computers and Industrial Engineering, 109, 151–168. https://doi.org/10.1016/j.cie.2017.05.004

R Hanafi, M Rusman, F Mardin, S M Parenreng, A. A. (2020). Distribution Route Optimization of a Capacitated Vehicle Routing Problem by Sweep Algorithm. IOP Conference Series: Materials Science and Engineering PAPER, 1–7. https://doi.org/10.1088/1757-899X/875/1/012066

Reed, M., Yiannakou, A., & Evering, R. (2014). An ant colony algorithm for the multi-compartment vehicle routing problem. Applied Soft Computing Journal, 15, 169–176. https://doi.org/10.1016/j.asoc.2013.10.017

Thammano, A., & Rungwachira, P. (2021). Hybrid Modified Ant System with Sweep Algorithm and Path Relinking for the Capacitated Vehicle Routing Problem. HELIYON, 1–18. https://doi.org/10.1016/j.heliyon.2021.e08029

Toth P., V. D. (2002). The Vehicle Routing Problem (Paolo Toth and Daniele Vigo (ed.); DT09 ed.). Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9780898718515

Yousefikhoshbakht, M., & Sedighpour, M. (2012). A combination of sweep algorithm and elite ant colony optimization for solving the multiple traveling salesman problem. Proceedings of the Romanian Academy Series A - Mathematics Physics Technical Sciences Information Science, 13(4), 295–301. https://www.google.com/url?sa=t&rct=j&q=&esrc=s&source=web&cd=&ved=2ahUKEwjC8bi-78PzAhWdIbcAHTofDAMQFnoECAMQAQ&url=http%3A%2F%2Fwww.acad.ro%2Fsectii2002%2Fproceedings%2Fdoc2012-4%2F01-YOUSEFIKHOSHBAKHT.pdf&usg=AOvVaw3jhZeWqNt5oBIeD42mjMcx

Zhong, Y., Lin, J., Wang, L., & Zhang, H. (2017). Hybrid discrete artificial bee colony algorithm with threshold acceptance criterion for traveling salesman problem. Information Sciences, 421, 70–84. https://doi.org/10.1016/j.ins.2017.08.067