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

VI. C onclusion This paper discusses the vehicle routing problem with time window constraint (VRPTW) along with added constraints of number of vehicles, logistics cost, overall carbon emission rate along with multiple pickup and delivery points. A meta heuristic Ant Colony Algorithm with K-Means Clustering was employed to solve the problem statement. Looking at the literature survey in this paper, it is observable that Vehicle Routing Problem has had several approaches with varying results, which in turn leads to the fact that VRP with added constraints is a difficult problem to solve. The solution provided in this paper has been compared with [30], which has a similar problem statement, and the results of the proposed ant colony algorithm with K-Meansclustering has performed far better and has provided very less scope of improvement in the discussed problem areas. In future research on similar topics, it’s a hope that this paper will be a good leverage for the researchers and this solution can be further modified for more improvements. R eferences R éférences R eferencias 1. Dantzig, G.B., and Ramser, J.H., 1959, “The truck dispatching problem,” Management Science, Vol. 6, No. 1, pp. 80-91. 2. Clarke, G., and Wright, J.W., 1964, “Scheduling of vehicles from a central depot to a number of delivery points,” Operations Research, Vol. 12, No. 4, pp. 568-581. 3. MALANDRAKI C, DASKIN M S. Time dependent vehicle routing problems: formulations, properties and heuristic algorithms. Transportation Science, 1992, 26(3): 185 – 200. 4. ICHOUA S, GENDREAU M, POTVIN J Y. Vehicle dispatching with time-dependent travel times. European Journal of Operational Research, 2003, 144(2): 379 – 396. 5. OSVALD A, STIRN L Z. A vehicle routing algorithm for the distribution of fresh vegetables and similar perishable food. Journal of Food Engineering, 2008, 85(2): 285 – 295. 6. KUO Y. Using simulated annealing to minimize fuel consumption for the time-dependent vehicle routing problem. Computers & Industrial Engineering, 2010, 59(1): 157 – 165. 7. BALSEIRO S R, LOISEAU I, RAMONET J. An ant colony algorithm hybridized with insertion heuristics for the time de pendent vehicle routing problem with time windows. Computers & Operations Research, 2011, 38(6): 954 – 966. 8. HASHIMOTO H, YAGIURA M, IBARAKI T. An iterated local search algorithm for the time- dependent vehicle routing problem with time windows. Discrete Optimization, 2008, 5(2): 434 – 456. 9. FIGLIOZZI M A. The time dependent vehicle routing problem with time windows: benchmark problems, an efficient solution algorithm, and solution characteristics. Transportation 10. KOK A L, HANS E, SCHUTTEN J. Vehicle routing under time-dependent travel times: the impact of congestion avoidance. Computers & Operations Research, 2012, 39(5): 910 – 918. 11. MINOCHA B, TRIPATHI S. Two phase algorithm for solving VRPTW problem. International Journal of Artificial Intelligence and Expert Systems, 2013, 4(1): 1 – 16. 12. Müller, J., 2010, “Approximative Solutions to the Bicriterion Vehicle Routing Problem with Time Windows”, European Journal of Operational Re- search, 202, pp. 223–231 13. Kumar, S. N., and Panneerselvam, R.,2012, “A Survey on the Vehicle Routing Problem and Its Variants”, Intelligent Information Management, 4, pp. 66-74 14. H. Mao, J. Shi, Y. Zhou and G. Zhang, "The Electric Vehicle Routing Problem With Time Windows and Multiple Recharging Options," in IEEE Access , vol. 8, pp. 114864-114875, 2020, doi: 10.1109/ACCESS.20 20.3003000. 15. Y. Wu, B. Zheng and X. Zhou, "A Disruption Recovery Model for Time-Dependent Vehicle Routing Problem With Time Windows in Delivering Perishable Goods," in IEEE Access , vol. 8, pp. 189614-189631, 2020, doi: 10.1109/ACCESS.20 20.3032018. 16. L. Wu, Z. He, Y. Chen, D. Wu and J. Cui, "Brainstorming-Based Ant Colony Optimization for Vehicle Routing With Soft Time Windows," in IEEE Access, vol. 7, pp. 19643-19652, 2019, doi: 10.1 109/ACCESS.2019.2894681. 17. Bowerman, R.L.; Calamai, P.H. The space filling curve with optimal partitioning heuristic for the vehicle routing problem. Eur. J .Oper. Res. 1994, 76, 128–142. 18. Dondo, R.; Cerda, . A cluster-based optimization approach for the multi depot heterogeneous fleet vehicle routing problem with time windows. Eur. J. Oper. Res. 2007, 176, 478–1507. 19. Cordeau, .F.; Gendreau, M.; Laporte, G.; Potvinand, .Y.; Semet, F. A guide to vehicle routing heuristics. J. Oper. Res. Soc. 2002, 53, 512–522. 20. Szeto, W.Y.; Wu, Y.; Ho, S.C. An artificial ee colony algorithm for the capacitated vehicle routing problem. Eur. .Oper. Res. 2011, 215, 126–135. 21. Bullnheimer, B.; Hartl, R.F.; Strauss, C. Applying the ant system to the vehicle routing problem. In Meta- Heuristics: advances and Trends in Local Search or Optimization; Voss, S., Martello, S., Osman, I.H., Global Journal of Computer Science and Technology Volume XXII Issue I Version I 64 ( )D Year 2022 © 2022 Global Journals Vehicle Routing Problem with Time Window Constrain using KMeans Clustering to Obtain the Closest Customer