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

Vehicle Routing Problem with Time Window Constrain using KMeans Clustering to Obtain the Closest Customer Abstract- In this paper, the problem statement is solving the Vehicle Routing Problem with Time Window constraint using the Ant Colony Algorithm with K-Means Clustering. In this problem, the vehicles must start at a common depot, pickup from various warehouses, deliver to the respective nodes within the time window defined by the customer and return back to the depot. The objectives defined are to reduce number of vehicles employed, the total logistics cost and to reduce carbon emissions. The mathematical model described in this paper has considered multiple pickup and multiple delivery points. The proposed solution of this paper aims to provide better and more efficient solution while minimizing areas of conflict so as to provide the best output on a large scale. GJCST-D Classification: F.1.1 VehicleRoutingProblemwithTimeWindowConstrainusingKMeansClusteringtoObtaintheClosestCustomer Strictly as per the compliance and regulations of: By Jai Keerthy Chowlur Revanna & Nushwan Yousif B.Al-Nakash, PhD Information Systems Engineering and Management & Harrisburg University of Science and Technology © 2022. Jai Keerthy Chowlur Revanna & Nushwan Yousif B.Al-Nakash, PhD. This research/review article is distributed under the terms of the Attribution-NonCommercial-NoDerivatives 4.0 International (CC BYNCND 4.0). You must give appropriate credit to authors and reference this article if parts of the article are reproduced in any manner. Applicable licensing terms are at https://creativecommons.org/ licenses/by-nc-nd/4.0/. Global Journal of Computer Science and Technology: D Neural & Artificial Intelligence Volume 22 Issue 1 Version 1.0 Year 2022 Type: Double Blind Peer Reviewed International Research Journal Publisher: Global Journals Online ISSN: 0975-4172 & Print ISSN: 0975-4350