This article deals with a particular class of routing problem, consisting of the planning and routing of technicians in the eld. This problem has been identi ed as a multiperiod, multidepot uncapacitated vehicle routing problem with speci c constraints that we call the Multiperiod Field Service Routing Problem (MPFSRP). We propose a set covering formulation of the problem for the column generation technique and we develop an exact branch and price solution method for small-sized instances. We also propose several heuristic versions for larger instances. We present the results of experiments on realistic data adapted from an industrial application.