New Mobility-Assist E-Grocery Delivery Network: a Load-Dependent Two-Echelon Vehicle Routing Problem With Mixed Vehicles

Abstract

New forms of transport, such as autonomous delivery robots (ADRs), have attracted considerable attention in recent years for their potential use as green last-mile delivery alternatives because of their flexibility in some areas unreachable by van. However, their low efficiency, delivering a limited number of orders each trip, limits their application in the last mile. Also, the cost and emission impact of new forms of transport on the last-mile delivery network is still not clear. To address these issues, we developed a new two-echelon delivery system that combines traditional vans and ADRs, making use of their individual advantages to overcome their drawbacks and enhance efficiency in the deliveries. The objective of this study was to develop a new approach based on a metaheuristics methodology to minimize transport and emission costs through modeling and to solve the extension of two-echelon load-dependent vehicle routing problems with mixed vehicles (2E-LDVRP-MV). The complicated 2E-LDVRP-MV problem was formulated as a mixed-integer programming (MIP) model and solved efficiently with a cluster-based artificial immune algorithm (C-AIA) in which clustering was employed to allocate customers. We performed a set of numerical experiments with a solver and the proposed C-AIA heuristics. C-AIS highlights the operational implications of four parameters: ratios between load and the empty vehicle weight; vehicle types; emission levels; and customer densities. Our results provide a unique perspective on tactical planning for a sustainable urban logistics system, and this new two-echelon system could be applied in e-grocery last-mile delivery networks where vans and ADRs are combined.