Ad-hoc vehicle routing problem

In a vehicle routing problem (VRP), there are one or more vehicles that travel around a network, which depart from and return to a start node. However, in an ad-hoc VRP, new nodes can be included at runtime, and their routes can be changed or defined online. This study aims to minimize the total route length by considering the dynamic addition and deletion of nodes. In addition, ant colony optimization algorithm is an effective algorithm for solving the problem of optimizing a shortest route. For a large area network, the use of clockwise partition clustering algorithm can significantly improve the solution efficiency.