Study vehicle routing problem using Nearest Neighbor Algorithm

Abstract

Vehicle routing problem (VRP) has a key role in logistics management. VRP plays a role in designing the optimal route used by a number of vehicles placed at the depot to serve a number of customers with known requests. To solve the VRP, the nearest neighbor algorithm used to get the most optimal results. The Nearest Neighbor algorithm is a heuristic method which is done by starting the starting point than looking for the nearest point. In this paper, algorithm nearest neighbour can save the distance of 13, 14% and cost 13, 17%.