A Navel Heuristic Algorithm for the Periodic Vehicle Routing Problem

Periodic vehicle routing problem focuses on establishing a plan of visits to clients over a given time horizon so as to satisfy some service level while optimizing the routes used in each time period. This paper presents a new effective heuristic algorithm based on data mining tools for periodic vehicle routing problem (PVRP). The related results of proposed algorithm are compared with the results obtained by best Heuristics and meta-heuristics algorithms in the literature. Computational results indicate that the algorithm performs well in terms of accuracy and solution time.

کلیدواژه ها:

Periodic vehicle routing problem ، Heuristic algorithms ، Data mining