Global Journal of Computer Science and Technology, D: Neural & Artificial Intelligence, Volume 22 Issue 1

Roucairol, C., Eds.; Kluver Academic Publishers: Boston, MA, USA, 2012; pp. 285–296. 22. Tan, W.F.; Lee, L.S.; Majid, Z.A.; Seow, H.V. Ant colony optimization for capacitated vehicle routing problem. J. Comput. Sci. 2012, 8, 846–852. 23. Doerner, K.; Gronalt, M.; Hartl, R.F.; Reimann, M.; Strauss, C.; Stummer, M. Savings Ants for the vehicle routing problem. Lect. Notes Comput. Sci. 2002, 2279, 73–109. 24. Ma, Y.; Han, .; Kang, K.; Yan, F. An Improved ACO for the multi-depot vehicle routing problem with time windows. In Proceedings of the Tenth International Conference on Management Science and Engineering Management; Xu, ., Hajiyev, A., Nickel, S., Gen, M., Eds.; Springer: Singapore, 2018; pp. 1181–1189. 25. Zhang, X.; Tang, L. A new hybrid ant colony optimization algorithm for the vehicle routing problem. Pattern Recognit. Lett. 2009, 30, 848–855. [CrossRef] 26. Mazzeo, S.; Loiseau, I. An ant colony algorithm for the capacitated vehicle routing. Electron. Notes Discret. ath. 2004, 18, 181–186. [CrossRef] 27. Yu, B.; Yang, Z.Z.; Yao, B.Z. An improved ant colony optimization for vehicle routing problem. Eur. .Oper. Res. 2009, 196, 171–176. [CrossRef] 28. Ma, Y.; Han, .; Kang, K.; Yan, F. An Improved ACO for the multi-depot vehicle routing problem with time windows. In Proceedings of the Tenth International Conference on Management Science and Engineering Management; Xu, ., Hajiyev, A., Nickel, S., Gen, M., Eds.; Springer: Singapore, 2018; pp. 1181–1189. 29. Bullnheimer, B.; Hartl, R.F.; Strauss, C. An improved ant system for the vehicle routing problem. Ann. Oper. Res. 1999, 89, 319–328. 30. B. Zhao, H. Gui, H. Li and J. Xue, "Cold Chain Logistics Path Optimization via Improved Multi- Objective Ant Colony Algorithm," in IEEE Access, vol. 8, pp. 142977-142995, 2020, doi: 10.1109 /ACCESS.2020.3013951. Global Journal of Computer Science and Technology Volume XXII Issue I Version I 65 ( )D Year 2022 © 2022 Global Journals Vehicle Routing Problem with Time Window Constrain using KMeans Clustering to Obtain the Closest Customer