freight (e.g. [@crainic2016service; @hewitt2019scheduled]) while location routing problems combine facility location-allocation decisions with associated freight routing decisions. [@drexl2015survey] provide a recent survey of variants and extensions of the location routing problem. The dynamic location routing problem ([@francis2008period]) considering the assignment of demand to locations over multiple periods, is similar to the problem studied in this paper: it aims at minimizing network and routing costs over a multiperiod location and routing decision vector. However, multi-echelon location routing problems (e.g. [@crainic2004advanced; @perboli2011two]) have only recently gathered attention in the literature. Although multi-echelon networks are relevant to postal and parcel delivery distribution systems ([@gonzalez2009n]) where fine time constraints and synchronization have become an essential consideration, most papers studying multi-echelon networks are concerned with the two-echelon case and ignore temporal aspects ([@drexl2015survey]).\
When allowing inter-location capacity pooling, underlying operations described in section \[introduction\] are impacted. Couriers perform pickup and delivery tours starting and ending in their reference access hub, while riders visit access hubs starting and ending their routes in their reference local hub. The impact of capacity pooling can be measured by modeling its impact on the route of parcels, couriers and riders. However, when taking decisions at the tactical level, explicitly modeling 