Literature 1D/MD 1E/2 E EI CS TN/CV IR HV Problem name Highlights Objective function Solution approach Anderluh et al. [13 ] MD 2 ☒ ☐ CV ☐ ☐ 2eVRPSyn (two-echelon vehicle routing problem with vehicle synchronization) The existence of a gray zone, environmental factors such as greenhouse gas (GHG), disturbance, a second-echelon depot for small electric vehicles (small EVs), synchronization, and cloned satellites for multivisit purposes Routing cost in manner of time and distance, vehicle fixed cost, GHG, disturbance Combined Archetti et al. [33 ] 1D 1 ☐ ☒ — ☐ ☒ VRPOD (vehicle routing problem with occasional drivers) Introduction of occasional drivers Routing cost, compensation paid to occasional drivers Iterated local search Arnold and Sörensen [32 ] 1D 2 ☐ ☐ — ☐ ☐ 2ELRP and STTRPSD (two-echelon location-routing problem and the single truck and trailer routing problem with satellite depots) Proposed the single truck and trailer routing problem with satellite depots (STTRPSD) as the 2ELRP special case with configuration closed to 2EVRP, a new solution approach, limited capacity satellites Routing cost, depot opening cost, and vehicle fixed costs Progressive filtering Algorithm( ) Belgin et al. [10 ] MD 2 ☐ ☐ — ☐ ☐ 2EVRPSPD (two-echelon vehicle routing problem with simultaneous pickup and delivery) Customers (and satellites) with pickup and delivery demand, limited capacity satellites Routing cost Hybrid variable neighborhood Descent and local search Breunig et al. [11 ] 1D 2 ☐ ☐ — ☐ ☐ E2EVRP (electric two-echelon vehicle routing problem) Limited capacity satellites, small EVs, charging stations for small EVs, and limited energy capacity for small Evs Routing costs in the manner of time and energy, vehicle fixed costs Large neighborhood search Chen et al. [35 ] MD 1 ☐ ☒ — ☐ ☒ MDMPMP (multidriver multiparcel matching problem) Safety constraints for securing parcels, synchronizations, ridesharing, relay visits at nodes. Routing cost, travel cost of ODs, parcel transferring cost of ODs, waiting time cost of ODs, and extra cost for ODs’ detours. Time compatibility-based heuristic and time-expanded graph-based heuristic( ) Enthoven et al. [14 ] 1D 2 ☐ ☐ CV ☐ ☐ 2EVRP-CO (two-echelon vehicle routing problem with covering options) Have both satellites and covering locations, delivery options Routing cost and connection cost Adaptive large neighborhood search Hemmelmayr et al. [24 ] 1D 2 ☐ ☐ — ☐ ☐ LRP (based on 2EVRP) (location-routing problem as special case of the two-echelon vehicle routing problem) — Routing cost, vehicle fixed cost, and satellites opening cost Adaptive large neighborhood search Huang and Ardiansyah [38 ] 1D 2 ☐ ☒ — ☐ ☒ 2ELRP-TTRP (two-echelon location-routing problem with the truck and trailer routing problem) Relay points Routing cost, payments for hiring CS Tabu search Jie et al. [12 ] 1D 2 ☐ ☐ — ☐ ☐ 2E-EVRP-BSS (two-echelon capacitated electric vehicle routing problem with battery swapping stations) Multiple type of EVs, charging (battery swapping) stations for EVs, limited energy capacity for EVs Routing cost, recharging cost, handling cost Column generation-adaptive large neighborhood search Karaoglan et al. [28 ] 1D 1 ☐ ☐ — ☐ ☐ LRPSPD (location-routing problem with simultaneous pickup and delivery) — Routing cost, depot opening cost, and vehicle usage cost Two-phase simulated annealing Kitjacharoenchai et al. [15 ] 1D 2 ☐ ☐ — ☐ ☐ 2EVRPD (two-echelon vehicle routing problem with drones) Delivery truck carrying drones for deliveries at second-echelon, customers nodes are adopted as satellites Routing cost (denoted as truck arrival time) Large neighborhood search and drone truck route construction Macrina et al. [40 ] 1D 1 ☐ ☒ TN ☐ ☒ VRPTW-TN-OD (vehicle routing problem with time windows, transshipment nodes, and occasional drivers) Capacitated transshipment nodes, synchronization Routing cost, compensation cost for ODs activities Variable neighborhood search Mühlbauer and Fontaine [19 ] 1D 2 ☐ ☐ — ☐ ☐ 2E-CVRPSC (two-echelon capacitated vehicle routing problem with swap containers) Swap containers Routing cost Parallelized large neighborhood search Pichka et al. [30 ] 1D 2 ☐ ☐ — ☐ ☐ 2E-OLRP (two-echelon open location-routing problem) Propose the two-echelon open location-routing problem where vehicles will not return to depot and satellites after delivering parcels, limited capacity satellites Routing cost, vehicle cost, and satellite open cost Simulated annealing Sampaio et al. [36 ] MD 1 ☐ ☒ TN ☒ ☒ PDPTW-T (pickup and delivery problem with time windows and transfers) Adopt the crowd-shipping characteristics in PDPTW-T Routing cost Adaptive large neighborhood search Schneider and Löffler [27 ] MD 1 ☐ ☐ — ☐ ☐ CLRP (capacitated location-routing problem) Proposed a tree-based search algorithm that is far more effective in dealing with CLRP compared to existing studies Routing cost, depot cost, and vehicle cost Tree-based search Algorithm( ) Ting and Chen [25 ] MD 1 ☐ ☐ — ☒ ☐ CLRP (capacitated location-routing problem) — Routing cost, depot opening cost, and vehicle cost Multiple ant colony optimization Voigt and Kuhn [37 ] MD 1 ☐ ☒ TN ☐ ☒ PDPTOD (pickup and delivery problem with transshipments and occasional drivers) Occasional drivers and transshipment points on multidepot scenarios Routing cost, compensation cost on detours, and stops for ODs Adaptive large neighborhood search Voigt et al. [43 ] Various experimental design ☐ ☐ — ☐ ☐ Various experimental design (two-echelon VRP (2E-VRP), location-routing problem (LRP), and multidepot VRP (MDVRP)) Proposed a hybrid ALNS that has higher impacts on solving 2EVRP, LRP, and MDVRP compared to existing studies Operation cost Hybrid adaptive large neighborhood search Wang et al. [9 ] 1D 2 ☒ ☐ — ☐ ☐ 2E-CVRP-E (two-echelon capacitated vehicle routing problem with environmental considerations) Consider environmental impact on 2E-CVRP Routing cost, fuel cost, and satellites’ handling cost Variable neighborhood search and integer programming Yu and Lin [29 ] MD 1 ☐ ☐ — ☐ ☐ OLRP (open location-routing problem) — Routing cost, depot opening cost, and vehicle cost Simulated annealing Yu et al. [26 ] MD 1 ☐ ☐ — ☐ ☐ LRP ((capacitated) location-routing problem) — Routing cost, depot opening cost, and vehicle cost Simulated annealing Yu et al. [16 ] MD 1 ☐ ☐ — ☐ ☐ 2E-OLRP (two-echelon open location-routing problem) Considering third-party logistics (TPL) and loading-unloading zones (LUZs) Routing cost, satellites opening cost,and vehicle cost Simulated annealing Yu et al. [17 ] 1D 2 ☐ ☒ CV ☐ ☒ 2EVRPTW-CO-OD (two-echelon vehicle routing problem with time windows, covering options, and occasional drivers) Covering locations with occasional drivers in the 2EVRP, delivery options Routing costs, connection costs, and compensation for ODs Adaptive large neighborhood search Yu et al. [31 ] 1D 2 ☐ ☐ — ☐ ☐ 2EUDP-UV (two-echelon urban delivery problem with second level unmanned vehicles) Adopt the “mothership approach” scenario; first-echelon will not deliver to customers nodes; rendezvous nodes Routing cost, number of used large vehicles Hybrid multi-start metaheuristic Zhou et al. [18 ] MD 2 ☐ ☐ — ☐ ☐ MD-TEVRP-DO (multidepot two-echelon vehicle routing problem with delivery options) Delivery options, multidepot 2EVRP, limited working time for vehicle Routing cost, connection cost, handling cost, and vehicle cost Hybrid Genetic algorithm This work 1D 2 ☐ ☒ TN ☐ ☒ 2EVRP-TN-OD (two-echelon vehicle routing problem with transshipment nodes and occasional drivers) Transshipment nodes in the 2EVRP framework with heterogeneous vehicles, ALNS for 2EVRP-TN Routing costs, ODs employment cost Adaptive large neighborhood search
