A Modified Kruskal's Algorithm to Improve Genetic Search for Open Vehicle Routing Problem

This article has proposed a modified Kruskal's method to increase the efficiency of a genetic algorithm to determine the path of least distance starting from a central point to solve the open vehicle routing problem. In a vehicle routing problem, vehicles start from a central point and several customers placed in different locations to serve their demands and return to the central point. In the case of the open vehicle routing problem, the vehicles do not go back to the central point after serving the customers. The challenge is to reduce the number of vehicles used and the distance travelled simultaneously. The proposed method applies genetic algorithms to find the set of customers those are covered by a particular vehicle and the authors have applied the proposed modified Kruskal's method for local routing optimization. The results of the new method are analyzed in comparison with some of the evolutionary methods.