This paper proposes a column generation algorithm for the multidepot vehicle routing problem with interdepot routes. This problem is an extension of the multidepot vehicle routing problem in which the vehicles are allowed to stop at intermediate depots along their routes to replenish. The problem can be modeled as a set covering problem in which the variables are rotations corresponding to feasible combinations of routes. We consider two pricing subproblems to generate rotations. The first one generates rotations directly by solving an elementary shortest path problem with resource constraints on a modified version of the original customer-depot network. The second one exploits the relationship between the sets of routes and rotations but results in a model with many columns. We discuss some issues related to solving this second pricing subproblem by column generation and we introduce an alternate approach to alleviate these difficulties. We show through computational experiments that the second pricing mechanism performs better than the first to compute the linear programming relaxation lower bound. We then embed it within a branch-and-bound algorithm to compute optimal integer solutions. Moreover, we assess the benefits of allowing interdepot routes in multidepot vehicle routing.