The main objective of this communication is to show how realistic-sized instances of the Pickup and Delivery Problem with Transfers (PDPT) can be solved to optimality with a branch-and-cut-and-price method, under realistic hypotheses. We introduce the Pickup and Delivery Problem with Shuttle routes (PDP-S) which is a special case of the PDPT relying on a structured network with two categories of routes. {\em Pickup routes} visit a set of pickup points independently of their delivery points and end at one delivery point. {\em Shuttle routes} are direct trips between two delivery points. We propose a path based formulation of the PDP-S and solve it with a branch-and-cut-and-price algorithm. We show that this approach is able to solve real-life instances with up to 87 transportation requests.