Comparative Analysis of Two Different Heuristics for Model of VRP

Vehicle routing problem (VRP) is realistic optimization problem used to find the best feasible route of a vehicle. VRP is mostly used for sorting the different routes of vehicles to provide efficient services to the customers. In this paper, we implement two different heuristics, nearest neighbor insertion and ant colony optimization for solving vehicle routing problem and their respective results are shown by using graphical implementation. While performing the experiment we analyzed both the heuristics and depict which heuristic solve the problem efficiently with respect to cost and time.