Nearest Neighbor Insertion Algorithm for solving capacitated vehicle routing problem

Nearest Insertion Algorithm is heuristic algorithm which has been proven a successful technique applied on number of combinatorial optimization problems. Nearest Neighbor Insertion Algorithm is taken as one of the efficient computing method for vehicle routing problem. We study a possibility of finding the optimal solution of vehicle routing problem and offer a practical implementation of the method used for solving this problem. We have taken a scenario in which different college buses takes the students from different bus stops. The experiments and result graphics shows how we effectively complete the route and generates the optimal solution.