Location of urban micro‐consolidation centers to reduce the social cost of last‐mile deliveries of cargo: A heuristic approach. Issue 3 (9th August 2021)

• Record Type: Journal Article
• Authors: Arrieta‐Prieto, Mario; Ismael, Abdelrahman; Rivera‐Gonzalez, Carlos; Mitchell, John E.
• Is Part Of: Networks. Volume 79:Issue 3(2022)
• Page Start: 292
• Page End: 313
• Publication Date: 2021-08-09
• Subjects: bilevel mixed‐integer program -- decomposition algorithm -- facility location -- greedy heuristic -- last‐mile logistics -- urban consolidation; Network analysis (Planning) -- Periodicals; 658.4032
• DOI: 10.1002/net.22076
• Languages: English
• ISSNs: 0028-3045

Abstract

Abstract: Urban deliveries of goods have become a rising challenge due to the increase of online shopping in addition to the traditional business‐to‐business (B2B) dynamics. To maintain a satisfactory level of service, carriers must conduct delivery operations under restrictive environments, creating undesirable externalities such as congestion and pollution. Urban micro‐consolidation centers (UMCs) are defined as on‐street or off‐street spaces where all the deliveries within a certain radius are dropped and reconsolidated to be delivered by more sustainable last‐leg modes. Their main purpose is to mitigate such negative externalities. This work formulates the last‐mile delivery problem assisted by UMCs as a mixed‐integer quadratically‐constrained program and develops a greedy heuristic solution, inspired by the decomposition algorithms for large‐scale optimization. The simulation results and a case study in Manhattan, New York show how the heuristic provides reasonable results with respect to the exact solution while also shedding light on how its solution can be utilized for freight‐efficient urban design and policy planning.