Abstract—A key element of many distribution systems is the routing and scheduling of vehicles servicing a set of customers. A wide variety of exact and approximate algorithms have been proposed for solving the vehicle routing problems (VRP).
Exact algorithms can only solve relatively small problems of VRP, which is classified as NP-Hard.