en زنجیره تامین و لجستیک Logistic & Apply Chain پژوهشي Research 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 competitive in the accuracy and its small amount of solving time point of views. Periodic vehicle routing problem, Heuristic algorithms, data mining. 139 149 http://ijiepr.iust.ac.ir/browse.php?a_code=A-10-519-1&slc_lang=en&sid=1 Mehdi Alinaghian Alinaghian@cc.iut.ac.ir 180031947532846003067 180031947532846003067 Yes Department of Industrial engineering, Isfahan university of technology,Isfahan,iran