each location. To do so, this subsection proposes to develop routes with detours cost approximations, and travel time approximations. It builds on a refined granularity of routing operations periods (hourly) and uncertain storage volume requirements.\
Figure \[fig: Operations\] illustrates the use of access hubs in first/last mile parcel logistics operations during a period $\tau$ with one rider and 3 couriers. At the operational level, pickup and delivery decisions are made hourly ($\tau$) based on the volume-based capacity made available at each access hub. In addition, capacity relocation determines the number and costs of recourse actions needed to satisfy the requested volumes. With the consideration of capacity pooling recourse, the pickup and delivery problem with transshipment faced by couriers and riders adds the feature of detours. Here, to ensure timely transshipment operations, the detours performed by couriers and riders, are limited to their original time period ($\tau$), avoiding couriers and riders to be desynchronized. Since these detours necessitate additional moves and are time consuming, this comes with a supplementary incurred cost.

It is clear that capturing the dynamics of underlying operations when taking capacity deployment decisions leads to better solutions. However, the pickup and delivery problem with transshipment is NP-hard ([@RaisPandDwithTransshipment]) 