For a Periodic Vehicle Routing Problem (PVRP), this study offers a new mathematical model which optimizing vehicle travel expenses based on many assumptions. Periodic planning includes consideration of the following four issues that is a vehicle routing problem with time windows (VRPTW), a capacitated vehicle routing problem (CVRP), a vehicle routing problem with split service (VRPSS) and a vehicle routing problem with simultaneous pickup and delivery (VRPSPD). In large-scale issues, the computational complexity of this problem can be handled by any optimization program in a reasonable amount of time since it is based on a single model that we have created. In this paper a neighborhood search meta-heuristic is proposed.