Pickup and delivery problems covers a broad range of optimization problems and have been studied extensively due to its relation with real-world transportation tasks. They can be classified in several subfamilies according with the nature of the requests involved (e.g., paired or unpaired demands), the location and number of depots (many-to-many, one-to-many-to-one, and one-to-one problems, etc.), or the type of constraints involved (time windows, capacities, transfers, etc.). In this work, we address a static variant of Pickup and Delivery with unpaired demands, transfers, and a time horizon (i.e., a global time window for performing the whole transportation process). Because this problem arises naturally in the context of items relocation to balance a system (e.g., bike-sharing systems) it is sometimes called Relocation Problem.