Open Vehicle Routing Problem by Ant Colony Optimization

Abstract—Vehicle routing problem (VRP) is real-world combinatorial optimization problem which determine the optimal route of a vehicle. Generally, to provide the efficient vehicle serving to the customer through different services by visiting the number of cities or stops, the VRP follows the Travelling Salesman Problem (TSP), in which each of vehicle visiting a set of cities such that every city is visited by exactly one vehicle only once. This work proposes the Ant Colony Optimization (ACO)-TSP algorithm to eliminate the tour loop for Open Vehicle routing Problem (OVRP). A key aspect of this algorithm is to plan the routes of buses that must pick up and deliver the school students from various bus stops on time, especially in the case of far distance covered by the vehicle in a rural area and find out the efficient and safe vehicle route