Periodic Vehicle Routing Problem: classification and heuristic for tactical planning.The Periodic Vehicle Routing Problem (PVRP) consists in assigning customer visits to vehicle routes in some periods of a time horizon so as to satisfy some service level requirements that can take theform of frequency of visit, constraint on time lag between visits, or pre-defined visit patterns. We present different variants of this problem and propose a classification. Then, we consider a model for tactical planning for which we propose a heuristic: we optimise theplanning of customer visits to achieve both workload balancing andregionalisation of the routes. The objective of regionalisation reflects a desire to specializeroutes to restricted geographical area. The standard minimisation of distancetravelled is left for the underlying operational decision making model.Our heuristic achieves practical solutions for an industrialinstance with 16658 visits to schedule over a horizon of 20 days.