such as the ones examined by [@SmilowitzDaganzo; @winkenbach2016enabling] approximate operations costs when designing and planning for multi-echelon networks. While network design problems are complex due to intricate interdependencies between strategic, tactical and operational decisions, continuum approximations (see [@ansari2018advancements]) are useful to capture operations complexity and take informed decisions. However, such approximations are typically used to estimate travel distance and cost, but not travel time and operations synchronization. This paper considers access hubs to be modular in storage capacity similar to designs proposed in [@FaugereCIE], such that capacity modules can be removed/added to adapt access hub’s storage capacity. At the tactical level, capacity modules are to be deployed over a network of access hub locations; at the operational level, capacity modules are to be allocated to serve their access hub’s need or neighboring locations via capacity pooling. In a dynamic setting, the associated problem can be related to a multi-period location-allocation problem which belongs to the NP-Hard complexity class [@manzini2008optimization]. Once the capacity of the network of access hubs is adjusted, each access hub plays the role of a transshipment location between couriers performing pickup and delivery services within minutes of the access hub and riders transporting parcels between local hubs 