Capacitated vehicle routing problem for goods delivery by using tabu search

The main purpose of this study is to optimize the route for two vehicles that start and end from central depot to each location as well as to compare the results between the greedy and Tabu Search methods. To solve this problem, C ++ programming has been used to solve the CVRP which involves large data sets. Hence, computer results indicate the nearest distance that should be passed by two vehicles for total of 63 locations.