Next Article in Journal
Revealing the Impact Factors of the Electric Bike Riders’ Violation Riding Behaviors in China: Integrating SEM with RP-Logit Model
Previous Article in Journal
Flight Routing Optimization with Maintenance Constraints
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Systematic Review

A Systematic Review of Sustainable Ground-Based Last-Mile Delivery of Parcels: Insights from Operations Research

1
Information Systems Engineering, Concordia University, Montreal, QC H3G 1M8, Canada
2
École Nationale d’Administration Publique (ENAP), Université du Québec, Montreal, QC H2T 3E5, Canada
*
Author to whom correspondence should be addressed.
Vehicles 2025, 7(4), 121; https://doi.org/10.3390/vehicles7040121
Submission received: 29 August 2025 / Revised: 1 October 2025 / Accepted: 14 October 2025 / Published: 21 October 2025

Abstract

The importance of Last-Mile Delivery (LMD) in the current economy cannot be overstated, as it is the final and most crucial step in the supply chain between retailers and consumers. In major cities, absent intervention, urban LMD emissions are projected to rise by >30% by 2030 as e-commerce grows (top-100-city “do-nothing” baseline). Sustainable, innovative ground-based solutions for LMD, such as Electric Vehicles, autonomous delivery robots, parcel lockers, pick-up points, crowdsourcing, and freight-on-transit, can revolutionize urban logistics by reducing congestion and pollution while improving efficiency. However, developing these solutions presents challenges in Operations Research (OR), including problem modeling, optimization, and computations. This systematic review aims to provide an OR-centric synthesis of sustainable, ground-based LMD by (i) classifying these innovative solutions across problem types and methods, (ii) linking technique classes to sustainability goals (cost, emissions/energy, service, resilience, and equity), and (iii) identifying research gaps and promising hybrid designs. We support this synthesis by systematically screening 283 records (2010–2025) and analyzing 265 eligible studies. After the gap analysis, the researchers and practitioners are recommended to explore new combinations of innovative solutions for ground-based LMD. While they offer benefits, their complexity requires advanced solution algorithms and decision-making frameworks.

1. Introduction

Last-Mile Delivery (LMD) has become increasingly central to modern supply chains as e-commerce expands and service expectations tighten. LMD involves delivering products from a warehouse to the end consumer, and its impact has grown significantly due to the rise of e-commerce and the demand for quick deliveries [1]. LMD costs contribute considerably to shipping expenses, accounting for 53% of the total [2]. The global autonomous LMD market is expected to reach around USD 84.72 billion by 2030 [3]. Additionally, according to a 2023 survey, over half (53%) of consumers chose not to complete their purchases due to excessively protracted shipping times [4]. Efficient LMD not only influences purchasing decisions but also shapes urban planning, sustainability efforts, and transportation logistics [5,6,7].
Beyond the economic benefits, LMD has both environmental and societal significance. While delivery vehicles constitute a small share of total urban vehicles, their activity is concentrated in dense cores with frequent stop-and-go operations. Consistent scenario studies indicate that, in the top 100 cities and under a no-intervention baseline, urban LMD emissions could increase by >30% by 2030 alongside higher congestion [8]. At the same time, cities and operators are accelerating the adoption of zero-emission vehicles; however, uptake remains uneven across regions and vehicle classes (e.g., electric vans constitute a single-digit share of new registrations in many markets) [9,10]. Environmentally, its carbon footprint necessitates sustainable approaches, such as the use of Electric Vehicles (EVs) and optimized routes, to reduce emissions and air pollution. Utilizing local fulfillment centers to establish the last-mile supply chain can mitigate last-mile emissions by 17 % to 26 % by 2025 [11]. In addition, on a societal level, LMD improves accessibility for people with mobility limitations, supports local employment, and plays a crucial role during emergencies.
Innovative solutions for sustainable LMD can revolutionize urban logistics, minimizing congestion and pollution while enhancing efficiency and customer satisfaction in the evolving landscape of e-commerce and urban mobility [12]. Innovative ground-based solutions include EV delivery, Autonomous Delivery Robots (ADRs), Parcel Lockers (PLs), Pick-up Points (PPs), Crowdsourcing (CS), and Freight-on-Transit (FOT). In recent times, due to the efficacy and sustainability of EVs, Walmart intends to acquire 4500 all-electric delivery vehicles. Domino’s purchases 800 Chevy Bolt EVs to facilitate deliveries across its U.S. outlets, and Amazon deploys numerous customized EVs across over 100 cities [13]. ABI Research predicts an impressive 850 % growth in ADR technology advancements over the next ten years, benefiting warehouse usage and the delivery market [14]. Moreover, PLs and PPs have gained significant attention and popularity in recent years as practical solutions for the LMD [15].
Developing sustainable innovative solutions such as EVs, ADRs, PLs, PPs, CS, and FOT for LMD presents a multifaceted set of challenges from an Operations Research (OR) perspective. These challenges encompass modeling (problem definition), intricate optimization problems, uncertainty, and computations involving route planning, vehicle (e.g., EV and ADR) scheduling, resource allocation, and infrastructure planning, necessitating advanced algorithms to achieve efficient and cost-effective LMD networks. Furthermore, integrating diverse technologies requires novel modeling techniques to address uncertainties arising from traffic congestion, adverse weather conditions, and complex urban environments. Balancing environmental considerations with economic viability and adapting to evolving consumer preferences adds another layer of complexity to OR-driven decision-making processes in the pursuit of establishing sustainable and resilient LMD systems.
Conducting a systematic review to identify the challenges of innovative sustainable solutions for LMD from the OR perspective is of paramount significance in the LMD literature. Such a survey serves as a comprehensive synthesis of existing research, offering a consolidated understanding of the multifaceted challenges inherent in deploying technologies like EVs, ADRs, PLs, CS, and FOT for LMD optimization. This review paper examines the intricate challenges posed by optimization problems (models) and environmental factors (sustainability), identifies gaps in existing knowledge, and proposes directions for future research. It serves as a crucial reference point for researchers and practitioners, fostering a deeper appreciation of the interdisciplinary nature of sustainable LMD innovations and encouraging the development of novel methodologies that effectively address the intricate OR-related challenges, ultimately advancing both the academic and practical realms of LMD.
According to the literature, Last-Mile Logistics (LMLs) encompasses last-mile distribution, last-mile fulfillment, last-mile transport, and LMD. Several review papers have focused on LML, such as [16,17,18,19,20]. Moreover, LMD has been reviewed by researchers based on three classes of approaches: (i) traditional approaches (e.g., using trucks), such as, Vehicle Routing Problem (VRP) [21,22,23], and Traveling Salesman Problem (TSP) [24]; (ii) combination of traditional and innovative solutions [1,6,12,25,26]; and (iii) sustainable innovative solutions [27,28,29,30,31], which designed to minimize life-cycle environmental and social impacts (energy use, emissions, noise, congestion) while maintaining or improving service levels and economic viability through optimization, modeling, and solution algorithms. The last category of approaches can be studied from both OR and non-OR (e.g., stakeholder) perspectives.
In this systematic review, we focus on sustainable, innovative ground-based solutions in LMD from an OR perspective, which, to the best of our knowledge, has not been studied in the literature. Additionally, to the best of the authors’ knowledge, this literature review is a first attempt to investigate combined (hybrid) innovative solutions. Conducting a review from an OR perspective not only highlights existing shortcomings but also provides a structured framework for identifying, analyzing, and recommending strategies that bridge gaps in the literature. Previous reviews of ground-based LMDs exist in the literature, but our work differs from them in both focus and approach. For example, the works of [27,28,32,33,34] reviewed innovative solutions in LMD, but their perspectives were not from an OR perspective. In addition, ref. [35] reviewed the LMD and transportation logistics from a non-OR (i.e., stakeholder) perspective, which differs from our focus in the present work. Moreover, ref. [1] studied innovative solutions in LMD, but they investigated LMD in terms of efficiency, rather than sustainability. Two review works of [12,17] are the most similar works to this present paper in terms of studying the innovative solution in ground-based LMD from an OR perspective; however, the former work has not focused on sustainability, and also our work is more complete and detailed than the later work by investigating more problems and sub-problems in terms of OR. Additionally, the work of [12] did not review the CS, unlike our current review. To organize the review conceptually rather than descriptively, we introduce a conceptual framework that maps OR technique classes to sustainability goals and metrics; this framework precedes the per-innovation sections and anchors the comparative analysis presented later.
Moreover, the recent literature offers complementary perspectives: Shuaibu et al. [36] review optimization with Artificial Intelligence (AI), the Internet of Things (IoT), and drone integration. Bonilla et al. [37] provide a management-oriented taxonomy of sustainable e-retail practices. Alverhed et al. [38] focus specifically on autonomous delivery robots. In contrast, our review is intentionally ground-based and OR-centric approaches, linking problem structures to method classes and to people-planet-profit objectives, and synthesizing combined EV/ADR/PL/PP/CS/FOT designs. We complement recent reviews by providing a goal-technique framework, comparative OR studies, and insights into the deployment of hybrid systems. Additionally, as a broad baseline, Liu and Hassini [39] provide a unified terminology and bibliometric map of freight LMD across commercial and humanitarian settings (2010–2021). Additionally, a comprehensive synthesis of environmental sustainability approaches in B2C LMD by [40] provides valuable background on logistics- and consumer-side levers, along with reported trade-offs. Our review, in contrast, focuses on ground-based innovations and OR methods, with an update on technical advances from 2022 to 2025.
Throughout this review, sustainability follows a triple-bottom-line lens, planet (environmental impact), people (social impact), and profit (economic viability) [41,42], with resilience as a cross-cutting property. Planet covers life-cycle-aware use-phase indicators such as CO2 emission per parcel, energy use, local pollutants (NOx, PM), noise, and congestion externalities. People cover access to equity (e.g., the share of the population within a walking radius of PL/PP), customer service reliability (including failed deliveries and lateness), and safety/curb-conflict proxies. Profit covers total generalized cost, unit delivery cost, asset utilization, and on-time service as a viability criterion. We use this lens to motivate the goal-technique mapping and comparative guidance.
Contributions to theory and practice. Theoretically, we synthesize sustainable, ground-based LMD from an OR perspective by (i) unifying prior models under decision layers (strategic, tactical, and operational) and sustainability goals (cost, emissions/energy, service, resilience, and equity), (ii) formalizing a goal-technique mapping that links problem structure to appropriate OR method classes, and (iii) distilling cross-cutting insights and method selection guidance. In practice, we translate these insights into deployable guidance, including a comparative study of technique choice under real constraints, a reporting checklist for reproducible evaluation, and consolidated practice snapshots that summarize outcomes from real deployments and pilots. Together, these elements position the review as a reference for both academics and practitioners.
Methodological approach. We conduct a protocolled systematic review adapted from established guidance for operations and supply chain research. Searches covered Scopus, Google Scholar, IEEE Xplore, EBSCO, and Web of Science with pre-specified keywords (2010–2025; English; ground-based LMD; OR methods). We identified 283 records, screened titles/abstracts, assessed full texts against inclusion/exclusion criteria, and analyzed 265 eligible studies. A PRISMA-style flow diagram summarizes the identification, screening, eligibility, and inclusion processes. We then classify each study by innovation (EV, ADR, PL, PP, CS, FOT, hybrid), problem/sub-problem, and methodology, overlay the conceptual framework, and synthesize cross-cutting insights with comparative studies.
In Section 2, the methodology of this systematic review is explained in more detail. Section 3, Section 4, Section 5, Section 6, Section 7 and Section 8 describe the sustainable innovative solutions and introduce the challenges of using EV, ADR, PL, PP, CS, and FOT, respectively, in ground-based LMD from the OR perspective. Section 9 explains the combined innovative solutions in the literature from an OR perspective. Section 10 presents the comparative study, practical insights, and critical synthesis. In Section 11, the study gaps and future research directions are given. Finally, the concluding remarks are presented in Section 12.

2. Review Methodology

To conduct the systematic literature review, a methodology described in [43] was adapted to the research area. The systematic literature review consists of the following steps: (1) stating the research questions (Section 2.1), (2) identifying the scope of the work (Section 2.2), (3) identifying the database and search keywords (Section 2.3), (4) identifying the inclusions and exclusion criteria (Section 2.4), (5) reviewing and choosing the most relevant papers (Section 2.5), (6) defining a classification scheme to organize the literature (Section 2.6) and introducing a conceptual framework that maps OR technique classes to sustainability goals and metrics (Section 2.7), and (7) gap analysis and suggesting the future research directions (Section 11). These steps, along with their descriptions, are illustrated in Figure 1 for ease of understanding.

2.1. Research Questions

It is crucial to formulate research questions with precision and provide explanations for their formulation at the beginning of a review study. The research question determines the research design and sets expectations for the results. The research questions of the present review work are presented as follows:
  • RQ1: What are the challenges of employing sustainable innovative ground-based solutions in LMD from an OR perspective?
  • RQ2: Which OR methods are deemed most efficient for optimizing ground-based LMD with innovative technologies in terms of sustainability, and what are their essential characteristics?
  • RQ3: What are the research directions and study gaps in the sustainable employment of innovative ground-based solutions in LMD in terms of OR challenges?

2.2. Scope of the Work

By exploring the complexities of optimization challenges and considering environmental factors related to sustainable, innovative ground-based solutions in LMD from an OR perspective, this review helps pinpoint deficiencies in the existing understanding and proposes potential directions for future research.

2.3. Database and Keywords Selection

Identifying related work was based on the title, further refinement on the abstract, and reading the crucial parts of the papers when the abstract was insufficient for assessing alignment with the analysis’s scope. The first author collected and screened the papers. A total of 283 English papers published since 2010 were chosen for initial examination. A search was conducted using keywords across search engines and library databases, including Scopus, Google Scholar, IEEE, EBSCO, and ISI Web of Knowledge. The chosen keywords were a combination of terms related to LMD, such as, “last mile,” “parcel delivery,” “e-commerce,” “freight,” “sustainability,” “operations research,” “innovative solutions,” “EV,” “ADR,” “autonomous vehicles,” “ground-based,” “crowdsourcing,” “crowdshipping,” “parcel lockers,” and “pick-up points.” The search was limited to business and management, engineering, decision sciences, and social sciences journals. The individual scientific papers were chosen from published literature (journals) and conference proceedings.

2.4. Inclusion and Exclusion Criteria

The papers were also filtered based on specific criteria. For example, delivery of products not ordered online and delivery of services were excluded, as they fell outside the scope of the study. Only the ground-based last-mile forward flow was considered, excluding work on reverse and aerial-based logistics. Additionally, only papers that used OR as the methodology were selected, so papers that employed empirical, policy, or conceptual methods were excluded. Therefore, according to these inclusion and exclusion criteria, the collected articles resulted in 265 eligible papers for in-depth examination (including 23 review papers).

2.5. Screening and Inclusion Flow (PRISMA-Style)

Figure 2 summarizes the screening pipeline based on Preferred Reporting Items for Systematic Reviews and Meta-Analyses (PRISMA)-style [44]. We identified 283 English records (2010–present) from Scopus, Google Scholar, IEEE Xplore, EBSCO, and Web of Science. After deduplication, we screened titles/abstracts, excluded out-of-scope items (e.g., non-OR methods, aerial/reverse logistics, service deliveries not tied to e-commerce), and assessed the remainder at full text. We included 265 articles for in-depth analysis (including 23 review papers). Counts in the diagram are aligned with our scope and are reproducible from the query strings and criteria reported in Section 2.3 and Section 2.4. This systematic review was prospectively registered on the Open Science Framework (OSF) under the title “A Systematic Review of Sustainable Ground-Based Last-Mile Delivery of Parcels: Insights from Operations Research.” The registration type is Generalized Systematic Review Registration, and it is available under a CC-BY 4.0 International License. The registration DOI is https://doi.org/10.17605/OSF.IO/STXZQ.

2.6. Classification Scheme

The selected contributions were reviewed and categorized based on various criteria, including their characteristics, research methods, and the problems addressed, as shown in Figure 3. The classification scheme of the present review work is based on three categories: (I) type of innovative solution, (II) type of problems and sub-problems, and (III) type of solution methodology. The first criteria, type of innovative ground-based solutions, include EV, ADR, PL, PP, CS, FOT, and combined solutions. The second criterion classifies papers by the problems and sub-problems within each innovative solution. Finally, the third criterion indicates the OR-oriented research method for each paper. Using these three criteria, the articles on sustainable and innovative solutions in ground-based LMD are classified and distinguished. In Section 3, Section 4, Section 5, Section 6, Section 7, Section 8 and Section 9, the papers related to each innovative solution with their type of problems and solution methodologies—starting from EVs to combined solutions—are reviewed to see the similarities and differences between them and find the research gaps.

2.7. Conceptual Framework: OR Techniques to Sustainability Goals

This study structures sustainable LMD as a multi-objective decision problem spanning three layers: strategic (siting/infrastructure), tactical (routing/scheduling), and operational (real-time dispatch). The sustainability goals considered are as follows: environmental impact (energy use, noise, and emissions), service quality (on-time performance, walking distance, and access equity), cost-effectiveness (total generalized cost), and resilience (robustness and recovery under perturbations). Let x collect first-stage decisions (e.g., siting and fleet mix) and y ( ξ ) recourse decisions (e.g., dispatch and recharging) under uncertainty ξ . A canonical formulation is
min x C ( x ) , E ( x ) , S ( x ) s . t . x X , y ( ξ ) Y ( x , ξ ) ,
with robust or stochastic variants such as min x max ξ U C ( x , ξ ) or two-stage min x E ξ [ C ( x , ξ ) ] ; trade-offs can be explored via ϵ -constraint (e.g., min C s.t. E ϵ E , 1 S ϵ S ). Metrics include: cost (in currency), energy (in kWh), and emissions (in CO2), as well as service (late deliveries, mean/percentile lateness), resilience (worst-case regret, expected shortfall of lateness, recovery time), and equity (population within walking distance). As presented in Table 1, different technique classes naturally emphasize certain goals and constraints. Exact Mixed-Integer Linear Programming (MILP) models and decomposition methods offer transparency and policy sensitivity at strategic/tactical levels. Matheuristics and metaheuristics scale effectively on rich tactical models involving energy/synchronization. Robust and stochastic programs enhance resilience, while learning-assisted heuristics support operational responsiveness. Practitioners identify their dominant goals and constraints, select the decision layer, and then choose technique classes that best realize the mechanisms for those goals. For example, if resilience and service under timetable drift are critical (e.g., FOT), a Time-Expanded Network (TEN) with stochastic recourse and Column Generation (CG) is preferable; if city-scale EV routing with nonlinear charging is central, matheuristics with energy-aware neighborhoods dominate. This framework anchors the per-innovation reviews (Section 3, Section 4, Section 5, Section 6, Section 7, Section 8 and Section 9) and complements the comparative analysis in Section 10. Note that the existing classification (shown in Figure 3) organizes prior work by innovation type, problem/sub-problem, and solution methodology. However, the conceptual framework overlays two additional dimensions: (i) decision layer (strategic/tactical/operational) and (ii) sustainability goals/metrics (cost, emissions/energy, service/equity, resilience), providing a mapping from each classified item to goals and suitable technique classes.
Table 2 links sustainability dimensions to measurable metrics and typical OR levers. This mapping enables multi-objective or ϵ -constraint formulations that balance environmental, social, and economic goals, with resilience captured via risk-sensitive objectives and feasibility under perturbations. In practice, we recommend either (i) a multi-objective formulation that constructs Pareto sets over {cost, emissions/energy, service, equity} with resilience captured via risk measures, or (ii) an ϵ -constraint approach (e.g., minimize cost subject to CO2e ϵ E , on-time ϵ S , coverage ϵ Q ). This makes people, planet, and profit goals explicit and traceable in solution design.

3. Electric Vehicles

The EVs, including e-bikes, e-vans, e-tricycles, e-trucks, and e-Tuk-tuks, have emerged as a transformative solution for urban LMD, offering significant environmental benefits by reducing emissions and fossil fuel dependence. However, integrating EVs also introduces operational challenges, such as range limitations, charging logistics, and fleet heterogeneity. The OR methods provide a systematic framework for tackling these complexities through optimization models, heuristic techniques, and simulation-based approaches.

3.1. Routing and Scheduling Models

Due to their limited battery range and longer charging times, EVs pose unique routing and scheduling challenges. EVs generally support 160–500 km on a full charge, depending on vehicle type and technological advancements [45,46]. OR models for routing with EVs, such as the Green Vehicle Routing Problem (G-VRP) and the Electric Vehicle Routing Problem (E-VRP), extend classical VRPs by including battery constraints and charging requirements. G-VRP focuses on alternative-fuel vehicles with limited range and sparse refueling stations [47]. E-VRP integrates battery consumption and charging dynamics, often under time-window constraints [48], which are solved using hybrid heuristics such as Variable Neighborhood Search (VNS) and Tabu Search (TS). For a detailed review, see [49,50,51].

3.1.1. Charging Strategies and Dynamics

Charging behavior is another layer of complexity; early models assumed full recharging, while later models introduced partial charging [52,53,54] and battery swapping [55,56,57,58]. Heuristics such as Adaptive Large Neighborhood Search (ALNS) [52,59,60,61,62], VNS [54], Simulated Annealing (SA) [63], Iterated Local Search (ILS) [64], matheuristics [53], and exact branch-price-and-cut [65] methods have been employed. For more details, please see [66].

3.1.2. Variable Vehicle Speed

Moreover, the assumption of a constant speed for EVs is unrealistic in many applications. Liu et al. [67] studied the E-VRP with variable vehicle speed and soft time windows for perishable products. They proposed a Mixed-Integer Programming (MIP) model and an Adaptive Hybrid Ant Colony Optimization (AHACO) with a two-stage speed optimization strategy for the problem. Including more decision variables related to EV features could better reflect real-world situations. For example, Xiao et al. [68] proposed a comprehensive model that includes energy-loss functions, piecewise linear charging, and continuous decision variables. They developed a mathematical model for this problem.

3.1.3. Charging/Consumption Rate Pattern

Moreover, the State of Charge (SoC) at each charging station may be modeled as a nonlinear function of charging time, typically a piecewise-linear function. The nonlinear charging function was first introduced by Montoya et al. [69]. They proposed a metaheuristic, ILS, to solve the large-scale E-VRP with a nonlinear charging function. Next, Froger et al. [70] developed more effective MIP models for the same problem. Initially, they created a method to track time and charge levels using arcs. This approach proved to be more effective than the traditional node-based method [69] for tracking these variables. In addition to the nonlinear charging function, [71] studied load-dependent discharging with capacitated charging stations, extending the classic E-VRP in which the discharging rate was constant and independent of the EV’s load, and the capacity of each station was unlimited. They proposed a MIP model and an ALNS metaheuristic algorithm to solve the problem. A recent work by [72] studied the E-VRP with SoC-dependent charging and discharging rates. They developed a new MIP model and an ILS-based heuristic for the addressed problem.

3.2. Charging Infrastructure Planning

OR models aid in infrastructure planning by determining the optimal locations and capacities of charging stations. Approaches include Genetic Algorithm (GA)-based heuristics [73,74,75], Particle Swarm Optimization (PSO) [76], hybrid PSO-GA [77], MIP [78], exact methods [79,80,81,82], simulation–optimization model [83], and multi-criteria decision making [84]. Realistic constraints, such as grid interaction, renewable energy sources, and traffic data, are integrated [85,86]. Review papers include [87,88,89,90].

3.3. Simultaneous Routing and Infrastructure Optimization

The Electric Location Routing Problem (EV-LRP) and Battery Swap Station Location-Routing Problem (BSS-EV-LRP) integrate routing and infrastructure decisions. BSS-EV-LRP was first introduced by [91] and further advanced by [84,92]. Recent approaches use skewed general VNS [93] and branch-and-price [94]. For EV-LRP, Schiffer and Walther [95] proposed a robust approach under demand uncertainty using a parallelized ALNS. Wang et al. [96] introduced a two-phase evolutionary algorithm leveraging historical learning. Other works address stochastic demands [97], ambient temperature [98], and motion dynamics [99].

3.4. Fleet Management and Optimization

Efficient fleet management involves decisions on fleet size, allocation, and vehicle heterogeneity. Models either minimize the number of EVs used [100,101] or assume a fixed-size fleet [102]. Heterogeneous EV fleets are addressed in [103,104], with optimization via Benders decomposition and hybrid methods.

3.5. Balancing Efficiency and Sustainability

The integration of EVs into LMD offers environmental benefits such as reduced greenhouse gas emissions and improved air quality. However, achieving a balance between environmental sustainability and operational efficiency presents challenges. The OR methods play a crucial role in addressing these trade-offs by incorporating environmental metrics and emissions models into multi-objective optimization frameworks. These models typically aim to minimize both environmental impact (e.g., emissions and energy consumption) and operational costs (e.g., transportation, charging, and penalties). Numerous studies have applied OR techniques to various multi-objective EV routing and scheduling problems. Cai et al. [105] addressed the EVRPSPDTW using NSGA-II, focusing on cost and power consumption under time windows and congestion. Gholami et al. [106] optimized the allocation of EV charging stations and PV inverters using fuzzy Pareto dominance and differential evolution. Kapoor et al. [107] developed a framework that minimizes charging costs and power losses using PSO for stakeholder-aligned scheduling. Zakariazadeh et al. [108] employed the ϵ -constraint method and Benders decomposition for V2G scheduling under economic and environmental constraints. Sarker et al. [109] proposed MORP for wireless in-motion charging, balancing energy use, travel time, and driver anxiety using adaptive constraint techniques. Zhou and Zhao [110] developed a whale-optimization algorithm for the EVRP with battery swaps and mixed time windows, optimizing cost and battery utilization.
Overall, EVs in LMD present new challenges and opportunities that OR can address across routing, charging, infrastructure, and sustainability dimensions. By leveraging optimization and data analytics, OR enables informed decisions that enhance the feasibility and impact of EV adoption in urban logistics. Exact MILPs are suitable for calibration on small-to-medium EVRP instances or for simplified charging. For city-scale routing with time windows and energy, ALNS/VNS/ILS provide near-optimal solutions within practical time budgets, while decomposition helps when charging or location decisions are coupled. Nonlinear charging or SoC-dependent rates favor matheuristics with tailored neighborhoods over monolithic exact solves.

4. Autonomous Delivery Robots

The ADRs are ground-based EVs that can deliver packages independently. According to SAE’s classification of automation (ranging from Level 0 to Level 5), ADRs can operate up to full autonomy (Level 5) [111]. Despite their growing potential, the application of ADRs in urban LMD still faces various operational and strategic challenges. Unlike autonomous vehicles, which are primarily studied for passenger transport [112], ADRs remain underexplored in freight applications [113]. Two major categories of ADRs include Sidewalk ADRs (SADRs), which operate on pedestrian pathways, and Road-based ADRs (RADRs), which operate in mixed traffic environments [113].

4.1. Pure ADR-Based Routing and Scheduling

ADR-exclusive delivery systems aim to optimize routes without involving conventional vehicles. This is known as the Robot-Only Routing Problem (RRP), focusing solely on ADRs for parcel transport [114]. Sonneberg et al. [115] proposed strategic positioning and routing models for urban autonomous ground vehicles (AUGVs). Kronmueller et al. [116] examined dynamic on-demand grocery delivery using a decentralized network of local depots and ADRs. More recently, Wang et al. [117] developed a space-time route-planning and task-assignment model with enhanced TS to minimize fleet travel distance. Moradi et al. [101] formulates a routing model for multi-stop Autonomous Delivery Vehicles (ADVs) in urban last-mile logistics, aiming to minimize route and vehicle usage costs while respecting constraints on ADV load and battery capacity, maximum route duration, and customers’ walking distance. For robot-only operations with soft time windows, Gnegel et al. [118] formulate a Mixed-Integer Quadratic Programming (MIQP) that minimizes squared delays under battery/partial-charging constraints and solve it via a layered time-SoC graph with Iterative Refinement and Branch-and-Refine, which outperform direct MIQP solves on Solomon-style instances. In dynamic settings, Jeong and Moon [119] formulate a DPDP-AR for an airport terminal with online order arrivals, hard deadlines, and battery charging; a reassignment policy and peak-time battery management improve service robustness during surges. For the strategic, city-scale design of sidewalk ADR systems, a continuous approximation model by [120] with bounded makespans yields closed-form guidance on fleet size, station density, and service regioning. A New York City case study demonstrates how policy/operational constraints influence optimal designs.

4.2. Truck-and-Robot Collaborative Delivery

4.2.1. Single-Vehicle Systems

Truck-assisted ADR delivery has gained attention in hybrid models. Boysen et al. [121] introduced the CSVSP-TBAR model, in which a truck deploys robots from city depots. Simoni et al. [122] investigated a “mothership” system using SADRs and proposed heuristics for coordinated routing. Jennings and Figliozzi [123] assessed regulatory constraints, robot performance, and time–cost tradeoffs in the U.S. The CAVADP, proposed by Reed et al. [124], combines ADRs with delivery personnel, reducing parking time and increasing delivery speed. Their results showed up to 77 % time savings under specific scenarios. Later, the authors adapted the model to more realistic urban-rural configurations. Additionally, Reed et al. [125] developed an integer programming model (CAVADP) to evaluate the benefits of ADR-assisted LMD across urban and rural settings, finding that ADRs reduce delivery time and costs, particularly in urban areas. Ostermeier et al. [126] optimized cost-based routing in truck-and-ADR systems, accounting for time windows and limited robot availability. Alfandari et al. [127] presented the URSP, where trucks launch robots from facilities to reduce tardiness, which is solved using a branch-and-Benders-cut scheme. Heimfarth et al. [128] extended these ideas by formulating the MTR-RP, where both trucks and robots serve customers. Their VNS-based algorithm significantly outperformed previous methods, reducing delivery costs by up to 43 % .

4.2.2. Multi-Vehicle Systems

Chen et al. [129] introduced the VRPTWDR problem, in which trucks and ADRs jointly handle deliveries under synchronization constraints and time windows. Their matheuristic [129] and ALNS-based [130] approaches proved effective in reducing delivery times and operational costs. Unlike CSVSP-TBAR and URSP, this model does not rely on dedicated robot facilities. To address scale, Ostermeier et al. [131] proposed MVTR-RP-D, a multi-vehicle variant with robot depots. Their SINS heuristic achieved up to 62 % cost savings compared to truck-only systems. Meanwhile, Scherr et al. [132] studied tactical-level service network design with a mixed ADR fleet. The model integrates platooning with manual vehicles for areas outside autonomous zones, aiming to optimize fleet mix and routing. For hybrid ADR-van designs, Klar et al. [133] developed an integer program that, given zonal demand estimates, allocates parcels to robots or vans to jointly minimize cost and energy, clarifying when dense, short-haul zones favor robots and when dispersed zones favor vans. Accounting for congestion explicitly, Wei et al. [134] modeled a two-echelon truck and Unmanned Ground Vehicle (UGV) routing problem with time-dependent travel times and solved it via ALNS; a Dalian case and sensitivity analysis (congestion, UGV capacity) indicate notable efficiency gains and clarify deployment conditions. Two-echelon designs with ADVs have been formalized in a study by [135] via a MILP model (2E-VRP-ADV), showing conditions under which robot-assisted second-level distribution outperforms truck-only tours.

4.3. Safety and Security Considerations

Safety is a critical concern for ADRs. They must navigate complex environments without disrupting traffic or causing accidents. Li et al. [136] detailed the system architecture and safety strategies of an autonomous delivery platform. Bentley et al. [137] addressed coordination challenges, using Constrained Optimization in Learned Latent Space (COIL) to schedule ADRs under supervision constraints. Their results demonstrated improved safety and throughput compared to standard GAs. Beyond technical safety, user acceptance matters: a hospitality study finds that framing ADRs as a lower-carbon option increases consumers’ choice of robot delivery, yet the effect collapses when perceived service risk (e.g., cold/late food) is high [138]. User acceptance shapes feasible deployment: survey evidence shows that motivated consumer innovativeness (functional, hedonic, social, and cognitive) significantly increases intention to choose ADR delivery, partly via perceived usefulness/enjoyment [139]. Beyond routing and control, the feasibility of ADR deployment depends on urban planning and governance choices (e.g., sidewalk/curb design, conflict management, and accessibility). A recent planning chapter synthesizes design principles for integrating autonomous robots into people-oriented streets and public spaces [140]. Public attitudes toward delivery robots are mixed. A study by [141], which combines text mining and user studies, highlights the usefulness versus intrusiveness, safety/privacy concerns, and etiquette concerns, and derives design implications for ADR behavior in public spaces.
Real-world HRI evidence from 117 user-generated videos shows recurring interaction breakdowns and communication needs (multi-party path negotiation, transparency for unexpected behavior, and help-seeking cues), informing eHMI and etiquette for ADRs in public space [142]. A deployment-oriented account of the Ona ADR details street-sidewalk navigation, safety/teleop, and early city pilots, offering practical integration lessons that complement optimization models [143]. At the local control layer, a campus study [144] contrasts A*, RRT, and RRT* with pure-pursuit tracking on an outdoor delivery robot: A* is more consistent but slower, whereas RRT/RRT* are faster yet variable; in minimum-cost cases, RRT* yields smoother steering and slightly shorter runs, underscoring a consistency-speed trade-off in motion planning. Survey evidence by [145] suggests that trust, transparency, and user-centered design significantly influence public willingness to adopt ADR delivery. Human factors evidence by [146] shows that robot lighting can shape public comfort: a nighttime study finds SADR light colors significantly affect pedestrians’ perceived safety during approach interactions.
A German consumer study [147] finds that acceptance of delivery robots varies by meal/parcel scenarios and is shaped by TAM constructs (usefulness, ease, etc.), supported by SEM and qualitative interviews. At the sidewalk navigation layer, Zhou et al. [148] developed a multi-modal socially aware stack (sidewalk segmentation; RGB-D 3D pedestrian detection + social force-based trajectory selection; state lattice planning with etiquette costs) and validated it in simulation and on a Husky platform, improving ADE/FDE and yielding behaviors like “keep left/overtake right”. A recent work by [149] enumerates the principal ADR challenges (energy/charging, navigation and public safety/HRI, reliability, regulation, and infrastructure readiness). It links them to managerial levers, providing a deployment-oriented complement to optimization models. Consumer acceptance of ADRs depends less on raw features per se and more on how they shape perceived value and perceived risk: a 500-respondent study by [150] shows compatibility, convenience, privacy/security, and reliability act via full mediation, yielding concrete levers for deployment and communication. Practice evidence from a European pilot [151] highlights governance, regulatory coordination, and infrastructure readiness as decisive factors for ADR deployment, offering concrete managerial recommendations on scoping, stakeholder alignment, and tech adaptation.

4.4. Trade-Off Between Efficiency and Sustainability in Autonomous Delivery Robots

The environmental performance of ADR-based delivery is under active investigation. Li et al. [152] assessed life-cycle greenhouse gas emissions for various levels of automation and vehicle types. Their findings show that small electric vans remain more eco-efficient than ADR-based systems in specific contexts, while the environmental benefits of full automation are moderate. Figliozzi [113] compared ADRs, including drones, SADRs, and RADRs, to traditional vans and customer pickups using a continuous approximation model. The study quantified vehicle miles, energy use, and emissions, highlighting efficiency trade-offs that depend on delivery density, vehicle choice, and travel distance. Complementing micro-level routing studies, a 14-city comparative analysis finds that ADRs are most effective in pedestrian-focused, traffic-restricted areas. In contrast, cargo bicycles dominate in dense cores, and light commercial vehicles retain advantages as dispersion grows [153]. Using continuous approximation with Monte Carlo uncertainty analysis, Lemardelé et al. [154] showed that a two-echelon van-and-ADR scheme via urban micro-hubs can cut operating costs by over 10 % in small/medium European cities under appropriate conditions, while quantifying input-driven cost variability.
In summary, integrating ADRs into LMD systems offers significant benefits in terms of cost efficiency, delivery speed, and environmental sustainability. However, these benefits come with challenges in routing complexity, fleet coordination, infrastructure planning, and safety. OR models, through MIP formulations, metaheuristics, and hybrid algorithms, are essential in developing efficient ADR-based solutions. Also, synchronization and launch/retrieval constraints limit exact scalability. Matheuristics and Benders-aided formulations handle medium- to large-scale instances, and policy learning supports real-time dispatch. Reliable handling times and curb operations data are pivotal; sensitivity to these inputs should be reported. For further reading, several review works offer detailed overviews of ADRs in LMD [38,114,155,156,157,158,159].

5. Parcel Lockers

The continued rise of e-commerce has intensified the need for efficient LMD. The PLs have emerged as an innovative solution that supports unattended delivery, offering benefits such as reduced failed deliveries, lower courier costs, and increased customer convenience [1,160,161]. PLs, typically located in public or commercial spaces, enable flexible, secure access via digital authentication. However, their integration poses operational challenges that require optimization via OR methods.

5.1. Parcel Locker Location Optimization

The optimal placement of PLs is essential for balancing accessibility, logistics efficiency, and investment cost. Deutsch and Golany [162] formulated the Parcel Locker Facility Location Problem (PL-FLP) to maximize profit, accounting for setup and delivery costs. Simulation optimization frameworks have also been utilized to guide deployment strategies, as demonstrated in the Automated Parcel Locker (APL)-focused work by Rabe et al. [163] and Sawik et al. [164], which employed real data and multi-period models. Multi-objective models, such as MOPLNDP by Luo et al. [165], strike a balance between cost and accessibility by utilizing active-learning evolutionary algorithms. In China, Yang et al. [166] introduced a bilevel programming model to align user satisfaction and provider profitability. Kahr [167] studied integrated locker location and compartment design under uncertainty as the SMCLLP. Schwerdfeger and Boysen [168] explored Mobile PLs (MPLs), who found that locker fleets dynamically reposition during the day, thereby reducing the overall fleet size. Stochastic approaches, such as those by Mancini et al. [169], address demand and capacity uncertainties in locker box location planning using scenarios and matheuristics. These models highlight how OR can enhance planning under both deterministic and uncertain environments. PL siting can be coupled with volume design: a study by [170] models profit-maximizing locations where each PL selects from discrete volume options to serve heterogeneous parcel sizes, improving performance over fixed-size deployments.

5.2. Integration of Parcel Lockers with Vehicle Routing Optimization

Several models have integrated PLs into vehicle routing to enhance delivery efficiency. Orenstein et al. [171] proposed the Flexible Parcel Delivery (FPD) problem, incorporating customer preferences for delivery locations. Sitek and Wikarek [172] developed the CVRPPAD model, integrating pick-up, delivery, and locker points using hybrid CLP/MP techniques. Time window-based extensions were later explored [172,173]. Other formulations include the TSP-L-TW [174], which minimizes delivery and customer travel costs, and the VRP-L-TW [175], which is solved using branch-and-cut algorithms. Two echelon variants, such as the 2E-VRP-CO [176] and 2EVRP-LF [177], incorporate both satellite facilities and lockers for final deliveries. More complex hybrid models, such as 2E-VRPTW-IF-OD [178], incorporate delivery flexibility and customer preferences. Other innovations include the VRPPL [179], VRPDO [180], and VRP-HL [181], which incorporate shared locations, multiple parcel sizes, and heterogeneous lockers. Several solution approaches have been proposed for VRPDO in the literature, including the branch-price-and-cut algorithm [182] and data-driven ALNS [183]. Recent studies have also explored simultaneous locker location and routing [184,185,186], mixed delivery systems [187], and VRPSPDPL models that combine pickup and delivery [188]. Novel systems involving Autonomous Mobile Lockers (AMLs) have been modeled in the AML-C2-E-LRP and its multi-depot extension [136,189], showing significant operational savings. Finally, Liu et al. [190] proposed the MPLP and solved it using a hybrid reinforcement learning technique, thereby further improving the efficiency of mobile locker deployment.

5.3. Locker Assignment and Scheduling

Wang et al. [191] considered mixed fixed-mobile locker deployments and solved a location-routing-scheduling model using a GA-based algorithm. These studies show how OR can guide both strategic location design and operational scheduling. A stated-choice study by [192] comparing stationary versus MPLs reports that access distance dominates choice, with a general preference for stationary lockers; short MPL dwell times reduce attractiveness; younger users are more open to MPLs; and stationary PLs are preferred on rainy weekdays and for time-sensitive parcels.

5.4. Trade-Offs Between Efficiency and Sustainability in Parcel Lockers

Studies suggest PL-based delivery systems can outperform home delivery in terms of cost, emissions, and reliability. Zurel et al. [193] reviewed international PL deployments and outlined regulatory challenges. Dong et al. [194] analyzed PL network expansion in Norway and found reduced environmental impact and improved service efficiency. Klein and Popp [195] examined customer preferences and perceptions of sustainability across various delivery types, highlighting the importance of convenience and perceived value. White-label PLs were explored by Hohenecker et al. [196] as part of the alBOX project. The pilot in urban and rural areas revealed insights into user behavior and social acceptance. Finally, Bonomi et al. [197] introduced a multi-objective optimization model for PL-based LMD that minimizes both environmental impact and travel distance. A simulation study by [198] for Dortmund shows that when customer trips to lockers are explicitly included, the CO2 advantage of APLs can diminish or reverse in outer districts, making locker density and user behavior key parameters in sustainability comparisons. MPLs can outperform both stationary lockers and home delivery under suitable dwell-time and coverage policies. An operational design study by [199] quantifies the cost and CO2 trade-offs and identifies key levers in mobility patterns and siting density.
PLs offer a compelling alternative to conventional delivery, enhancing efficiency and sustainability in LMD. However, their optimal deployment, integration, and scheduling require advanced OR techniques that handle both logistical and behavioral uncertainties. When siting and routing are tightly coupled, decomposition or matheuristics dominate; if siting is strategic and slow-moving, an exact siting phase followed by heuristic routing is effective. Under uncertain compartment usage and time windows, scenario-based matheuristics are more stable than single-scenario exact solves. For a broader understanding, readers may consult review works by [200,201,202].

6. Pick-Up Points

The PPs are increasingly popular alternatives in LMD, offering customers a centralized location to pick up parcels. Unlike the PLs, PPs are typically manned kiosks or stores and operate only during specific hours [1,160]. Their integration into LMD networks introduces various challenges related to location planning, vehicle routing, and sustainability that can be effectively addressed using OR tools.

6.1. Pick-Up Point Location Optimization

The location of PPs plays a crucial role in optimizing accessibility and delivery consolidation. Morganti et al. [203] compared PPs and locker-based alternatives in France and Germany, examining their operational models, consumer behavior, and service providers’ strategies. These alternatives were found to consolidate deliveries and reduce fragmentation. From a spatial planning perspective, Russo et al. [204] evaluated the accessibility of PPs in an urban center in Sicily. Using spatial syntax and walkable isochrones, they proposed a methodology that integrates pedestrian infrastructure into location analysis. Their findings emphasized the importance of walkability and proximity in sustainable urban logistics. A consumer study by [205] highlights which PP attributes most influence choice, accessibility (walking distance), opening hours, safety/security, queueing/parking convenience, and information/fees, suggesting these factors be encoded as equity and service constraints in PP siting and routing. On the strategic side, siting is naturally modeled via p-median, covering, or maximal accessibility formulations with time-dependent capacities; exact MILPs are tractable at city block granularity. Multi-objective formulations balance delivery cost, access equity (the share of the population within a target walking radius), and robustness to no-show/late pick-up rates. For uncertain demand and operating hours, two-stage stochastic programs with recourse or robust counterparts can stabilize performance. Scenario-based matheuristics (e.g., ALNS with site-opening neighborhoods) scale well and preserve solution interpretability. PPs are most effective where retail density provides coverage within a short walking distance and where opening hours align with customer availability.

6.2. Integration of Pickup Points with Vehicle Routing Optimization

PPs can be integrated into vehicle routing models to improve sustainability, especially in the food supply chain. Saad and Bahadori [206] compared home delivery and PP systems using a VRPTW formulation, focusing on CO2 emissions. Their implementation found that PP models offer substantial environmental advantages, reducing vehicle kilometers and emissions in urban food delivery systems. Demand steering to PPs can be co-optimized with routing: a two-stage stochastic model with decision-dependent uncertainty and a branch-and-bound algorithm achieves 4-8% lower costs than common baselines, with optimal incentives often targeting customers near PPs rather than the farthest ones [207]. A realistic OR model for PPs accounts for: (i) opening/closing schedules and lunch breaks that restrict feasible customer pick-ups; (ii) clerk capacity and service times that induce queuing or time window effects; (iii) maximum customer walking distance to a selected PP; and (iv) inventory/holding constraints for parcels awaiting pick-up. A time-windowed facility location with capacity can represent these elements, and by a VRPTW with delivery to PP nodes, often with a penalty or soft time window for customer retrieval. When siting and tours are coupled (joint location-routing to PPs), decomposition is effective: a master problem selects PP sites and capacities, and a subproblem plans VRPTW tours given those sites. Empirically, PP deployments consolidate stops and reduce failed deliveries, with case studies reporting substantial reductions in fleet size and vehicle kilometers when home deliveries are redirected to staffed PPs in densely populated areas. Notably, including clerk capacity helps avoid over-optimistic service assumptions and explains the observed evening peaks; coupling PP siting with VRPTW yields better network-wide performance than sequential decisions in high-demand districts.

6.3. Trade-Offs Between Efficiency and Sustainability in Pickup Points

The adoption of PPs can significantly reduce LMD’s carbon footprint. Brown and Guiffrida [208] compared traditional in-store pickup with e-commerce home delivery. By modeling break-even points in emissions based on distance and delivery volume, they provided insights into the environmental impact of each method and helped guide sustainable logistics decisions. Beckers and Verhetsel [209] studied the spatial distribution of Collection and Delivery Points (CDPs) in Belgium. They found that only one courier provided walking distance access to more than half of the population, advocating for multi-carrier CDPs and urban planning support to enhance sustainability and reduce reliance on cars for last-mile trips. Masteguim and Cunha [210] assessed the operational and environmental viability of redirecting home deliveries to PPs in São Paulo, Brazil. Using an optimization-based model, they demonstrated that routing parcels to PPs could reduce fleet size and total mileage by over 50 % . Their results supported PPs as an effective alternative for dense urban regions aiming to reduce externalities associated with traditional LMD.
The PPs offer a viable alternative to home delivery in urban logistics, helping reduce congestion, emissions, and delivery failure rates. The successful implementation depends on optimal location planning, customer accessibility, and integration with routing models, areas where OR techniques play a vital role. PP networks favor simple siting with routing heuristics at scale, given their low capital expenditure and retail coverage. However, limited opening hours and human handling constrain reliability, making exact time window models practical only for small instances. For comprehensive insights, conceptual frameworks, and reviews, the works of [211,212] offer valuable contributions.

7. Crowdsourcing

The CS (Crowdsourcing), also known as crowdshipping, refers to the delegation of LMD tasks to a network of ordinary individuals, commonly referred to as the “crowd” who utilize their routes and vehicles to deliver parcels [213]. This model enhances delivery responsiveness and efficiency, often enabling same-hour services, while posing novel OR challenges due to its dynamic, decentralized nature.

7.1. Scheduling, Assignment, and Operational Models

Efficiently assigning delivery tasks to a dynamic, heterogeneous pool of drivers, each with unique availability, routes, and preferences, constitutes a core optimization problem. The Vehicle Routing Problem with Occasional Drivers (VRP-OD) was first introduced by Archetti et al. [214], considering in-store customers as potential Occasional Drivers (ODs). This model was enhanced by Macrina et al. [215] through the use of VRP-OD with Time Windows (VRP-ODTW), which enabled drivers to serve multiple deliveries under temporal constraints. Subsequent studies advanced solution techniques using VNS, GRASP-VNS hybrids, and Machine Learning (ML)-assisted heuristics [216]. Soto Setzke et al. [217] developed route matching algorithms evaluated on real mobility data. Mancini and Gansterer [218] proposed VRP-OD with Order Bundles (VRP-OD-OB), using bidding mechanisms to assign bundles. A chance-constrained stochastic version of VRP-ODTW was later proposed to handle uncertainty in travel times [219]. Reinforcement learning also emerged in this domain. Ahamed et al. [220] used Deep Q-Networks (DQN) to assign courier tasks under capacity and availability constraints. Behrendt et al. [221] applied neural networks for real-time scheduling, achieving near-optimal results. To address uncertainty in driver capacity, Ulmer and Savelsbergh [222] proposed continuous approximation models for staff scheduling.
Kafle et al. [223] modeled the integration of pedestrian- and cyclist-based CS with truck carriers for urban delivery; the MIP model determined relay points, truck routes, and crowdsourced assignments. TS-based heuristics achieved high-quality solutions efficiently. Tao et al. [224] proposed a multi-depot delivery system using both regular and ODs. The model employed an event-based, rolling-horizon approach, dynamically updating assignments in real time based on driver availability. Wu et al. [225] introduced the 2EOVRP-CS, which involves transferring trucks to crowdsourced shippers at relay points. A Nested Genetic Algorithm (NGA) optimized crowdshipper selection, relay location, and route planning. Empirical evidence from Xi’an showed 14 % cost and 26 % VMT reductions compared to truck-only models. Arslan et al. [226] proposed a service platform that coordinates ad hoc and dedicated drivers in dynamic settings. A rolling-horizon optimization approach yielded up to a 37 % reduction in VMT. Dayarian and Savelsbergh [227] designed myopic and predictive strategies within rolling horizon frameworks to leverage in-store customer deliveries for same-day services, demonstrating the value of probabilistic modeling in planning. Sampaio et al. [228] introduced transfer points to reduce distance and driver needs. Voigt and Kuhn [229] proposed an MIP model for mixed fleets that improves service flexibility.

7.2. Stochastic and Uncertainty-Based Models

Gdowska et al. [230] introduced a bi-level matching and routing framework, recognizing ODs as autonomous agents who may reject deliveries. Optimization accounted for the probabilistic nature of driver acceptance. Mousavi et al. [231] proposed a two-stage stochastic program for mobile depot placement under crowdshipper uncertainty. CS systems must respond to real-time fluctuations in delivery demand and driver supply. Chen et al. [232] formulated a multi-driver, multi-parcel matching problem and proposed ILP and heuristics that account for parcel transfers and detour constraints. Yıldız [233] employed dynamic programming without making assumptions about arrival distributions, while Tapia et al. [234] showed that CS could increase CO2 emissions if not optimized carefully.

7.3. Crowdshipping Infrastructure and Transshipment

Macrina et al. [235] incorporated intermediate depots into crowdshipping to reduce traditional vehicle costs. Using VNS heuristics, they optimized delivery assignments to central and intermediate depots. Vincent et al. [236] extended this model by using ALNS to handle multiple delivery modes. Wang et al. [237] formulated crowd-tasking as a network min-cost flow problem, utilizing citizen workers to deliver parcels during their regular commutes. Real-world datasets from Singapore and Beijing demonstrated the method’s scalability and efficiency.

7.4. Parcel Allocation and Network Optimization

Wang et al. [238] addressed joint optimization of parcel allocation to stations and crowd-courier routing. A CG-based set-partitioning model and a rolling-horizon strategy were used to solve large-scale problems. Stokkink and Geroliminis [239] employed a continuum approximation to select depots efficiently.

7.5. Pricing, Incentives, and Compensation

Crowdshipping reliability challenges prompted platforms to offer employees incentives. Behrend and Meisel [240] combined item sharing with CS to enable collaborative consumption. Fadda et al. [241] minimized connectivity costs using mobile device hotspots via a stochastic model. Boysen et al. [242] employed Benders’ decomposition to optimize matching and wages under time constraints. Fatehi and Wagner [243] presented a robust CS model integrating labor planning, routing, and queueing. Chen et al. [232] used a reverse-auction framework to price Occasional Couriers (OCs). He et al. [244] examined insurance schemes for pricing and wage-setting in CS, identifying revenue-sharing as optimal under certain conditions. Additional works further explore pricing mechanisms and incentive structures [245,246,247,248,249]. Le et al. [250] introduced an integrated CS framework that balances matching, routing, and compensation across varying supply-demand scenarios. It presented four pricing models to help platforms maximize profits and user satisfaction.

7.6. Capacity, Quality, and Reliability

Dai et al. [251] addressed workforce planning in O2O logistics with in-house, part-time, and full-time CS drivers. Yildiz and Savelsbergh [252] assessed delivery dynamics on on-demand platforms, such as Uber Eats, providing insights into coverage, profitability, and service design. A key concern in CS is reliability. Buldeo Rai et al. [253] identified trust issues as a significant barrier to adoption. Devari et al. [254] proposed leveraging social networks to enable trusted deliveries, reduce emissions, and lower costs.

7.7. Efficiency vs Sustainability Trade-Off in Crowdshipping Logistics

CS flexibility can compromise sustainability. Gatta et al. [255] evaluated Rome’s crowdshipping via mass transit integration, projecting significant reductions in emissions and accidents. Qi et al. [256] assessed shared mobility for home delivery, highlighting cost savings but limited scalability. Ghaderi et al. [257] proposed a framework combining trajectory analytics with profit-optimized routing, achieving strong results across key metrics.
The OR techniques play a crucial role in resolving the challenges posed by integrating CS into sustainable LMD. From routing and pricing to capacity planning and real-time decision-making, OR-driven models can support reliable, cost-effective, and environmentally responsible crowdshipping systems [258]. Rolling horizon assignment with prediction (acceptance, detours) is practical and scales. Exact stochastic programs remain small. Reported performance depends on incentive design; pricing and matching should be evaluated jointly with routing. Other review works on CS concept in the literature are presented in [259,260,261,262,263,264,265,266].

8. Freight-on-Transit

The FOT is a novel logistics paradigm that integrates freight delivery with Public Transportation (PT) systems to transport passengers and goods simultaneously. This model leverages underutilized capacity in urban transit networks, such as buses, trams, and subways, to support LMD operations. By leveraging existing infrastructure, FOT seeks to reduce delivery costs, traffic congestion, and carbon emissions, contributing to more sustainable and efficient urban logistics.

8.1. Transit-Assisted Two-Tier Urban Delivery

One of the foundational investigations into FOT was conducted by Azcuy et al. [267], who proposed a two-tier system wherein PT routes serve as the primary freight corridors. Parcels are first delivered to strategically selected transfer points, also known as transit stops, after which secondary deliveries are made using smaller, potentially greener vehicles. The study focused on identifying optimal transfer locations using an MIP formulation and heuristic methods. The results demonstrated potential distance savings of up to 7.1 % , especially for deliveries over longer distances, with stringent deadlines, and customer clusters along the transit line. At the operational level, a recent EvoCOP study by [268] introduces a GA for the three-tier FOT problem (depot → PT stops → green last leg) and shows it attains near-optimal solutions on large instances where a compact MILP becomes intractable. City-level evidence from Zrenjanin (Serbia) [269] shows that integrating parcels on fixed-route buses can improve energy and environmental performance under realistic policy and energy-mix scenarios, providing impact validation for FOT concepts.

8.2. Integrated Public Transit with Emerging Technologies

Expanding on the FOT framework, Kızıl and Yıldız [270] introduced a comprehensive LMD model that integrates PT with several innovative delivery enablers: automated service points, CS, and zero-emission vehicles. This multifaceted system is designed for express urban deliveries. The authors employed a two-stage stochastic program to model uncertainties in delivery operations. They used a branch-and-price algorithm with a novel decomposition branching strategy, thereby improving computational tractability. Their solution reflects real-world delivery dynamics and underscores the feasibility of scalable, eco-friendly urban logistics via FOT. The FOT planning benefits from a TEN that encodes station nodes across discrete time layers. Arc sets represent in-vehicle travel, waiting, transfers, handling, and last-leg dispatch. Capacity on in-vehicle arcs enforces limited freight space on buses/trams; station buffers cap simultaneous parcel handling. Coupling with last-leg modes (e-bikes and foot couriers) is captured via synchronization arcs that respect departure times and service windows. Objective terms typically minimize total generalized cost (line usage, transfers, handling) and last-leg distance or energy, with optional penalties for missed delivery targets. Path-based CG outperforms monolithic flows on the TEN, especially when last-leg coupling is present; pricing subproblems yield feasible transit-plus-last-leg paths that satisfy resource constraints. Benders or logic-based Benders decompose siting or line-activation from operational assignments. Lagrangian relaxations of capacity or synchronization constraints yield tight bounds and good heuristics. In practice, these decompositions solve city-scale instances with minute-level time discretization, whereas exact single-block MILPs remain suitable for pilot corridors and scenario calibration.

8.3. Strategic Design of FOT Networks

Further developing the FOT concept, Delle Donne et al. [271] explored a strategic model that employs mass PT to move freight within cities through a sequence of nodes: parcels travel from central depots to “drop-in” stations on public lines, continue aboard PT to “drop-out” stations, and are finally delivered by green vehicles such as cargo bikes or foot couriers. The core research question was to determine which PT lines and stations should be included in the FOT system. Multiple mathematical formulations were proposed to capture the network design problem. To address them, the authors applied CG heuristics and conducted extensive computational experiments. Their results provided actionable insights into trade-offs between network configuration, operational efficiency, and environmental impact. Cheng et al. [272] presented a comprehensive review of integrated transportation systems that combine passenger and freight movement. Their study categorized practical integration models and mapped out the associated decision-making challenges across tactical, operational, and strategic levels. Topics such as vehicle routing, schedule synchronization, infrastructure requirements, and pricing policies were reviewed. The authors also discussed solution methodologies, highlighting the complexities and trade-offs inherent in implementing such systems. Their review positions FOT within a broader class of people-and-goods integration approaches and serves as a valuable reference for future research.
At the timetable/rolling-stock level, a recent study by [273] shows that integrating freight into an urban rail line via joint optimization of train schedules, rolling-stock rotations, and freight allocation can profitably add trips in off-peak periods, thereby reducing passenger travel times while carrying freight. PT co-modality can be planned on the timetable: a schedule-based parcel assignment model synchronizes deliveries with fixed-route, multi-line bus services and shows cost/emissions benefits from sharing spare capacity [274]. Modular co-modality can share vehicle capacity between passengers and freight: a study by [275] models a two-way corridor with time-dependent demand, using a MIP formulation and a two-stage algorithm to allocate modular units, thereby improving utilization while respecting timetables.
The FOT presents a compelling vision for sustainable LMD by optimizing the dual use of urban PT systems. The OR plays a central role in making this concept viable, offering methods to address key decisions such as transfer point selection, transit network design, resource allocation, and uncertainty modeling. As the body of work grows, from two-tier system optimizations to fully integrated, crowdshipping-supported frameworks, the feasibility and potential of FOT in modern urban logistics become increasingly tangible. Also, TENs are expressive but large. The CG and Benders-type decompositions scale better than monolithic MILPs. Operational viability hinges on station handling times; robustness to timetable perturbations should be shown. Review works on FOT include [272,276,277].

9. Combined Innovative Solutions

This section explores hybrid and integrative strategies that combine EVs, PLs, PPs, ADRs, CS, and FOT within sustainable LMD systems. These integrated models offer potential improvements in operational efficiency, environmental performance, and service quality.

9.1. Electric Vehicles and Autonomous Delivery Robots

Yu et al. [278] introduced a two-echelon LMD system in which each EV is equipped with a delivery robot, facilitating parcel distribution in restricted zones such as pedestrian areas and campuses. A key feature of the model was en-route charging, which enabled the van to recharge during robot deployment, optimizing downtime and enhancing delivery efficiency. The system was modeled as an MIP, incorporating a time-distance-energy trade-off due to battery constraints and energy transfer durations. To improve scalability, an ALNS algorithm and a linear-programming-based route evaluation were proposed. Sensitivity analysis revealed that optimizing charging strategies can significantly reduce total operational cost and travel time. Moradi et al. [279] proposed a new variant (REVRP-LPCP) that integrates EVs, SADRs, and PLs, assigning higher service priority (“prizes”) to Prime members and jointly optimizing EV routes, robot dispatch, and locker assignments to minimize total cost while ensuring Prime customers are served quickly. This model formulated delivery as an MILP complemented by a tailored metaheuristic, achieving up to 53 % lower EV route and utilization costs compared to EV-only systems. By prioritizing Prime customers and integrating robots, EVs, and lockers within a unified planning framework, it significantly enhances efficiency and service responsiveness while outperforming commercial solvers in large-scale benchmarks.

9.2. Parcel Lockers with Electric Vehicles

Pan et al. [280] developed a two-level hybrid model that integrates EVs and PLs. At the upper level, a minimum-cost Parcel Network Flow Problem (PNFP) determines the optimal positions for lockers and parcel flows. At the lower level, a Multi-Depot Capacitated VRP (MDCVRP) manages routing between depots, lockers, and customers. A hybrid GA combined with the Lin-Kernighan Heuristic (LKH) was used to optimize delivery flows and vehicle routes. Vukićević et al. [281] tackled the “covering delivery problem,” optimizing routes where an EV either directly delivers to customers or drops parcels at lockers. Charging stations could also serve as lockers. A MIP formulation and a VNS-based heuristic using a sequential-mixed Variable Neighborhood Descent (VND) approach were proposed to solve this problem efficiently. The results confirmed significant improvements in delivery time and energy consumption. Yu V.F. et al. [62] introduced an extension of the EVRP-TW and Partial Recharges (EVRPTW-PR), known as the EVRP-TW, Partial Recharges, and PL (EVRPTW-PR-PL). The focus was on minimizing delivery costs by using a fleet of EVs and offering two customer service options: home delivery and self-pickup via PLs. The paper presented a mathematical formulation for this problem and proposed an ALNS algorithm. Song et al. [282] assessed the environmental impact of delivery failures. They proposed two solutions: using smart lockers as collection points and replacing fuel vans with battery vans. VRP models were used to compare emissions, and results from a Beijing-based case study with 500 customers showed that CO2 emissions per parcel decreased significantly as the ratio of failed home deliveries increased, underscoring the environmental benefits of lockers. Boroujeni et al. [283] combined EV home deliveries with optional PL self-pickup while prioritizing high-value “Prime” customers to balance fast service and cost efficiency. The study proposes a MILP model and a tailored Large Neighborhood search (LNS) heuristic (with SA), achieving an average 24 % lower EV routing cost and a 22.5 % reduction in EV utilization cost compared to EV-only strategies, while ensuring prioritized delivery for Prime users. Recently, Yu and Anh [284] extended EVRPTW-PR by integrating covering locations-facilities that combine PLs (for optional customer self-pickup), and charging stations. The goal is to minimize total cost, including travel, fixed operational costs for EVs and active lockers, and customer compensation for self-pickup. To address this issue, the authors develop a MIP formulation and an effective VNS algorithm, enhanced with dynamic programming and set partitioning, that yield new best-known solutions and provide valuable managerial insights on balancing delivery options and cost trade-offs.

9.3. Parcel Lockers with Autonomous Delivery Robots

Schnieder et al. [285] proposed a decision-support model that integrates autonomous vehicles and lockers. The study analyzed real parcel delivery data from London and examined scenarios involving modular and fixed lockers, Road-based Autonomous Lockers (RALs), and different depot locations and fleet compositions. A routing and scheduling algorithm was employed, and findings revealed that modular lockers adjusted weekly offered the best results under moderate to high demand, while RALs were more efficient under low demand. Additionally, Moradi et al. [286] modeled an LMD system in which electric-powered delivery robots (i.e., SADRs) are deployed from trucks acting as mobile satellite depots, and customers can optionally be served via strategically placed PLs. The MILP model jointly optimizes truck routes, locker locations, and robot routes to minimize total cost, while a greedy heuristic effectively tackles larger instances. Sensitivity analysis provides managerial insights into when locker deployment and robot use drive cost-efficient, sustainable delivery operations.

9.4. Pick-Up Points with Autonomous Delivery Robots

Ulmer and Streng [287] developed a same-day delivery model combining PPs and ADRs. Their goal was to optimize real-time vehicle dispatch and goods loading. A Policy Function Approximation (PFA) method was proposed to balance the benefits of speed and consolidation. The study provided managerial insights into dispatch timing and resource allocation, offering a promising alternative to conventional delivery systems for e-commerce applications.

9.5. Crowdsourcing with Electric Vehicles

He and Csiszár [288] investigated integrating crowdsourced delivery into Mobility-as-a-Service (MaaS) using EVs to reduce emissions and energy consumption. The paper proposed a system-oriented approach, detailing functional models and information system architectures. Using numerical simulations and matching theory, the authors quantified the emission and energy savings per parcel. They highlighted potential scenarios where this embedded delivery system could replace traditional courier networks, particularly in densely populated urban environments.

9.6. Crowdsourcing with Parcel Lockers

Dos Santos et al. [289] introduced a novel two-echelon delivery model that combines PLs and OCs. In this model, lockers serve as both PPs and transshipment hubs. Couriers picking up their parcels can volunteer to deliver others’ parcels along their routes for compensation. The system includes fallback strategies to ensure service continuity in the event of OC no-shows. An MIP model encapsulated three delivery options: depot-to-locker, locker-to-home via professional fleet, and locker-to-home via OC. Computational results showed cost savings and reduced travel distance when OCs were used effectively. Similarly, Ghaderi et al. [290] proposed a crowdshipping framework in which strategically located PLs served as exchange points for both single and joint deliveries. A two-phase algorithm first identified task sets (single vs. joint) and then allocated deliveries among crowdshippers. Experiments with real-world data demonstrated strong performance, and large-scale simulations indicated that the joint delivery model could enhance success rates by up to 5 % , provided PLs were optimally positioned. A multi-criteria framework by [291] integrates automated smart lockers with capillary distribution and CS, articulating objectives for cost, distance/time, utilization, resilience, and sustainability, and embedding VRP-style delivery constraints. The PT-based CS, in which commuters move small parcels between APLs at metro stations, can save vehicle-km and emissions when spare PT capacity is utilized; a Rome case study by [255] quantifies the environmental and economic impacts and outlines the coordination needs. A study by [292] estimates the system effects of PT-based CS, showing that diverting a share of small parcels to commuters’ PT trips can reduce carrier CO2 and operating effort, with participation and station capacity emerging as key constraints.

9.7. Autonomous Delivery Robots and Freight-on-Transit

De Maio et al. [293] modeled the LMD where ADRs can ride scheduled PT to extend range and save battery, then continue on sidewalks/roads to serve multiple customers. Technically, the city’s PT network is time-expanded, so robot routes must synchronize with bus/metro departure and arrival times; ADRs board/exit using dedicated compartments (so passenger capacity is not the bottleneck), and the optimization minimizes total delivery cost under battery, capacity, and timing constraints. The authors design a destroy-and-repair LNS tailored to the PT timetable structure. On realistic Rome-style instances (up to 500 customers), the approach yields ≈ 7.5% lower cost than a traditional road-only benchmark, and the experiments indicate meaningful emissions reductions relative to both diesel and electric vans, thanks to shifting distance onto PT lines. A recent LRPVR study bases ADRs at selected public transport stations and co-optimizes van and robot routes via a two-step matheuristic (hybrid set-partitioning + location, then routing), showing notable cost and emission reductions versus van-only delivery on Rome-style instances [294].

9.8. Crowdsourcing with Freight-on-Transit

A recent report by [295] proposes a conceptual framework for integrating urban freight with PT and CS, highlighting capacity sharing, timetable coordination, station handling, and regulatory/liability considerations as key design issues before detailed OR modeling. Also, co-modality concepts explicitly integrate small freight with PT by leveraging passengers as ad hoc carriers. A recent work by [296] formalizes a crowd-sourced co-modality transportation system and outlines operational building blocks and expected cost/emissions benefits. A recent work by [297] defines the PT-based CS Problem (PTCP), combining a compact MILP (tightened by valid inequalities) with an ALNS; parcels are staged at PT stations, assigned to commuters along their regular trips, and undelivered items are covered by backup service. Experiments show that the heuristic scales well and that CS vs. backup cost parameters dominate system cost. The PT-based CS feasibility depends on commuters’ willingness to accept parcel tasks. A Latent Class (LC)-based study by [298] on Sydney PT passengers quantifies acceptance as a function of incentive, parcel weight, and detour, yielding segment-specific elasticities that can inform OR assignment and backup policies.

9.9. Crowdsourcing with Parcel Lockers and Freight-on-Transit

Early feasibility evidence for PT-based CS in Rome [299] shows promising willingness to participate and operational viability when parcels are exchanged at/near transit stations via PLs. The PT-based CS can exploit spare metro capacity by exchanging parcels via APLs at/near stations; Rome Stated Preference (SP) surveys in [300] quantified willingness to act as crowdshippers and to buy the service, and identified feasible design/compensation conditions. The PT-based CS can be operationalized by prioritizing spatially outlying parcels, matching them to PT passengers, and co-deciding the number/placement of PLs; a Singapore study by [301] reports up to 11 % of parcels diverted, with CO2, fleet-size, and nearly 20 % carrier cost reductions versus truck-only delivery. User acceptance of PT-based CS has been quantified through a stated-choice mixed-logit analysis of 524 passengers in Copenhagen [302], revealing who is likely to participate and the compensation/extra time trade-offs that should guide service and locker design. Passenger acceptance is pivotal for PT-based CS. A study by [303] shows that time availability/flexibility and physical condition are the primary factors driving participation decisions, with youth and riders familiar with PLs more inclined to participate.
In addition, the PL located on PT nodes can be optimized under a capital budget to enable PT-based CS. The study by [304] formalizes this problem and provides a facility-location baseline for PT-locker designs. A Copenhagen case study by [305] combines budgeted PL siting with a downstream carrier VRP to evaluate PT-based CS. Its results show reductions in vans and driver hours, with crowdshipper availability as the key bottleneck. PT-based CS can relay parcels among PLs at PT stations, with multi-hop handoffs via commuting crowdshippers. The study by [306] shows that allowing handovers outperforms single-carrier paths and offers better robustness to delays while balancing stakeholder objectives. Mixed-methods evidence on PT-based PL-CS studied by [307] highlights demographic drivers of participation and operational bottlenecks (e.g., station crowding, liability), providing levers that complement OR models for locker siting and task matching. City-scale microsimulation for a Greek mid-sized city by [308] indicates that PT-based CS with lockers can mitigate last-mile impacts, with outcomes sensitive to participation rates and locker siting. Operationalizing PT-based CS with lockers at stations can be modeled via a probabilistic optimization that embeds passenger task-acceptance behavior, enabling realistic parcel-to-commuter allocation on transit networks [309].
Integrating EVs, ADRs, PLs, and CS provides a multifaceted approach to sustainable ground-based LMD. These hybrid systems address urban delivery challenges by combining flexibility, scalability, and environmental responsibility. The OR models—ranging from MIP to ALNS, GA, and PFA—enable optimized decisions for routing, energy use, facility location, and task assignment. The synergy between these technologies reveals promising paths for designing future-ready, green delivery ecosystems.

10. Comparative Analysis and Practice Insights

At first, this section synthesizes method-level insights across innovations. We compare dominant OR techniques in terms of benefits, drawbacks, scalability, and performance under practical limitations, including time windows, energy and charging dynamics, synchronization between assets (e.g., EVs and robots), stochastic travel times, and data availability. The goal is to guide method selection for a given problem structure and deployment constraints. As presented in Table 3, the decomposition and matheuristics are consistently effective when models include energy or synchronization constraints, offering near-optimality with practical runtimes. (Meta-)Heuristics improve initialization and acceptance prediction in CS and dynamic tours, but they require careful validation under distribution shifts. Also, exact methods remain valuable for calibration, benchmarking, and small-to-medium strategic instances (e.g., siting and limited charging layouts). Finally, realistic evaluation benefits from reporting seeds, time budgets, and convergence diagnostics to contextualize performance claims. Also, according to this table, method choice is driven less by the “innovation” itself than by the constraint structure. When synchronization and multi-resource coupling (e.g., truck-robot timing and locker capacities) are present, decomposition and matheuristics consistently outperform monolithic exact solves at scale. Nonlinear charging and SoC-dependent energy models favor tailored neighborhoods and set-partitioning over single-shot MILPs; exact methods remain valuable for calibration and policy sensitivity on reduced instances. Dynamic and stochastic regimes (crowd acceptance and transit perturbations) benefit from rolling-horizon optimization with prediction, where data are scarce, robust, or two-stage formulations prevent overfitting. In hybrid systems, combining ALNS/VNS with Benders’ decomposition or CG yields city-scale solutions within practical time budgets, while retaining clear levers for managerial trade-offs.
Moreover, this section consolidates real-world implementations and data-driven case studies referenced throughout the review. Each snapshot lists the setting, geography/scale, salient design elements, reported outcomes, and sources. Table 4 consolidates real deployments and data-driven case studies cited throughout the review. To clarify evidence types, we tag each snapshot as [obs.] (observed/operational data), [pilot] (pilot trials or limited rollouts), or [proj.] (model-based projections from empirical inputs). “Design/constraints” surface the key operational levers (e.g., charging policy, station handling, clerk capacity), while “Reported outcomes” summarize the measured or projected effects consistent with the sources. According to this table, we observed that (i) PL and PP deployments deliver consistent consolidation benefits when siting considers walking accessibility and operating hours; (ii) ADR + locker hybrids benefit from modular capacity and conservative handling times; (iii) crowdshipping performance hinges on incentive design and acceptance prediction, with relay points amplifying gains; (iv) FOT is most promising on high-frequency corridors with realistic station handling and small freight quotas; (v) EV operations are improved by partial charging policies and charger-route co-design.

Critical Synthesis and Recommendations

Across innovations, the dominant driver of method choice is the underlying constraint structure rather than the innovation’s label. Problems that combine synchronization between resources (e.g., truck-robot launch and retrieval, or transit-last-leg handoffs) with energy and charging dynamics consistently favor decomposition and matheuristics over monolithic exact solutions at scale. Exact MILPs remain valuable for calibration and policy sensitivity on smaller or simplified instances. Still, city-scale planning with rich constraints is more reliably handled by ALNS/VNS/ILS and path-based or Benders-type decompositions (see Table 3). Ensuring resilience requires modeling uncertainty explicitly. At the operational layer, rolling-horizon control supported by prediction (e.g., expected arrival times, acceptance probabilities) improves robustness to day-to-day variability. At both tactical and strategic levels, two-stage stochastic and robust formulations mitigate tail risk in lateness and missed deliveries, particularly when timetables, handling times, or acceptance behavior are volatile (see Table 1). Also, evaluation practices significantly influence conclusions. Reporting random seeds, time budgets, convergence diagnostics, and percentile-based service metrics prevents over-optimistic claims and facilitates replication across datasets.
Furthermore, hybrid systems provide meaningful synergy but introduce orchestration complexity. Designs that combine EVs, ADRs, lockers or PPs, CS, and FOT benefit from flexible hand-offs and the ability to shift curb time to unattended facilities. However, these gains are coupled with siting, routing, and synchronization decisions, and increase data and parameter requirements. In practice, decomposition combined with learning-assisted heuristics scales well while retaining clear managerial levers. Finally, equity and access should be treated as first-class objectives. Locker and PP siting with walking-distance coverage constraints measurably affect emissions, failure rates, and user experience, and sequential “site-then-route” planning can underperform joint formulations in dense districts.
For city-scale EV routing with non-linear or SoC-dependent charging, energy-aware ALNS/VNS/ILS are generally preferable, with exact MILPs used for calibration on reduced instances. For truck-ADR or ADR-locker synchronization, logic-based or Benders-style decomposition, paired with heuristic routing, is effective at the tactical level. In contrast, rolling-horizon dispatch supports real-time operations. For locker/PP systems that jointly choose sites and routes, especially when equity constraints are present, two-phase approaches (exact siting followed by heuristic tours) or CG path models deliver good performance, and robust variants are advisable when opening hours or compartment availability are uncertain. For CS under acceptance uncertainty, rolling-horizon assignment augmented with prediction of acceptance or expected arrival times is practical and should be evaluated jointly with pricing and routing policies. For FOT with timetable drift, TEN models solved by CG work well in combination with explicit station-handling constraints and passenger-first quotas. To facilitate comparability across studies, we recommend publishing instance specifications (including size and spatial density), solver time limits, random seeds, and hardware details; reporting means and percentiles for service quality (on-time rate, lateness) and for energy/emissions (kWh, CO2); and, when learning components are used, documenting the training-data horizon and monitoring distribution shift between training and evaluation periods. These synthesized insights complement the practice snapshots in Table 4 and the goal-technique mapping in Table 1, positioning the review as a reference for method selection and deployment.

11. Discussion and Future Directions

In the previous sections, the collected papers were reviewed and analyzed with respect to innovative solutions, problems, sub-problems, and OR-based solution techniques. After reviewing and analyzing the relevant papers and contributions, the research gaps and suggestions for future studies are presented below. The suggestions for future studies can be divided into three directions: (I) novel, combined, innovative solutions; (II) new sub-problems and variants; (III) state-of-the-art solution methodologies.

11.1. Introducing Novel Combined Innovative Solutions

The existing literature reveals a notable gap in research focused on integrated innovative solutions for LMD. For instance, a research direction in this field involves integrating EVs with ADRs, a transformative approach that can significantly impact the sustainability of LMD operations. However, it also raises essential safety and privacy considerations that must be carefully addressed. In this innovative concept, EVs, including e-vans, e-trucks, and e-cars, serve as a “mothership van." These EVs are tasked with transporting goods and releasing SADRs (sidewalk-based robots) for the LMD process, serving customers who may be difficult for larger EVs to reach. This symbiotic relationship between EVs and ADRs holds immense promise, particularly in densely populated urban areas where maneuvering e-trucks or e-vans can be challenging. However, successful implementation requires meticulous infrastructure planning, particularly for establishing CSs to recharge EVs. Ensuring a reliable network of CSs is critical to maintaining the efficiency and effectiveness of the EV-ADR delivery system. Another crucial aspect is the synchronization and scheduling of operations within this combined EV-ADR system. Coordinating the movements and tasks of EVs and ADRs to optimize delivery efficiency while minimizing delays is a complex, multifaceted challenge. Advanced OR algorithms and decision-making techniques are essential to achieving this synchronization, ensuring that products reach their intended recipients on time.
Furthermore, an emerging and promising avenue for future research is the integration of RADRs and SADRs in urban LMD systems. These ground-based innovations offer high flexibility and can help reduce environmental footprints by operating on electricity and navigating through urban roadways and sidewalks. However, from an OR standpoint, their joint deployment introduces complex optimization challenges. A key issue is the strategic placement and selection of charging stations tailored to the heterogeneous mobility patterns and energy requirements of RADRs and SADRs, especially in dense urban environments with limited infrastructure. Moreover, ensuring the safety and compliance of these robots with traffic regulations, pedestrian flows, and dynamic road conditions remains a critical concern. Routing problems become significantly more complicated due to the need to coordinate two robot types with different speed profiles, operational zones, and interaction constraints. Future research on OR should develop integrated mathematical models and algorithms that address these challenges under realistic urban conditions, considering stochastic travel times, battery constraints, collision avoidance, and service time windows. Simulation optimization frameworks and multi-agent systems can play a vital role in analyzing such hybrid deployments, providing insights into their feasibility, efficiency, and robustness in real-world city logistics.
Moreover, another promising research direction involves integrating SADRs with the emerging FOT paradigm. FOT leverages the unused capacity of PT systems, such as buses, subways, and trams, to carry freight alongside passengers, offering a cost-effective and environmentally friendly approach to urban logistics. Pairing SADRs with FOT can enable a two-tier LMD system, in which goods are transported via transit networks to intermediate drop-off points (e.g., transit hubs or stations), from which SADRs deliver to doorsteps. However, this hybrid model introduces a range of optimization challenges from an OR perspective. Key concerns include synchronizing SADR dispatch schedules with transit vehicle arrivals, selecting optimal transfer hubs, and coordinating robot routing under spatial and temporal constraints. Also, real-time variability in transit schedules, passenger flows, and sidewalk accessibility can introduce stochastic elements into the problem. Developing robust mathematical models and solution methods, such as TEN formulations, stochastic programming, and agent-based simulations, will be essential for assessing the feasibility and efficiency of SADR-FOT systems. This integration has the potential to reduce urban delivery costs and emissions significantly, but it demands innovative OR tools to address operational complexities and ensure service reliability.
In addition, an innovative approach to modernizing parcel delivery is the hybrid PL-FOT system, which increases the speed and efficiency of product delivery to end customers. This pioneering concept envisions using buses or trams to transport parcels from depots to strategically designated PLs, where customers can conveniently pick up their orders. Since PLs operate as 24/7 access points, there are no restrictions on when orders can be placed inside them. This convenience ensures that customers can collect their parcels at their preferred time, accommodating their busy schedules. However, for same-day delivery services, a more intricate level of planning and coordination is essential. This includes synchronizing the arrival times of buses or trams at the PLs with customers’ expected arrival times. Achieving this synchronization ensures that parcels are ready for pickup when customers arrive, optimizing the overall process and meeting the demands of time-sensitive deliveries. Another complex aspect of this hybrid solution is routing public vehicles to PLs near customers. This entails dynamic routing algorithms that consider real-time traffic conditions, the location of PLs, and the destinations of individual customers. Effective routing ensures that deliveries are both timely and efficient, reducing unnecessary travel and optimizing resource allocation.
Another novel concept is the hybrid EV-ADR-PL system, which combines EVs, ADRs, and PLs. This approach is particularly beneficial in densely populated urban areas, where customers prefer the convenience of picking up their orders from a parcel point, such as a PL. In such urban environments, the EVs serve as the backbone of the delivery fleet, transporting parcels to strategically located PLs. Meanwhile, ADRs complement this system by handling the final mile, autonomously navigating sidewalks and public spaces to reach customers or PLs efficiently. The synergy among EVs, ADRs, and PLs ensures prompt, accessible deliveries that cater to the specific demands of urban customers.
Finally, integrating CS concepts into any hybrid delivery system, such as EV-SADR, PL-FOT, or EV-PL, holds immense potential to deliver an efficient, highly effective solution for LMD. This collaboration streamlines logistics, optimizing parcel flow and enhancing delivery efficiency. Moreover, when sustainable solutions such as EVs and ADRs are incorporated into PL or CS systems, they improve air and environmental quality, aligning with eco-friendly initiatives. However, a pivotal challenge is pricing and incentive strategies to encourage customer participation in CS-aided EV-PL or EV-ADR-PL systems. Convincing customers to adopt these innovative approaches may require carefully designed incentives and pricing models, posing a complex decision problem. As a result, researchers and practitioners are encouraged to explore various combinations of innovative solutions, such as EV-PL-CS, EV-ADR-PL-CS, EV-ADR-PL-CS-FOT, or other integrated LMD systems. These proposals offer versatility in addressing diverse delivery needs and urban environments. However, striking the right balance between operational costs and environmental considerations remains a critical aspect of these decisions. Despite the undeniable benefits of these efficient and sustainable hybrid solutions, it is essential to acknowledge that their complexity escalates as more innovative components are integrated. This complexity challenges researchers in OR to develop sophisticated algorithms and decision-making frameworks that can accommodate the intricacies of these integrated systems. Nevertheless, pursuing these solutions represents a promising path forward for LMD’s evolution, offering both operational efficiency and environmental responsibility.

11.2. Extending New Sub-Problems and Variants

Another future research direction could be to build models that incorporate scenarios and parameters closely resembling the actual conditions encountered by EVs, ADRs, PLs, and FOT. The problems addressed should focus on practical setups and limitations, particularly concerning factors such as expenses, battery longevity (for EVs and SADR), and operational distances. This encompasses considerations such as permitted and off-limits driving areas, diverse safety considerations, and pedestrian pathways designated in the case of SADR applications. To develop more practical routing models that integrate innovative LMD approaches, it is essential to account for uncertainties in dynamic customer demand, order handling, and vehicle travel. These models should mirror real-world scenarios in which the number and type of customer orders remain uncertain over a given timeframe. Addressing strategies for managing such orders, such as day-to-day ordering or aggregating orders over a rolling timetable, presents an intriguing challenge for future research.
Furthermore, other uncertainties in this context include demand patterns, crowd availability in CS, and parcel loading and unloading. These operations must be factored into models of parcel delivery challenges for emerging delivery methods. This is especially crucial as parcel unloading is not always straightforward, and there may be unsuitable locations for EV or ADRs to complete their deliveries. Confronting these variables and assessing their impacts on the overall delivery process represents another engaging research challenge. Furthermore, researchers should consider how various weather conditions, such as rain, dust, and stormy weather, can significantly disrupt the routing and performance of robots.
In summary, future research in the field of LMD should adopt a holistic approach that considers the unique challenges and uncertainties associated with various delivery modes, real-world operational constraints, and environmental factors, ultimately leading to more effective and resilient delivery systems.

11.3. Developing State-of-the-Art Methodologies

A key future research direction in sustainable LMD is advancing data-driven OR models that integrate real-world information into decision-making processes. The increasing availability of granular data—such as GPS trajectories, delivery timestamps, customer preferences, and urban traffic flows—enables researchers to build more accurate and responsive optimization models. These models can capture dynamic urban conditions and customer behavior, enabling logistics systems to adapt in real time. For instance, delivery route optimization for EVs or SADRs can be enhanced by incorporating real-time energy consumption data, weather conditions, and congestion patterns. Data-driven approaches also support demand forecasting, time-window estimation, and customer clustering, all of which are vital inputs to OR models for vehicle routing, fleet composition, and delivery scheduling.
Another promising methodology is stochastic programming, which is well-suited for handling the uncertainty and variability inherent in LMD operations. Unlike deterministic models, stochastic OR models can incorporate uncertain travel times, variable customer demand, unpredictable traffic conditions, and energy consumption variability, especially critical for EVs and autonomous robots with limited range. Two-stage or multi-stage stochastic programs can be used to develop robust delivery schedules and charging strategies, in which first-stage decisions (e.g., vehicle routing) are made before uncertainty is realized. Second-stage choices (e.g., rerouting or charging adjustments) are made afterward. This approach ensures more reliable and cost-effective operations in complex urban environments.
Simulation-based optimization also holds strong potential for evaluating and improving LMD systems that involve multiple interacting components such as lockers, transit networks, and autonomous delivery agents. When analytical models become intractable due to the scale or heterogeneity of the system, discrete-event or agent-based simulation can help capture the temporal evolution of delivery processes and urban dynamics. These simulations can be coupled with metaheuristics, reinforcement learning, or scenario-based analysis to test routing strategies, charging policies, and infrastructure placement across various urban layouts and customer behavior patterns. Simulation-based methods are beneficial for evaluating the performance of hybrid systems, such as SADR + FOT or EV + robot-assisted delivery, under stochastic and dynamic conditions.
In recent years, ML tools have become increasingly valuable in complementing OR methods for LMD. ML can be employed to predict delivery demand, estimate travel time under uncertain traffic conditions, detect delivery failures, or recommend locker locations based on historical usage patterns. Supervised learning models, such as gradient boosting or neural networks, can forecast customer time windows or charging demand, which is then fed into optimization models. Reinforcement learning can be applied to learn dynamic delivery and routing policies in evolving urban networks. Furthermore, ML-based surrogates can replace time-consuming simulations or solve large-scale optimization problems faster, facilitating real-time decision-making. Integration of ML with OR—often referred to as “predict-then-optimize” frameworks—can enhance the responsiveness and intelligence of sustainable urban logistics systems.
Lastly, hybrid approaches combining mathematical programming, heuristics, simulation, and learning-based techniques offer a comprehensive direction for future research. Realistic LMD problems often involve a blend of discrete decisions (e.g., routing and vehicle assignment), continuous decisions (e.g., energy consumption), and dynamic events (e.g., unexpected road closures or customer unavailability). Hybrid models can exploit the strengths of each methodology; for example, using MILP for core routing structures, simulation for evaluating dynamic responses, and ML to predict uncertain inputs. Such integrated frameworks will be key to designing, optimizing, and operating sustainable, ground-based last-mile systems that are not only efficient and robust but also adaptable to the complexities of real-world urban environments.
Practical implications. For implementation, we recommend a constraint-first pathway: (i) diagnose the dominant constraint structure (energy/charging, synchronization, timetable drift, equity) for the target city or corridor; (ii) select technique classes accordingly using the goal-technique framework (Section 2.7, Table 1) and the comparative summary (Table 3); (iii) adopt the reporting checklist to ensure comparable evaluation across pilots (Section 10); and (iv) prototype on a limited district or line before scaling. Typical “quick wins” include partial-charging policies for EV fleets, modular capacity adjustments for lockers, and rolling-horizon dispatch for ADR/crowd systems. This path translates the review’s synthesis into deployable steps for both municipal planners and parcel operators.

12. Conclusions

This systematic review synthesizes sustainable, ground-based Last-Mile Delivery (LMD) from an Operations Research (OR) perspective, linking problem structures to technique classes and to sustainability goals (people-planet-profit) with resilience as a cross-cutting property. It integrates evidence across EVs, ADRs, PLs, PPs, CS, and FOT, and it analyzes hybrid designs that couple these innovations. Our answer to RQ1 (challenges of employing sustainable innovations in LMD from an OR perspective) is that across modes, the dominant challenges are: (i) synchronization of multi-resource operations (e.g., truck-robot launch/retrieval, transit timetables and last legs); (ii) energy/charging dynamics (state of charge, partial/nonlinear charging, charger capacity/queues); (iii) joint siting-routing couplings (e.g., PLs/PPs with equity and walking bounds); (iv) uncertainty in demand, travel/handling times, and crowd acceptance; (v) scalability of rich formulations; and (vi) measurement of sustainability beyond GHGs (equity, noise, curb dwell, reliability). These cut across innovations and motivate decomposition, stochastic/robust modeling, and learning-assisted control (explained previously in Section 3, Section 4, Section 5, Section 6, Section 7, Section 8 and Section 10).
Moreover, our answer to RQ2 (effective OR methods for sustainable ground-based LMD and their characteristics) is that method choice is driven by constraint structure. Energy-aware ALNS/VNS/ILS and path/decomposition schemes are effective for EV routing with charging; logic-/Benders-based decomposition with heuristic routing and rolling-horizon dispatch works for truck-ADR and ADR-locker synchronization; two-phase or CG models handle PL/PP siting–routing with equity constraints; rolling-horizon and prediction addresses crowd acceptance uncertainty; and time-expanded networks with CG fit FOT under timetable drift (previously shown in Table 3 and Section 2.7 and Section 10). Key characteristics include scalability (minutes to hours on city-scale instances), interpretability of levers, and compatibility with multi-objective or ϵ -constraint formulations to balance cost, emissions/energy, service, and equity. Also, we answered RQ3 (research directions and gaps) by showing the priorities, which include (i) hybrid/combined designs (e.g., EV+ADR+PL/PP/CS/FOT) with explicit orchestration of hand-offs; (ii) uncertainty-aware models (stochastic/robust) for lateness, charger queues, and acceptance; (iii) data-driven demand/acceptance prediction embedded in optimization; (iv) equity and access as first-class constraints in siting and routing; and (v) transparent evaluation via shared benchmarks, percentile service metrics, and reproducible reporting (described previously in Section 11).
Contributions and beneficiaries. For academics, we provide a goal-technique conceptual framework (Section 2.7), comparative algorithmic guidance (Table 3), and a PRISMA-style synthesis (Figure 2) to structure future research. For parcel carriers and platform providers, we offer guidance on method selection, tied to operational levers (partial charging, curb-time shifting to lockers, rolling-horizon dispatch) and risk-aware objectives. For municipalities and transit agencies, the review clarifies when FOT and ADR hybrids are feasible and how equity constraints (such as coverage/walking bounds) affect siting and routing. For locker/charging planners and software vendors, it identifies joint siting-routing patterns and decomposition schemes that scale across city instances. The practice snapshots (Table 4) and the reporting checklist (Section 10) translate findings into deployable steps and comparable evaluation.
We focus on ground-based LMD (2010–2025) articles; aerial systems and reverse logistics are out of scope. We conclude that by aligning OR technique classes with people–planet-profit objectives and synthesizing cross-cutting constraints common to EVs, ADRs, lockers/PPs, CS, and FOT, this review provides both a conceptual and practical reference for designing scalable, resilient, and sustainable last-mile systems. Future research in the field of LMD should take a comprehensive approach that considers the unique challenges and uncertainties associated with different delivery modes, real-world operational constraints, and environmental factors. This will contribute to the development of more effective and resilient delivery systems. Additionally, the integration of matheuristic and ML-based methodologies has transformed LMD optimization. Data-driven models and ML tools can enhance adaptability and responsiveness, while stochastic programming and simulation-based methods provide robust solutions in the face of real-world variability. The synergy of these techniques, particularly in hybrid frameworks, holds great promise for optimizing innovative ground-based delivery systems. Future research should focus on leveraging these methodologies to develop scalable, intelligent, and resilient logistics solutions that align with urban sustainability goals. To advance LMD operations, it is crucial to continue exploring integrated, innovative solutions (such as EV, ADR, PL, CS, and FOT) and to adopt a holistic perspective.

Author Contributions

Conceptualization, N.M., F.M. and C.W.; methodology, N.M.; software, N.M.; validation, N.M., F.M. and C.W.; formal analysis, N.M.; investigation, N.M., F.M. and C.W.; resources, N.M.; data curation, N.M.; writing—original draft preparation, N.M.; writing—review and editing, N.M., F.M. and C.W.; visualization, N.M.; supervision, F.M. and C.W.; project administration, F.M. and C.W. All authors have read and agreed to the published version of the manuscript.

Funding

This research was supported through funding from the Gina Cody School of Engineering and Computer Science at Concordia University and the Natural Sciences and Engineering Council of Canada (NSERC), grant number # RGPIN-2019-07086.

Data Availability Statement

Data are available upon request.

Acknowledgments

The authors thank the associate editor and anonymous reviewers for valuable comments and suggestions throughout the paper’s review process. Parts of the text in this manuscript were refined using ChatGPT (version GPT-5) (OpenAI) for paraphrasing and correcting grammatical errors. The authors reviewed and approved all AI-generated suggestions to ensure accuracy and compliance with the intended meaning. The authors have reviewed and edited the output and take full responsibility for the content of this publication.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Mangiaracina, R.; Perego, A.; Seghezzi, A.; Tumino, A. Innovative solutions to increase last-mile delivery efficiency in B2C e-commerce: A literature review. Int. J. Phys. Distrib. Logist. Manag. 2019, 49, 901–920. [Google Scholar] [CrossRef]
  2. Mannix, G. What Is Last Mile Delivery? 2025. Available online: https://nshift.com/blog/what-is-last-mile-delivery (accessed on 15 September 2025).
  3. Reports, V. Autonomous Last-Mile Delivery Market Size Is Projected to Reach USD 84.72 Billion by 2030 at CAGR 24.4%, 2021. Available online: https://www.prnewswire.com/news-releases/autonomous-last-mile-delivery-market-size-is-projected-to-reach-usd-84-72-billion-by-2030-at-cagr-24-4--valuates-reports-301211706.html (accessed on 15 September 2025).
  4. Flashbox.co. 6 Stats Highlighting Importance of Last-Mile Delivery in E-Commerce. 2022. Available online: https://flashbox.co/blog/business/6-stats-highlighting-importance-of-last-mile-delivery-in-e-commerce/ (accessed on 15 September 2025).
  5. Dell’Amico, M.; Hadjidimitriou, S. Innovative logistics model and containers solution for efficient last mile delivery. Procedia-Soc. Behav. Sci. 2012, 48, 1505–1514. [Google Scholar] [CrossRef]
  6. Boysen, N.; Fedtke, S.; Schwerdfeger, S. Last-mile delivery concepts: A survey from an operational research perspective. Or Spectr. 2021, 43, 1–58. [Google Scholar] [CrossRef]
  7. Moradi, N.; Wang, C.; Mafakheri, F. Urban air mobility for last-mile transportation: A review. Vehicles 2024, 6, 1383–1414. [Google Scholar] [CrossRef]
  8. Deloison, T.; Hannon, E.; Huber, A.; Heid, B.; Klink, C.; Sahay, R.; Wolff, C. The Future of the Last-Mile Ecosystem; World Economic Forum: Geneva, Switzerland, 2020. [Google Scholar]
  9. European Environment Agency. New Registrations of Electric Vehicles in Europe, 2024. Available online: https://www.eea.europa.eu/en/analysis (accessed on 15 September 2025).
  10. International Energy Agency. Global EV Outlook 2024. Available online: https://iea.blob.core.windows.net/assets/a9e3544b-0b12-4e15-b407-65f5c8ce1b5f/GlobalEVOutlook2024.pdf (accessed on 15 September 2025).
  11. Accenture.com. The Sustainable Last Mile. Faster. Cheaper. Greener, 2021. Available online: https://www.accenture.com/content/dam/accenture/final/a-com-migration/r3-3/pdf/pdf-148/accenture-sustainable-mile-pov.pdf (accessed on 15 September 2025).
  12. Mohammad, W.A.; Nazih Diab, Y.; Elomri, A.; Triki, C. Innovative solutions in last mile delivery: Concepts, practices, challenges, and future directions. Supply Chain. Forum Int. J. 2023, 24, 151–169. [Google Scholar] [CrossRef]
  13. Research, T. The Thriving Market for Electric Vehicles in Last Mile Delivery, 2023. Available online: https://blog.marketresearch.com/the-thriving-market-for-electric-vehicles-in-last-mile-delivery (accessed on 15 September 2025).
  14. Straight, B. Small, Cute and Nimble: Last-Mile Robots Could Soon Become a Delivery Force, 2022. Available online: https://www.freightwaves.com/news/abi-research-outlook-for-robot-last-mile-delivery-market (accessed on 15 September 2025).
  15. Iwan, S.; Kijewska, K.; Lemke, J. Analysis of parcel lockers’ efficiency as the last mile delivery solution–The results of the research in Poland. Transp. Res. Procedia 2016, 12, 644–655. [Google Scholar] [CrossRef]
  16. Olsson, J.; Hellström, D.; Pålsson, H. Framework of last mile logistics research: A systematic review of the literature. Sustainability 2019, 11, 7131. [Google Scholar] [CrossRef]
  17. Bosona, T. Urban freight last mile logistics—Challenges and opportunities to improve sustainability: A literature review. Sustainability 2020, 12, 8769. [Google Scholar] [CrossRef]
  18. Viu-Roig, M.; Alvarez-Palau, E.J. The impact of E-Commerce-related last-mile logistics on cities: A systematic literature review. Sustainability 2020, 12, 6492. [Google Scholar] [CrossRef]
  19. Taniguchi, E.; Thompson, R.G.; Qureshi, A.G. Modelling city logistics using recent innovative technologies. Transp. Res. Procedia 2020, 46, 3–12. [Google Scholar] [CrossRef]
  20. Silva, V.; Amaral, A.; Fontes, T. Sustainable urban last-mile logistics: A systematic literature review. Sustainability 2023, 15, 2285. [Google Scholar] [CrossRef]
  21. Laporte, G. The vehicle routing problem: An overview of exact and approximate algorithms. Eur. J. Oper. Res. 1992, 59, 345–358. [Google Scholar] [CrossRef]
  22. Toth, P.; Vigo, D. The Vehicle Routing Problem; SIAM: Philadelphia, PA, USA, 2002. [Google Scholar]
  23. Braekers, K.; Ramaekers, K.; Van Nieuwenhuyse, I. The vehicle routing problem: State of the art classification and review. Comput. Ind. Eng. 2016, 99, 300–313. [Google Scholar] [CrossRef]
  24. Matai, R.; Singh, S.P.; Mittal, M.L. Traveling salesman problem: An overview of applications, formulations, and solution approaches. Travel. Salesm. Probl. Theory Appl. 2010, 1, 1–25. [Google Scholar]
  25. Merkert, R.; Bliemer, M.C.; Fayyaz, M. Consumer preferences for innovative and traditional last-mile parcel delivery. Int. J. Phys. Distrib. Logist. Manag. 2022, 52, 261–284. [Google Scholar] [CrossRef]
  26. Ha, N.T.; Akbari, M.; Au, B. Last mile delivery in logistics and supply chain management: A bibliometric analysis and future directions. Benchmarking Int. J. 2023, 30, 1137–1170. [Google Scholar] [CrossRef]
  27. Kiba-Janiak, M.; Marcinkowski, J.; Jagoda, A.; Skowrońska, A. Sustainable last mile delivery on e-commerce market in cities from the perspective of various stakeholders. Literature review. Sustain. Cities Soc. 2021, 71, 102984. [Google Scholar] [CrossRef]
  28. Mucowska, M. Trends of environmentally sustainable solutions of urban last-mile deliveries on the e-commerce market—A literature review. Sustainability 2021, 13, 5894. [Google Scholar] [CrossRef]
  29. Lauenstein, S.; Schank, C. Design of a sustainable last mile in urban logistics—A systematic literature review. Sustainability 2022, 14, 5501. [Google Scholar] [CrossRef]
  30. Cano, J.A.; Londoño-Pineda, A.; Rodas, C. Sustainable logistics for e-commerce: A literature review and bibliometric analysis. Sustainability 2022, 14, 12247. [Google Scholar] [CrossRef]
  31. Bertolini, M.; De Matteis, G.; Nava, A. Sustainable last-mile logistics in economics studies: A systematic literature review. Sustainability 2024, 16, 1205. [Google Scholar] [CrossRef]
  32. Corti, L. Alternative and Innovative Models of Last-Mile Delivery: A Systematic Literature Review. Master’s Thesis, Politecnico di Milano, Milano, Italy, 2021. Available online: https://www.politesi.polimi.it/retrieve/665b2935-cde8-43b7-b428-22c2e1ccc7b6/2022_09_CORTI.pdf (accessed on 15 September 2025).
  33. Sorooshian, S.; Khademi Sharifabad, S.; Parsaee, M.; Afshari, A.R. Toward a modern last-mile delivery: Consequences and obstacles of intelligent technology. Appl. Syst. Innov. 2022, 5, 82. [Google Scholar] [CrossRef]
  34. Lyons, T.; McDonald, N.C. Last-mile strategies for urban freight delivery: A systematic review. Transp. Res. Rec. 2023, 2677, 1141–1156. [Google Scholar] [CrossRef]
  35. Kaspi, M.; Raviv, T.; Ulmer, M.W. Directions for future research on urban mobility and city logistics. Networks 2022, 79, 253–263. [Google Scholar] [CrossRef]
  36. Shuaibu, A.S.; Mahmoud, A.S.; Sheltami, T.R. A Review of Last-Mile Delivery Optimization: Strategies, Technologies, Drone Integration, and Future Trends. Drones 2025, 9, 158. [Google Scholar] [CrossRef]
  37. Maldonado Bonilla, M.A.; Bouzon, M.; Peña-Montoya, C.C. Taxonomy of key practices for a sustainable Last-Mile logistics network in E-Retail: A comprehensive literature review. Clean. Logist. Supply Chain. 2024, 11, 100149. [Google Scholar] [CrossRef]
  38. Alverhed, E.; Hellgren, S.; Isaksson, H.; Olsson, L.; Palmqvist, H.; Flodén, J. Autonomous last-mile delivery robots: A literature review. Eur. Transp. Res. Rev. 2024, 16, 4. [Google Scholar] [CrossRef]
  39. Liu, S.; Hassini, E. Freight last mile delivery: A literature review. Transp. Plan. Technol. 2024, 47, 323–369. [Google Scholar] [CrossRef]
  40. Nogueira, G.P.M.; Silva, S.V.; Hasenclever, L.; Rangel, J.J.d.A. Sustainability in B2C e-commerce: A literature review and future research opportunities in last-mile deliveries. Environ. Dev. Sustain. 2024, 27, 12415–12436. [Google Scholar] [CrossRef]
  41. Fisk, P. People Planet Profit: How to Embrace Sustainability for Innovation and Business Growth; Kogan Page Publishers: London, UK, 2010. [Google Scholar]
  42. Molina, A.; Rajagopal. People, Planet, and Profit: Crossing the Triple Bottom Line. In Challenge-Based Learning, Research, and Innovation: Leveraging Industry, Government, and Society; Springer: Berlin/Heidelberg, Germany, 2023; pp. 35–65. [Google Scholar]
  43. Durach, C.F.; Kembro, J.; Wieland, A. A new paradigm for systematic literature reviews in supply chain management. J. Supply Chain. Manag. 2017, 53, 67–85. [Google Scholar] [CrossRef]
  44. Page, M.J.; McKenzie, J.E.; Bossuyt, P.M.; Boutron, I.; Hoffmann, T.C.; Mulrow, C.D.; Shamseer, L.; Tetzlaff, J.M.; Akl, E.A.; Brennan, S.E.; et al. The PRISMA 2020 statement: An updated guideline for reporting systematic reviews. BMJ 2021, 372, n71. [Google Scholar] [CrossRef]
  45. Feng, W.; Figliozzi, M. An economic and technological analysis of the key factors affecting the competitiveness of electric commercial vehicles: A case study from the USA market. Transp. Res. Part Emerg. Technol. 2013, 26, 135–145. [Google Scholar] [CrossRef]
  46. Go-e.com. How Far Can an Electric Car Go on One Charge? 2023. Available online: https://go-e.com/en/magazine/how-far-can-an-electric-car-go-on-one-charge (accessed on 15 September 2025).
  47. Erdoğan, S.; Miller-Hooks, E. A green vehicle routing problem. Transp. Res. Part E Logist. Transp. Rev. 2012, 48, 100–114. [Google Scholar] [CrossRef]
  48. Schneider, M.; Stenger, A.; Goeke, D. The electric vehicle-routing problem with time windows and recharging stations. Transp. Sci. 2014, 48, 500–520. [Google Scholar] [CrossRef]
  49. Kucukoglu, I.; Dewil, R.; Cattrysse, D. The electric vehicle routing problem and its variations: A literature review. Comput. Ind. Eng. 2021, 161, 107650. [Google Scholar] [CrossRef]
  50. Erdelić, T.; Carić, T. A survey on the electric vehicle routing problem: Variants and solution approaches. J. Adv. Transp. 2019, 2019, 5075671. [Google Scholar] [CrossRef]
  51. Qin, H.; Su, X.; Ren, T.; Luo, Z. A review on the electric vehicle routing problems: Variants and algorithms. Front. Eng. Manag. 2021, 8, 370–389. [Google Scholar] [CrossRef]
  52. Keskin, M.; Çatay, B. Partial recharge strategies for the electric vehicle routing problem with time windows. Transp. Res. Part C Emerg. Technol. 2016, 65, 111–127. [Google Scholar] [CrossRef]
  53. Bruglieri, M.; Mancini, S.; Pezzella, F.; Pisacane, O.; Suraci, S. A three-phase matheuristic for the time-effective electric vehicle routing problem with partial recharges. Electron. Notes Discret. Math. 2017, 58, 95–102. [Google Scholar] [CrossRef]
  54. Zhou, Y.; Huang, J.; Shi, J.; Wang, R.; Huang, K. The electric vehicle routing problem with partial recharge and vehicle recycling. Complex Intell. Syst. 2021, 7, 1445–1458. [Google Scholar] [CrossRef]
  55. Verma, A. Electric vehicle routing problem with time windows, recharging stations and battery swapping stations. EURO J. Transp. Logist. 2018, 7, 415–451. [Google Scholar] [CrossRef]
  56. Raeesi, R.; Zografos, K.G. The electric vehicle routing problem with time windows and synchronised mobile battery swapping. Transp. Res. Part B Methodol. 2020, 140, 101–129. [Google Scholar] [CrossRef]
  57. Ahmad, F.; Saad Alam, M.; Saad Alsaidan, I.; Shariff, S.M. Battery swapping station for electric vehicles: Opportunities and challenges. IET Smart Grid 2020, 3, 280–286. [Google Scholar] [CrossRef]
  58. Yang, J.; Liu, W.; Ma, K.; Yue, Z.; Zhu, A.; Guo, S. An optimal battery allocation model for battery swapping station of electric vehicles. Energy 2023, 272, 127109. [Google Scholar] [CrossRef]
  59. Duan, Y.r.; Hu, Y.s.; Wu, P. An adaptive large neighborhood search heuristic for the electric vehicle routing problems with time windows and recharging strategies. J. Adv. Transp. 2023, 2023, 1200526. [Google Scholar] [CrossRef]
  60. Keser, S.B.; Sarıçiçek, İ.; Yazıcı, A. Electric Vehicle Routing With Recharging Stations: Trade-Offs in Last-Mile Delivery. IET Intell. Transp. Syst. 2025, 19, e70052. [Google Scholar] [CrossRef]
  61. Erdelić, T.; Carić, T. Goods delivery with electric vehicles: Electric vehicle routing optimization with time windows and partial or full recharge. Energies 2022, 15, 285. [Google Scholar] [CrossRef]
  62. Yu, V.F.; Anh, P.T.; Chen, Y.W. The electric vehicle routing problem with time windows, partial recharges, and parcel lockers. Appl. Sci. 2023, 13, 9190. [Google Scholar] [CrossRef]
  63. Felipe, Á.; Ortuño, M.T.; Righini, G.; Tirado, G. A heuristic approach for the green vehicle routing problem with multiple technologies and partial recharges. Transp. Res. Part E Logist. Transp. Rev. 2014, 71, 111–128. [Google Scholar] [CrossRef]
  64. Cortes-Murcia, D.L.; Prodhon, C.; Afsar, H.M. The electric vehicle routing problem with time windows, partial recharges and satellite customers. Transp. Res. Part E Logist. Transp. Rev. 2019, 130, 184–206. [Google Scholar] [CrossRef]
  65. Desaulniers, G.; Errico, F.; Irnich, S.; Schneider, M. Exact algorithms for electric vehicle-routing problems with time windows. Oper. Res. 2016, 64, 1388–1405. [Google Scholar] [CrossRef]
  66. Abid, M.; Tabaa, M.; Chakir, A.; Hachimi, H. Routing and charging of electric vehicles: Literature review. Energy Rep. 2022, 8, 556–578. [Google Scholar] [CrossRef]
  67. Liu, Z.; Zuo, X.; Zhou, M.; Guan, W.; Al-Turki, Y. Electric vehicle routing problem with variable vehicle speed and soft time windows for perishable product delivery. IEEE Trans. Intell. Transp. Syst. 2023, 24, 6178–6190. [Google Scholar] [CrossRef]
  68. Xiao, Y.; Zhang, Y.; Kaku, I.; Kang, R.; Pan, X. Electric vehicle routing problem: A systematic review and a new comprehensive model with nonlinear energy recharging and consumption. Renew. Sustain. Energy Rev. 2021, 151, 111567. [Google Scholar] [CrossRef]
  69. Montoya, A.; Guéret, C.; Mendoza, J.E.; Villegas, J.G. The electric vehicle routing problem with nonlinear charging function. Transp. Res. Part B Methodol. 2017, 103, 87–110. [Google Scholar] [CrossRef]
  70. Froger, A.; Mendoza, J.E.; Jabali, O.; Laporte, G. Improved formulations and algorithmic components for the electric vehicle routing problem with nonlinear charging functions. Comput. Oper. Res. 2019, 104, 256–294. [Google Scholar] [CrossRef]
  71. Kancharla, S.R.; Ramadurai, G. Electric vehicle routing problem with non-linear charging and load-dependent discharging. Expert Syst. Appl. 2020, 160, 113714. [Google Scholar] [CrossRef]
  72. Kim, Y.J.; Do Chung, B. Energy consumption optimization for the electric vehicle routing problem with state-of-charge-dependent discharging rates. J. Clean. Prod. 2023, 385, 135703. [Google Scholar] [CrossRef]
  73. Bendiabdellah, Z.; Senouci, S.M.; Feham, M. A hybrid algorithm for planning public charging stations. In Proceedings of the 2014 Global Information Infrastructure and Networking Symposium (GIIS), Montreal, QC, Canada, 15–19 September 2014; pp. 1–3. [Google Scholar]
  74. You, P.S.; Hsieh, Y.C. A hybrid heuristic approach to the problem of the location of vehicle charging stations. Comput. Ind. Eng. 2014, 70, 195–204. [Google Scholar] [CrossRef]
  75. Zhou, G.; Zhu, Z.; Luo, S. Location optimization of electric vehicle charging stations: Based on cost model and genetic algorithm. Energy 2022, 247, 123437. [Google Scholar] [CrossRef]
  76. Liu, Q.; Liu, J.; Le, W.; Guo, Z.; He, Z. Data-driven intelligent location of public charging stations for electric vehicles. J. Clean. Prod. 2019, 232, 531–541. [Google Scholar] [CrossRef]
  77. Awasthi, A.; Venkitusamy, K.; Padmanaban, S.; Selvamuthukumaran, R.; Blaabjerg, F.; Singh, A.K. Optimal planning of electric vehicle charging station at the distribution system using hybrid optimization algorithm. Energy 2017, 133, 70–78. [Google Scholar] [CrossRef]
  78. Li, J.; Xie, C.; Bao, Z. Optimal en-route charging station locations for electric vehicles: A new modeling perspective and a comparative evaluation of network-based and metanetwork-based approaches. Transp. Res. Part C Emerg. Technol. 2022, 142, 103781. [Google Scholar] [CrossRef]
  79. He, Y.; Kockelman, K.M.; Perrine, K.A. Optimal locations of US fast charging stations for long-distance trip completion by battery electric vehicles. J. Clean. Prod. 2019, 214, 452–461. [Google Scholar] [CrossRef]
  80. Arslan, O.; Karaşan, O.E. A Benders decomposition approach for the charging station location problem with plug-in hybrid electric vehicles. Transp. Res. Part B Methodol. 2016, 93, 670–695. [Google Scholar] [CrossRef]
  81. Lee, C.; Han, J. Benders-and-Price approach for electric vehicle charging station location problem under probabilistic travel range. Transp. Res. Part B Methodol. 2017, 106, 130–152. [Google Scholar] [CrossRef]
  82. Dimitriou, P.; Nikolopoulou, A.; Gkiotsalitis, K. An exact approach for the charging station location selection problem in urban freight transport. Oper. Res. 2025, 25, 1–32. [Google Scholar] [CrossRef]
  83. Xi, X.; Sioshansi, R.; Marano, V. Simulation–optimization model for location of a public electric vehicle charging infrastructure. Transp. Res. Part D Transp. Environ. 2013, 22, 60–69. [Google Scholar] [CrossRef]
  84. Liu, H.C.; Yang, M.; Zhou, M.; Tian, G. An integrated multi-criteria decision making approach to location planning of electric vehicle charging stations. IEEE Trans. Intell. Transp. Syst. 2018, 20, 362–373. [Google Scholar] [CrossRef]
  85. Li, C.; Zhang, L.; Ou, Z.; Wang, Q.; Zhou, D.; Ma, J. Robust model of electric vehicle charging station location considering renewable energy and storage equipment. Energy 2022, 238, 121713. [Google Scholar] [CrossRef]
  86. Kong, W.; Luo, Y.; Feng, G.; Li, K.; Peng, H. Optimal location planning method of fast charging station for electric vehicles considering operators, drivers, vehicles, traffic flow and power grid. Energy 2019, 186, 115826. [Google Scholar] [CrossRef]
  87. Ahmad, F.; Iqbal, A.; Ashraf, I.; Marzband, M.; Khan, I. Optimal location of electric vehicle charging station and its impact on distribution network: A review. Energy Rep. 2022, 8, 2314–2333. [Google Scholar] [CrossRef]
  88. Bilal, M.; Rizwan, M. Electric vehicles in a smart grid: A comprehensive survey on optimal location of charging station. IET Smart Grid 2020, 3, 267–279. [Google Scholar] [CrossRef]
  89. Kizhakkan, A.R.; Rathore, A.K.; Awasthi, A. Review of electric vehicle charging station location planning. In Proceedings of the 2019 IEEE Transportation Electrification Conference (ITEC-India), Bengaluru, India, 17–19 December 2019; pp. 1–5. [Google Scholar]
  90. Kchaou-Boujelben, M. Charging station location problem: A comprehensive review on models and solution approaches. Transp. Res. Part C Emerg. Technol. 2021, 132, 103376. [Google Scholar] [CrossRef]
  91. Yang, J.; Sun, H. Battery swap station location-routing problem with capacitated electric vehicles. Comput. Oper. Res. 2015, 55, 217–232. [Google Scholar] [CrossRef]
  92. Hof, J.; Schneider, M.; Goeke, D. Solving the battery swap station location-routing problem with capacitated electric vehicles using an AVNS algorithm for vehicle-routing problems with intermediate stops. Transp. Res. Part B Methodol. 2017, 97, 102–112. [Google Scholar] [CrossRef]
  93. Affi, M.; Derbel, H.; Jarboui, B.; Siarry, P. A Skewed General Variable Neighborhood Search Approach for Solving the Battery Swap Station Location-Routing Problem with Capacitated Electric Vehicles. In Green Transportation and New Advances in Vehicle Routing Problems; Springer: Berlin/Heidelberg, Germany, 2020; pp. 75–89. [Google Scholar]
  94. Chen, Y.; Li, D.; Zhang, Z.; Wahab, M.; Jiang, Y. Solving the battery swap station location-routing problem with a mixed fleet of electric and conventional vehicles using a heuristic branch-and-price algorithm with an adaptive selection scheme. Expert Syst. Appl. 2021, 186, 115683. [Google Scholar] [CrossRef]
  95. Schiffer, M.; Walther, G. Strategic planning of electric logistics fleet networks: A robust location-routing approach. Omega 2018, 80, 31–42. [Google Scholar] [CrossRef]
  96. Wang, C.; Liu, R.; Su, Y.; Zhang, X. Accelerating two-phase multiobjective evolutionary algorithm for electric location-routing problems. IEEE Trans. Intell. Transp. Syst. 2023, 24, 9121–9136. [Google Scholar] [CrossRef]
  97. Zhang, S.; Chen, M.; Zhang, W. A novel location-routing problem in electric vehicle transportation with stochastic demands. J. Clean. Prod. 2019, 221, 567–581. [Google Scholar] [CrossRef]
  98. Aghalari, A.; Salamah, D.E.; Marino, C.; Marufuzzaman, M. Electric vehicles fast charger location-routing problem under ambient temperature. Ann. Oper. Res. 2023, 324, 721–759. [Google Scholar] [CrossRef]
  99. Hulagu, S.; Celikoglu, H.B. Electric vehicle location routing problem with vehicle motion dynamics-based energy consumption and recovery. IEEE Trans. Intell. Transp. Syst. 2021, 23, 10275–10286. [Google Scholar] [CrossRef]
  100. Sadati, M.E.H.; Akbari, V.; Çatay, B. Electric vehicle routing problem with flexible deliveries. Int. J. Prod. Res. 2022, 60, 4268–4294. [Google Scholar] [CrossRef]
  101. Moradi, N.; Sadati, I.; Çatay, B. Last mile delivery routing problem using autonomous electric vehicles. Comput. Ind. Eng. 2023, 184, 109552. [Google Scholar] [CrossRef]
  102. Lin, J.; Zhou, W.; Wolfson, O. Electric vehicle routing problem. Transp. Res. Procedia 2016, 12, 508–521. [Google Scholar] [CrossRef]
  103. Çalık, H.; Oulamara, A.; Prodhon, C.; Salhi, S. The electric location-routing problem with heterogeneous fleet: Formulation and Benders decomposition approach. Comput. Oper. Res. 2021, 131, 105251. [Google Scholar] [CrossRef]
  104. Park, H.; Jin, S. Electric vehicle routing problem with heterogeneous vehicles and partial charge. Int. J. Ind. Eng. Manag. 2020, 11, 215–225. [Google Scholar]
  105. Cai, W.; Zhang, Y.; Huang, F.; Ma, C. Delivery routing problem of pure electric vehicle with multi-objective pick-up and delivery integration. PLoS One 2023, 18, e0281131. [Google Scholar] [CrossRef]
  106. Gholami, K.; Karimi, S.; Anvari-Moghaddam, A. Multi-objective stochastic planning of electric vehicle charging stations in unbalanced distribution networks supported by smart photovoltaic inverters. Sustain. Cities Soc. 2022, 84, 104029. [Google Scholar] [CrossRef]
  107. Kapoor, A.; Gangwar, P.; Sharma, A.; Mohapatra, A. Multi-objective framework for optimal scheduling of electric vehicles. In Proceedings of the 2020 21st National Power Systems Conference (NPSC), Gandhinagar, India, 17–19 December 2020; pp. 1–6. [Google Scholar]
  108. Zakariazadeh, A.; Jadid, S.; Siano, P. Multi-objective scheduling of electric vehicles in smart distribution system. Energy Convers. Manag. 2014, 79, 43–53. [Google Scholar] [CrossRef]
  109. Sarker, A.; Shen, H.; Stankovic, J.A. MORP: Data-driven multi-objective route planning and optimization for electric vehicles. Proc. ACM Interact. Mob. Wearable Ubiquitous Technol. 2018, 1, 1–35. [Google Scholar] [CrossRef]
  110. Zhou, B.; Zhao, Z. Multi-objective optimization of electric vehicle routing problem with battery swap and mixed time windows. Neural Comput. Appl. 2022, 34, 7325–7348. [Google Scholar] [CrossRef]
  111. SAE.org. SAE Levels of Driving Automation Refined for Clarity and International Audience, 2021. Available online: https://www.sae.org/blog/sae-j3016-update (accessed on 15 September 2025).
  112. Fagnant, D.J.; Kockelman, K. Preparing a nation for autonomous vehicles: Opportunities, barriers and policy recommendations. Transp. Res. Part A Policy Pract. 2015, 77, 167–181. [Google Scholar] [CrossRef]
  113. Figliozzi, M.A. Carbon emissions reductions in last mile and grocery deliveries utilizing air and ground autonomous vehicles. Transp. Res. Part D Transp. Environ. 2020, 85, 102443. [Google Scholar] [CrossRef]
  114. Srinivas, S.; Ramachandiran, S.; Rajendran, S. Autonomous robot-driven deliveries: A review of recent developments and future directions. Transp. Res. Part E Logist. Transp. Rev. 2022, 165, 102834. [Google Scholar] [CrossRef]
  115. Sonneberg, M.O.; Leyerer, M.; Kleinschmidt, A.; Knigge, F.; Breitner, M.H. Autonomous unmanned ground vehicles for urban logistics: Optimization of last mile delivery operations. In Proceedings of the 52nd Hawaii International Conference on System Sciences, Grand Wailea, HI, USA, 8–11 January 2019. [Google Scholar]
  116. Kronmueller, M.; Fielbaum, A.; Alonso-Mora, J. On-demand grocery delivery from multiple local stores with autonomous robots. In Proceedings of the 2021 International Symposium on Multi-Robot and Multi-Agent Systems (MRS), Cambridge, UK, 4–5 November 2021; pp. 29–37. [Google Scholar]
  117. Wang, J.; Pan, J.; Zheng, L.; Tan, X. A Systematic Space-Time Route Planning Approach Coordinated With Task Assignment for Autonomous Delivery Vehicles Fleet. IEEE Access 2023, 11, 79370–79383. [Google Scholar] [CrossRef]
  118. Gnegel, F.; Schaudt, S.; Clausen, U.; Fügenschuh, A. A Graph-Refinement Algorithm to Minimize Squared Delivery Delays Using Parcel Robots. Mathematics 2024, 12, 3201. [Google Scholar] [CrossRef]
  119. Jeong, J.; Moon, I. Dynamic pickup and delivery problem for autonomous delivery robots in an airport terminal. Comput. Ind. Eng. 2024, 196, 110476. [Google Scholar] [CrossRef]
  120. Yang, H.; Du, Y.; Le, T.V.; Chow, J.Y.J. Analytical model for large-scale design of sidewalk delivery robot systems with bounded makespans. Transp. Res. Part C Emerg. Technol. 2025, 171, 104978. [Google Scholar] [CrossRef]
  121. Boysen, N.; Schwerdfeger, S.; Weidinger, F. Scheduling last-mile deliveries with truck-based autonomous robots. Eur. J. Oper. Res. 2018, 271, 1085–1099. [Google Scholar] [CrossRef]
  122. Simoni, M.D.; Kutanoglu, E.; Claudel, C.G. Optimization and analysis of a robot-assisted last mile delivery system. Transp. Res. Part E Logist. Transp. Rev. 2020, 142, 102049. [Google Scholar] [CrossRef]
  123. Jennings, D.; Figliozzi, M. Study of sidewalk autonomous delivery robots and their potential impacts on freight efficiency and travel. Transp. Res. Rec. 2019, 2673, 317–326. [Google Scholar] [CrossRef]
  124. Reed, S.; Campbell, A.M.; Thomas, B.W. The value of autonomous vehicles for last-mile deliveries in urban environments. Manag. Sci. 2022, 68, 280–299. [Google Scholar] [CrossRef]
  125. Reed, S.; Campbell, A.M.; Thomas, B.W. Impact of autonomous vehicle assisted last-mile delivery in urban to rural settings. Transp. Sci. 2022, 56, 1530–1548. [Google Scholar] [CrossRef]
  126. Ostermeier, M.; Heimfarth, A.; Hübner, A. Cost-optimal truck-and-robot routing for last-mile delivery. Networks 2022, 79, 364–389. [Google Scholar] [CrossRef]
  127. Alfandari, L.; Ljubić, I.; Da Silva, M.D.M. A tailored Benders decomposition approach for last-mile delivery with autonomous robots. Eur. J. Oper. Res. 2022, 299, 510–525. [Google Scholar] [CrossRef]
  128. Heimfarth, A.; Ostermeier, M.; Hübner, A. A mixed truck and robot delivery approach for the daily supply of customers. Eur. J. Oper. Res. 2022, 303, 401–421. [Google Scholar] [CrossRef]
  129. Chen, C.; Demir, E.; Huang, Y.; Qiu, R. The adoption of self-driving delivery robots in last mile logistics. Transp. Res. Part E Logist. Transp. Rev. 2021, 146, 102214. [Google Scholar] [CrossRef] [PubMed]
  130. Chen, C.; Demir, E.; Huang, Y. An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and delivery robots. Eur. J. Oper. Res. 2021, 294, 1164–1180. [Google Scholar] [CrossRef]
  131. Ostermeier, M.; Heimfarth, A.; Hübner, A. The multi-vehicle truck-and-robot routing problem for last-mile delivery. Eur. J. Oper. Res. 2023, 310, 680–697. [Google Scholar] [CrossRef]
  132. Scherr, Y.O.; Saavedra, B.A.N.; Hewitt, M.; Mattfeld, D.C. Service network design with mixed autonomous fleets. Transp. Res. Part E Logist. Transp. Rev. 2019, 124, 40–55. [Google Scholar] [CrossRef]
  133. Klar, R.; Arvidsson, N.; Rudmark, D. Towards a new last-mile delivery system: Cost and energy-optimized robot and van allocation. Transp. Res. Part E Logist. Transp. Rev. 2025; in press. [Google Scholar]
  134. Wei, Y.; Wang, Y.; Hu, X. The two-echelon truck–unmanned ground vehicle routing problem with time-dependent travel times. Transp. Res. Part E Logist. Transp. Rev. 2025, 194, 103954. [Google Scholar] [CrossRef]
  135. Moradi, N.; Kayvanfar, V.; Baldacci, R. Autonomous Delivery Vehicles in Two-Echelon Routing for Sustainable Last-Mile Logistics. IFAC-PapersOnLine 2025, 59, 2598–2603. [Google Scholar] [CrossRef]
  136. Li, B.; Liu, S.; Tang, J.; Gaudiot, J.L.; Zhang, L.; Kong, Q. Autonomous last-mile delivery vehicles in complex traffic environments. Computer 2020, 53, 26–35. [Google Scholar] [CrossRef]
  137. Bentley, P.; Lim, S.L.; Arcaini, P.; Ishikawa, F. Using a variational autoencoder to learn valid search spaces of safely monitored autonomous robots for last-mile delivery. In Proceedings of the Genetic and Evolutionary Computation Conference, New York, NY, USA, 15–19 July 2023; pp. 1303–1311. [Google Scholar]
  138. Han, J.J.; Seo, S.; Kim, H.J. Autonomous delivery robots on the rise: How can I cut carbon footprint for restaurant food deliveries? Int. J. Hosp. Manag. 2024, 121, 103804. [Google Scholar] [CrossRef]
  139. Wu, M.; Lin, A.S.Q.; Yuen, K.F. The effects of motivated consumer innovativeness on consumer acceptance of autonomous delivery robots. J. Retail. Consum. Serv. 2024, 81, 104030. [Google Scholar] [CrossRef]
  140. Choi, M.; Lee, S. Integration of Autonomous Robots in Environmental and Urban Planning. In Intelligent Moving Cities: Technological Leap and Social Integration of Autonomous Mobile Robots; Springer: Singapore, 2025; pp. 83–98. [Google Scholar] [CrossRef]
  141. Shin, H.; Choi, J.; Oh, C. Delivering the Future: Understanding User Perceptions of Delivery Robots. Proc. ACM Hum.-Comput. Interact. 2024, 8, 1–24. [Google Scholar] [CrossRef]
  142. Yu, X.; Hoggenmüller, M.; Tran, T.T.M.; Wang, Y.; Tomitsch, M. Understanding the Interaction between Delivery Robots and Other Road and Sidewalk Users: A Study of User-generated Online Videos. ACM Trans. Hum.-Robot. Interact. 2024, 13, 59. [Google Scholar] [CrossRef]
  143. Santamaria-Navarro, A.; Hernández, S.; Herrero, F.; López, A.; del Pino, I.; Rodríguez-Linares, N.; Fernández, C.; Baldó, A.; Lemardelé, C.; Garrell, A.; et al. Toward the Deployment of an Autonomous Last-Mile Delivery Robot in Urban Areas: The Ona Prototype Platform. IEEE Robot. Autom. Mag. 2024, 32, 26–39. [Google Scholar] [CrossRef]
  144. Jung, S.; Lee, S.; Jun, W.; Oh, T. Performance Analysis of Motion Planning for Outdoor Autonomous Delivery Robot. In Proceedings of the 2024 IEEE International Conference on Consumer Electronics (ICCE), Las Vegas, NV, USA, 6–8 January 2024. [Google Scholar] [CrossRef]
  145. Patel, S. Human Interaction with Autonomous Delivery Robots: Navigating the Intersection of Psychological Acceptance and Societal Integration. In Proceedings of the Human Factors in Design, Engineering, and Computing; AHFE Open Access: Honolulu, HI, USA, 2024. [Google Scholar] [CrossRef]
  146. Xu, F.; Liu, D.; Zhou, C.; Hu, J. Robotic Delivery Worker in the Dark: Assessment of Perceived Safety from Sidewalk Autonomous Delivery Robots’ Lighting Colors. Appl. Sci. 2024, 14, 5983. [Google Scholar] [CrossRef]
  147. Kaiser, R.; De Benedetto, S.; Planing, P.; Müller, P. What Will the Delivery Robots Bring Us Tomorrow? Int. J. Consum. Stud. 2024, 48, e13093. [Google Scholar] [CrossRef]
  148. Zhou, Y.; Wen, M.; Chen, X.; Zhao, C.; Guo, J.; Zhang, J.; Yue, Y.; Ma, Y. Towards Safe and Efficient Last-Mile Delivery: A Multi-Modal Socially Aware Navigation Framework for Autonomous Robots on Pedestrian-Crowded Sidewalks. In Proceedings of the 2024 IEEE International Conference on Cybernetics and Intelligent Systems (CIS) and IEEE International Conference on Robotics, Automation and Mechatronics (RAM), Hangzhou, China, 8–11 August 2024; pp. 392–398. [Google Scholar] [CrossRef]
  149. Ayyıldız, E.; Erdogan, M. Addressing the challenges of using autonomous robots for last-mile delivery. Comput. Ind. Eng. 2024, 190, 110096. [Google Scholar] [CrossRef]
  150. Koh, L.Y.; Xia, Z.; Yuen, K.F. Consumer acceptance of the autonomous robot in last-mile delivery: A combined perspective of resource-matching, perceived risk and value theories. Transp. Res. Part A Policy Pract. 2024, 182, 104008. [Google Scholar] [CrossRef]
  151. Maas, J.; Kosch, M.; Straube, F. Integration of Autonomous Delivery Solutions in Urban Logistics—Practical Insights from a Pilot Project. In New Players in Mobility; Proff, H., Ed.; Springer Gabler: Wiesbaden, Germany, 2025. [Google Scholar] [CrossRef]
  152. Li, L.; He, X.; Keoleian, G.A.; Kim, H.C.; De Kleine, R.; Wallington, T.J.; Kemp, N.J. Life cycle greenhouse gas emissions for last-mile parcel delivery by automated vehicles and robots. Environ. Sci. Technol. 2021, 55, 11360–11367. [Google Scholar] [CrossRef]
  153. Garus, A.; Christidis, P.; Mourtzouchou, A.; Duboz, L.; Ciuffo, B. Unravelling the last-mile conundrum: A comparative study of autonomous delivery robots, delivery bicycles, and light commercial vehicles in 14 varied European landscapes. Sustain. Cities Soc. 2024, 108, 105490. [Google Scholar] [CrossRef]
  154. Lemardelé, C.; Estrada, M.Á.; Pagès, L. Uncertainty analysis of autonomous delivery robot operations for last-mile logistics in European cities. J. Intell. Transp. Syst. 2024, 29, 469–490. [Google Scholar] [CrossRef]
  155. Poeting, M.; Schaudt, S.; Clausen, U. A comprehensive case study in last-mile delivery concepts for parcel robots. In Proceedings of the 2019 Winter Simulation Conference (WSC), National Harbor, MD, USA, 8–11 December 2019; pp. 1779–1788. [Google Scholar]
  156. Zhao, J.; Hu, H.; Han, Y.; Cai, Y. A review of unmanned vehicle distribution optimization models and algorithms. J. Traffic Transp. Eng. Engl. Ed. 2023, 10, 548–559. [Google Scholar] [CrossRef]
  157. Plank, M.; Lemardelé, C.; Assmann, T.; Zug, S. Ready for robots? Assessment of autonomous delivery robot operative accessibility in German cities. J. Urban Mobil. 2022, 2, 100036. [Google Scholar] [CrossRef]
  158. Engesser, V.; Rombaut, E.; Vanhaverbeke, L.; Lebeau, P. Autonomous delivery solutions for last-mile logistics operations: A literature review and research agenda. Sustainability 2023, 15, 2774. [Google Scholar] [CrossRef]
  159. Zemanek, J.E., Jr.; Kros, J.F. Risk-mitigation strategies for autonomous delivery vehicles in the last mile: A comprehensive overview of the current state and future potential of autonomous delivery technologies in the supply chain. J. Compr. Bus. Adm. Res. 2025, 2. [Google Scholar] [CrossRef]
  160. Wang, X.; Zhan, L.; Ruan, J.; Zhang, J. How to Choose “Last Mile” Delivery Modes for E-Fulfillment. Math. Probl. Eng. 2014, 2014, 417129. [Google Scholar] [CrossRef]
  161. Carotenuto, P.; Ceccato, R.; Gastaldi, M.; Giordani, S.; Rossi, R.; Salvatore, A. Comparing home and parcel lockers’ delivery systems: A math-heuristic approach. Transp. Res. Procedia 2022, 62, 91–98. [Google Scholar] [CrossRef]
  162. Deutsch, Y.; Golany, B. A parcel locker network as a solution to the logistics last mile problem. Int. J. Prod. Res. 2018, 56, 251–261. [Google Scholar] [CrossRef]
  163. Rabe, M.; Gonzalez-Feliu, J.; Chicaiza-Vaca, J.; Tordecilla, R.D. Simulation-optimization approach for multi-period facility location problems with forecasted and random demands in a last-mile logistics application. Algorithms 2021, 14, 41. [Google Scholar] [CrossRef]
  164. Sawik, B.; Serrano-Hernandez, A.; Muro, A.; Faulin, J. Multi-criteria simulation-optimization analysis of usage of automated parcel lockers: A practical approach. Mathematics 2022, 10, 4423. [Google Scholar] [CrossRef]
  165. Luo, R.; Ji, S.; Ji, Y. An active-learning Pareto evolutionary algorithm for parcel locker network design considering accessibility of customers. Comput. Oper. Res. 2022, 141, 105677. [Google Scholar] [CrossRef]
  166. Yang, X.; Wang, C.; He, X.; Zhang, H.; Xu, G. Location optimization for community smart parcel lockers based on bilevel programming. J. Adv. Transp. 2023, 2023, 1998188. [Google Scholar] [CrossRef]
  167. Kahr, M. Determining locations and layouts for parcel lockers to support supply chain viability at the last mile. Omega 2022, 113, 102721. [Google Scholar] [CrossRef]
  168. Schwerdfeger, S.; Boysen, N. Optimizing the changing locations of mobile parcel lockers in last-mile distribution. Eur. J. Oper. Res. 2020, 285, 1077–1094. [Google Scholar] [CrossRef]
  169. Mancini, S.; Gansterer, M.; Triki, C. Locker box location planning under uncertainty in demand and capacity availability. Omega 2023, 120, 102910. [Google Scholar] [CrossRef]
  170. Zhou, L.; Li, C.; Hu, C.; Du, J. Parcel locker location problem with selectable volume sizes and heterogeneous customers in the last mile delivery. Transp. Lett. 2024, 16, 1140–1154. [Google Scholar] [CrossRef]
  171. Orenstein, I.; Raviv, T.; Sadan, E. Flexible parcel delivery to automated parcel lockers: Models, solution methods and analysis. EURO J. Transp. Logist. 2019, 8, 683–711. [Google Scholar] [CrossRef]
  172. Sitek, P.; Wikarek, J. Capacitated vehicle routing problem with pick-up and alternative delivery (CVRPPAD): Model and implementation using hybrid approach. Ann. Oper. Res. 2019, 273, 257–277. [Google Scholar] [CrossRef]
  173. Sitek, P.; Wikarek, J.; Rutczyńska-Wdowiak, K.; Bocewicz, G.; Banaszak, Z. Optimization of capacitated vehicle routing problem with alternative delivery, pick-up and time windows: A modified hybrid approach. Neurocomputing 2021, 423, 670–678. [Google Scholar] [CrossRef]
  174. Jiang, L.; Dhiaf, M.; Dong, J.; Liang, C.; Zhao, S. A traveling salesman problem with time windows for the last mile delivery in online shopping. Int. J. Prod. Res. 2020, 58, 5077–5088. [Google Scholar] [CrossRef]
  175. Buzzega, G.; Novellani, S. Last mile deliveries with lockers: Formulations and algorithms. Soft Comput. 2023, 27, 12843–12861. [Google Scholar] [CrossRef]
  176. Enthoven, D.L.; Jargalsaikhan, B.; Roodbergen, K.J.; Uit het Broek, M.A.; Schrotenboer, A.H. The two-echelon vehicle routing problem with covering options: City logistics with cargo bikes and parcel lockers. Comput. Oper. Res. 2020, 118, 104919. [Google Scholar] [CrossRef]
  177. Redi, A.P.; Jewpanya, P.; Kurniawan, A.C.; Persada, S.F.; Nadlifatin, R.; Dewi, O.A.C. A simulated annealing algorithm for solving two-echelon vehicle routing problem with locker facilities. Algorithms 2020, 13, 218. [Google Scholar] [CrossRef]
  178. Vincent, F.Y.; Jodiawan, P.; Schrotenboer, A.H.; Hou, M.L. The two-echelon vehicle routing problem with time windows, intermediate facilities, and occasional drivers. Expert Syst. Appl. 2023, 234, 120945. [Google Scholar] [CrossRef]
  179. Vincent, F.Y.; Susanto, H.; Jodiawan, P.; Ho, T.W.; Lin, S.W.; Huang, Y.T. A simulated annealing algorithm for the vehicle routing problem with parcel lockers. IEEE Access 2022, 10, 20764–20782. [Google Scholar] [CrossRef]
  180. Dumez, D.; Lehuédé, F.; Péton, O. A large neighborhood search approach to the vehicle routing problem with delivery options. Transp. Res. Part B Methodol. 2021, 144, 103–132. [Google Scholar] [CrossRef]
  181. Grabenschweiger, J.; Doerner, K.F.; Hartl, R.F.; Savelsbergh, M.W. The vehicle routing problem with heterogeneous locker boxes. Cent. Eur. J. Oper. Res. 2021, 29, 113–142. [Google Scholar] [CrossRef]
  182. Tilk, C.; Olkis, K.; Irnich, S. The last-mile vehicle routing problem with delivery options. Or Spectr. 2021, 43, 877–904. [Google Scholar] [CrossRef]
  183. Janinhoff, L.; Klein, R.; Scholz, D. Multitrip vehicle routing with delivery options: A data-driven application to the parcel industry. OR Spectr. 2024, 46, 241–294. [Google Scholar] [CrossRef]
  184. Oliveira, W.J.P.; dos Santos, A.G. Last Mile Delivery with Lockers: Formulation and Heuristic. In Proceedings of the 22nd International Conference on Enterprise Information Systems (ICEIS 2020) (1), Online Streaming, 5–7 May 2020; pp. 460–467. [Google Scholar]
  185. Oliveira, B.; Lima, D.; Pessoa, A.; Roboredo, M. Exact methods for two vehicle routing problems with lockers in last-mile delivery. OR Spectr. 2025, 1–31. [Google Scholar] [CrossRef]
  186. Oliveira, B.; Pessoa, A.; Roboredo, M. Hybrid iterated local search algorithm for the vehicle routing problem with lockers. J. Heuristics 2025, 31, 22. [Google Scholar] [CrossRef]
  187. Mancini, S.; Gansterer, M. Vehicle routing with private and shared delivery locations. Comput. Oper. Res. 2021, 133, 105361. [Google Scholar] [CrossRef]
  188. Yu, V.F.; Susanto, H.; Yeh, Y.H.; Lin, S.W.; Huang, Y.T. The vehicle routing problem with simultaneous pickup and delivery and parcel lockers. Mathematics 2022, 10, 920. [Google Scholar] [CrossRef]
  189. Ensafian, H.; Andaryan, A.Z.; Bell, M.G.; Geers, D.G.; Kilby, P.; Li, J. Cost-optimal deployment of autonomous mobile lockers co-operating with couriers for simultaneous pickup and delivery operations. Transp. Res. Part C Emerg. Technol. 2023, 146, 103958. [Google Scholar] [CrossRef]
  190. Liu, Y.; Ye, Q.; Escribano-Macias, J.; Feng, Y.; Candela, E.; Angeloudis, P. Route planning for last-mile deliveries using mobile parcel lockers: A hybrid q-learning network approach. Transp. Res. Part E Logist. Transp. Rev. 2023, 177, 103234. [Google Scholar] [CrossRef]
  191. Wang, Y.; Bi, M.; Chen, Y. A scheduling strategy of mobile parcel lockers for the last mile delivery problem. Promet-Traffic Transp. 2020, 32, 875–885. [Google Scholar] [CrossRef]
  192. Chen, J.; Li, R.; Ma, J.; An, Q. Stationary versus mobile parcel lockers: Which self-service technology moves the consumers in the last mile of urban areas? Travel Behav. Soc. 2024, 35, 100742. [Google Scholar] [CrossRef]
  193. Zurel, Ö.; Van Hoyweghen, L.; Braes, S.; Seghers, A. Parcel lockers, an answer to the pressure on the last mile delivery? In New Business and Regulatory Strategies in the Postal Sector; Springer: Berlin/Heidelberg, Germany, 2019; pp. 299–312. [Google Scholar]
  194. Dong, B.; Hovi, I.B.; Pinchasik, D.R. Analysis of service efficiency of parcel locker in last-mile delivery: A case study in Norway. Transp. Res. Procedia 2023, 69, 918–925. [Google Scholar] [CrossRef]
  195. Klein, P.; Popp, B. Last-mile delivery methods in E-commerce: Does perceived sustainability matter for consumer acceptance and usage? Sustainability 2022, 14, 16437. [Google Scholar] [CrossRef]
  196. Hohenecker, N.; Hauger, G.; Braith, J.; Eitler, S.; Prandtstetter, M.; Schodl, R.; Seragiotto, C.; Steinbauer, M. alBOX: White Label Parcel Lockers as Sustainable Solution for Last Mile Delivery. In Proceedings of the REAL CORP 2021, 26th International Conference on Urban Development, Regional Planning and Information Society, Vienna, Austria, 7–10 September 2021; pp. 41–51. [Google Scholar]
  197. Bonomi, V.; Mansini, R.; Zanotti, R. Last Mile Delivery with Parcel Lockers: Evaluating the environmental impact of eco-conscious consumer behavior. IFAC-PapersOnLine 2022, 55, 72–77. [Google Scholar] [CrossRef]
  198. Gutenschwager, K.; Rabe, M.; Chicaiza-Vaca, J. Comparing Direct Deliveries and Automated Parcel Locker Systems with Respect to Overall CO2 Emissions for the Last Mile. Algorithms 2024, 17, 4. [Google Scholar] [CrossRef]
  199. Peppel, M.; Spinler, S.; Winkenbach, M. Integrating mobile parcel lockers into last-mile delivery networks: An operational design for home delivery, stationary, and mobile parcel lockers. Int. J. Phys. Distrib. Logist. Manag. 2024, 54, 418–447. [Google Scholar] [CrossRef]
  200. Rohmer, S.; Gendron, B. A Guide to Parcel Lockers in Last Mile Distribution: Highlighting Challenges and Opportunities from an OR Perspective; Cirrelt Montreal: Montréal, QC, Canada, 2020; Volume 11. [Google Scholar]
  201. Akdoğan, K.; Özceylan, E. Parcel lockers location and routing problem: A bibliometric, descriptive, and content analysis of existing studies. Int. J. Ind. Eng. 2022, 29. [Google Scholar]
  202. Tsai, J.F.; Ngo, H.N.; Che, Z.H. Last-mile delivery during COVID-19: A systematic review of parcel locker adoption and consumer experience. Acta Psychol. 2024, 249, 104462. [Google Scholar] [CrossRef] [PubMed]
  203. Morganti, E.; Seidel, S.; Blanquart, C.; Dablanc, L.; Lenz, B. The impact of e-commerce on final deliveries: Alternative parcel delivery services in France and Germany. Transp. Res. Procedia 2014, 4, 178–190. [Google Scholar] [CrossRef]
  204. Russo, A.; Tesoriere, G.; Al-Rashid, M.A.; Campisi, T. Pick-up point location optimization using a two-level multi-objective approach: The enna case study. In Proceedings of the International Conference on Computational Science and Its Applications; Springer: Berlin/Heidelberg, Germany, 2023; pp. 309–322. [Google Scholar]
  205. Baia, B.S. Relevant attributes for pick-up points in last-mile logistics. RAM-Rev. Adm. Mackenzie 2025, 26. [Google Scholar] [CrossRef]
  206. Saad, S.; Bahadori, R. Sustainability evaluation of last mile food delivery: Pickup point using lockers versus home delivery. In Proceedings of the International Food Operations and Processing Simulation Workshop, FoodOPS 2018; CAL-TEK Srl: Rende, Italy, 2018; pp. 37–42. [Google Scholar]
  207. Galiullina, A.; Mutlu, N.R.; Kinable, J.; Van Woensel, T. Demand Steering in a Last-Mile Delivery Problem with Home and Pickup Point Delivery Options. Transp. Sci. 2024, 58, 454–473. [Google Scholar] [CrossRef]
  208. Brown, J.R.; Guiffrida, A.L. Carbon emissions comparison of last mile delivery versus customer pickup. Int. J. Logist. Res. Appl. 2014, 17, 503–521. [Google Scholar] [CrossRef]
  209. Beckers, J.; Verhetsel, A. The sustainability of the urban layer of e-commerce deliveries: The Belgian collection and delivery point networks. Eur. Plan. Stud. 2021, 29, 2300–2319. [Google Scholar] [CrossRef]
  210. Masteguim, R.; Cunha, C.B. An optimization-based approach to evaluate the operational and environmental impacts of pick-up points on E-commerce urban last-mile distribution: A case study in São Paulo, Brazil. Sustainability 2022, 14, 8521. [Google Scholar] [CrossRef]
  211. Cardenas, I.D.; Dewulf, W.; Beckers, J.; Smet, C.; Vanelslander, T. The e-commerce parcel delivery market and the implications of home B2C deliveries vs pick-up points. Int. J. Transp. Econ. Riv. Internazionale Econ. Dei Trasp. 2017, 44, 235–256. [Google Scholar]
  212. Neto, L.G.; Vieira, J.G.V. An investigation of consumer intention to use pick-up point services for last-mile distribution in a developing country. J. Retail. Consum. Serv. 2023, 74, 103425. [Google Scholar] [CrossRef]
  213. Carbone, V.; Rouquet, A.; Roussat, C. The rise of crowd logistics: A new way to co-create logistics value. J. Bus. Logist. 2017, 38, 238–252. [Google Scholar] [CrossRef]
  214. Archetti, C.; Savelsbergh, M.; Speranza, M.G. The vehicle routing problem with occasional drivers. Eur. J. Oper. Res. 2016, 254, 472–480. [Google Scholar] [CrossRef]
  215. Macrina, G.; Di Puglia Pugliese, L.; Guerriero, F.; Laganà, D. The vehicle routing problem with occasional drivers and time windows. In Proceedings of the International Conference on Optimization and Decision Science; Springer: Berlin/Heidelberg, Germany, 2017; pp. 577–587. [Google Scholar]
  216. Pugliese, L.D.P.; Ferone, D.; Festa, P.; Guerriero, F.; Macrina, G. Combining variable neighborhood search and machine learning to solve the vehicle routing problem with crowd-shipping. Optim. Lett. 2023, 17, 1981–2003. [Google Scholar] [CrossRef]
  217. Soto Setzke, D.; Pflügler, C.; Schreieck, M.; Fröhlich, S.; Wiesche, M.; Krcmar, H. Matching drivers and transportation requests in crowdsourced delivery systems. In Proceedings of the AMCIS 2017 Proceedings, Boston, MA, USA, 10–12 August 2017. [Google Scholar]
  218. Mancini, S.; Gansterer, M. Bundle generation for last-mile delivery with occasional drivers. Omega 2022, 108, 102582. [Google Scholar] [CrossRef]
  219. Pugliese, L.D.P.; Ferone, D.; Macrina, G.; Festa, P.; Guerriero, F. The crowd-shipping with penalty cost function and uncertain travel times. Omega 2023, 115, 102776. [Google Scholar] [CrossRef]
  220. Ahamed, T.; Zou, B.; Farazi, N.P.; Tulabandhula, T. Deep reinforcement learning for crowdsourced urban delivery. Transp. Res. Part B Methodol. 2021, 152, 227–257. [Google Scholar] [CrossRef]
  221. Behrendt, A.; Savelsbergh, M.; Wang, H. A prescriptive machine learning method for courier scheduling on crowdsourced delivery platforms. Transp. Sci. 2023, 57, 889–907. [Google Scholar] [CrossRef]
  222. Ulmer, M.W.; Savelsbergh, M. Workforce scheduling in the era of crowdsourced delivery. Transp. Sci. 2020, 54, 1113–1133. [Google Scholar] [CrossRef]
  223. Kafle, N.; Zou, B.; Lin, J. Design and modeling of a crowdsource-enabled system for urban parcel relay and delivery. Transp. Res. Part B Methodol. 2017, 99, 62–82. [Google Scholar] [CrossRef]
  224. Tao, Y.; Zhuo, H.; Lai, X. The pickup and delivery problem with multiple depots and dynamic occasional drivers in crowdshipping delivery. Comput. Ind. Eng. 2023, 182, 109440. [Google Scholar] [CrossRef]
  225. Wu, X.; Hu, D.; Ma, B.; Jiang, R. The two echelon open vehicle routing problem: Optimization of crowdshipping based parcel delivery. KSCE J. Civ. Eng. 2022, 26, 4073–4085. [Google Scholar] [CrossRef]
  226. Arslan, A.M.; Agatz, N.; Kroon, L.; Zuidwijk, R. Crowdsourced delivery—A dynamic pickup and delivery problem with ad hoc drivers. Transp. Sci. 2019, 53, 222–235. [Google Scholar] [CrossRef]
  227. Dayarian, I.; Savelsbergh, M. Crowdshipping and same-day delivery: Employing in-store customers to deliver online orders. Prod. Oper. Manag. 2020, 29, 2153–2174. [Google Scholar] [CrossRef]
  228. Sampaio, A.; Savelsbergh, M.; Veelenturf, L.P.; Van Woensel, T. Delivery systems with crowd-sourced drivers: A pickup and delivery problem with transfers. Networks 2020, 76, 232–255. [Google Scholar] [CrossRef]
  229. Voigt, S.; Kuhn, H. Crowdsourced logistics: The pickup and delivery problem with transshipments and occasional drivers. Networks 2022, 79, 403–426. [Google Scholar] [CrossRef]
  230. Gdowska, K.; Viana, A.; Pedroso, J.P. Stochastic last-mile delivery with crowdshipping. Transp. Res. Procedia 2018, 30, 90–100. [Google Scholar] [CrossRef]
  231. Mousavi, K.; Bodur, M.; Roorda, M.J. Stochastic last-mile delivery with crowd-shipping and mobile depots. Transp. Sci. 2022, 56, 612–630. [Google Scholar] [CrossRef]
  232. Chen, S.; Miao, H.; Guo, Z.; Yang, L.; Yao, C.; Yang, Z. A truthful combinatorial reverse auction mechanism for crowdshipping. IEEE Internet Things J. 2023, 10, 18225–18236. [Google Scholar] [CrossRef]
  233. Yıldız, B. Express package routing problem with occasional couriers. Transp. Res. Part C Emerg. Technol. 2021, 123, 102994. [Google Scholar] [CrossRef]
  234. Tapia, R.J.; Kourounioti, I.; Thoen, S.; de Bok, M.; Tavasszy, L. A disaggregate model of passenger-freight matching in crowdshipping services. Transp. Res. Part A Policy Pract. 2023, 169, 103587. [Google Scholar] [CrossRef]
  235. Macrina, G.; Pugliese, L.D.P.; Guerriero, F.; Laporte, G. Crowd-shipping with time windows and transshipment nodes. Comput. Oper. Res. 2020, 113, 104806. [Google Scholar] [CrossRef]
  236. Vincent, F.Y.; Jodiawan, P.; Redi, A.P. Crowd-shipping problem with time windows, transshipment nodes, and delivery options. Transp. Res. Part E Logist. Transp. Rev. 2022, 157, 102545. [Google Scholar]
  237. Wang, Y.; Zhang, D.; Liu, Q.; Shen, F.; Lee, L.H. Towards enhancing the last-mile delivery: An effective crowd-tasking model with scalable solutions. Transp. Res. Part E Logist. Transp. Rev. 2016, 93, 279–293. [Google Scholar] [CrossRef]
  238. Wang, L.; Xu, M.; Qin, H. Joint optimization of parcel allocation and crowd routing for crowdsourced last-mile delivery. Transp. Res. Part B Methodol. 2023, 171, 111–135. [Google Scholar] [CrossRef]
  239. Stokkink, P.; Geroliminis, N. A continuum approximation approach to the depot location problem in a crowd-shipping system. Transp. Res. Part E Logist. Transp. Rev. 2023, 176, 103207. [Google Scholar] [CrossRef]
  240. Behrend, M.; Meisel, F. The integration of item-sharing and crowdshipping: Can collaborative consumption be pushed by delivering through the crowd? Transp. Res. Part B Methodol. 2018, 111, 227–243. [Google Scholar] [CrossRef]
  241. Fadda, E.; Perboli, G.; Tadei, R. Customized multi-period stochastic assignment problem for social engagement and opportunistic IoT. Comput. Oper. Res. 2018, 93, 41–50. [Google Scholar] [CrossRef]
  242. Boysen, N.; Emde, S.; Schwerdfeger, S. Crowdshipping by employees of distribution centers: Optimization approaches for matching supply and demand. Eur. J. Oper. Res. 2022, 296, 539–556. [Google Scholar] [CrossRef]
  243. Fatehi, S.; Wagner, M.R. Crowdsourcing last-mile deliveries. Manuf. Serv. Oper. Manag. 2022, 24, 791–809. [Google Scholar] [CrossRef]
  244. He, S.; Dai, Y.; Ma, Z.J. To offer or not to offer? The optimal value-insured strategy for crowdsourced delivery platforms. Transp. Res. Part E Logist. Transp. Rev. 2023, 173, 103091. [Google Scholar] [CrossRef]
  245. Li, X.; Tan, A.J.H.; Wang, X.; Yuen, K.F. Investigating gig workers’ commitment to crowdsourced logistics platforms: Fair employment and social exchange perspectives. Technol. Soc. 2023, 74, 102311. [Google Scholar] [CrossRef]
  246. Tsai, P.W.; Xue, X.; Zhang, J. Trajectory feature extraction and multi-criteria k nearest neighbour based job-to-crowd matching for the crowdshipping last mile delivery. IET Control Theory Appl. 2023, 17, 2304–2312. [Google Scholar] [CrossRef]
  247. Zhang, N.; Liu, Z.; Li, F.; Xu, Z.; Chen, Z. Stable matching for crowdsourcing last-mile delivery. IEEE Trans. Intell. Transp. Syst. 2023, 24, 8174–8187. [Google Scholar] [CrossRef]
  248. Wang, Z.; Li, Y.; Gu, F.; Guo, J.; Wu, X. Two-sided matching and strategic selection on freight resource sharing platforms. Phys. A Stat. Mech. Its Appl. 2020, 559, 125014. [Google Scholar] [CrossRef]
  249. Hou, S.; Gao, J.; Wang, C. Optimization framework for crowd-sourced delivery services with the consideration of shippers’ acceptance uncertainties. IEEE Trans. Intell. Transp. Syst. 2022, 24, 684–693. [Google Scholar] [CrossRef]
  250. Le, T.V.; Ukkusuri, S.V.; Xue, J.; Van Woensel, T. Designing pricing and compensation schemes by integrating matching and routing models for crowd-shipping systems. Transp. Res. Part E Logist. Transp. Rev. 2021, 149, 102209. [Google Scholar] [CrossRef]
  251. Dai, H.; Liu, Y.; Yan, N.; Zhou, W. Optimal staffing for online-to-offline on-demand delivery systems: In-house or crowd-sourcing drivers? Asia-Pac. J. Oper. Res. 2021, 38, 2050037. [Google Scholar] [CrossRef]
  252. Yildiz, B.; Savelsbergh, M. Service and capacity planning in crowd-sourced delivery. Transp. Res. Part C Emerg. Technol. 2019, 100, 177–199. [Google Scholar] [CrossRef]
  253. Buldeo Rai, H.; Verlinde, S.; Merckx, J.; Macharis, C. Crowd logistics: An opportunity for more sustainable urban freight transport? Eur. Transp. Res. Rev. 2017, 9, 39. [Google Scholar] [CrossRef]
  254. Devari, A.; Nikolaev, A.G.; He, Q. Crowdsourcing the last mile delivery of online orders by exploiting the social networks of retail store customers. Transp. Res. Part E Logist. Transp. Rev. 2017, 105, 105–122. [Google Scholar] [CrossRef]
  255. Gatta, V.; Marcucci, E.; Nigro, M.; Patella, S.M.; Serafini, S. Public Transport-Based Crowdshipping for Sustainable City Logistics: Assessing Economic and Environmental Impacts. Sustainability 2019, 11, 145. [Google Scholar] [CrossRef]
  256. Qi, W.; Li, L.; Liu, S.; Shen, Z.J.M. Shared mobility for last-mile delivery: Design, operational prescriptions, and environmental impact. Manuf. Serv. Oper. Manag. 2018, 20, 737–751. [Google Scholar] [CrossRef]
  257. Ghaderi, H.; Tsai, P.W.; Zhang, L.; Moayedikia, A. An integrated crowdshipping framework for green last mile delivery. Sustain. Cities Soc. 2022, 78, 103552. [Google Scholar] [CrossRef]
  258. Alnaggar, A.; Gzara, F.; Bookbinder, J.H. Crowdsourced delivery: A review of platforms and academic literature. Omega 2021, 98, 102139. [Google Scholar] [CrossRef]
  259. Le, T.V.; Stathopoulos, A.; Van Woensel, T.; Ukkusuri, S.V. Supply, demand, operations, and management of crowd-shipping services: A review and empirical evidence. Transp. Res. Part C Emerg. Technol. 2019, 103, 83–103. [Google Scholar] [CrossRef]
  260. Samad, T.A.; Ganguly, K.K.; Das, D. Towards a framework for development of crowd logistics: Paving the way for sustainable logistics. Comput. Ind. Eng. 2023, 176, 109008. [Google Scholar] [CrossRef]
  261. Bathke, H.; Münch, C. From occasional to active crowdshippers: The significance of couriers’ characteristics. IEEE Trans. Eng. Manag. 2023, 71, 12094–12109. [Google Scholar] [CrossRef]
  262. Mousavi, K.S.M. Strategic, Tactical, and Operational Decision-Making in Crowd-Shipping; University of Toronto (Canada): Toronto, ON, Canada, 2022. [Google Scholar]
  263. Yuen, K.F.; Koh, L.Y.; Wong, Y.Q.; Wang, X. Sustainable crowdsourced delivery: A study of technological, health, value, and trust antecedents of consumer loyalty. J. Clean. Prod. 2023, 405, 137010. [Google Scholar] [CrossRef]
  264. Castillo, V.E.; Bell, J.E.; Rose, W.J.; Rodrigues, A.M. Crowdsourcing last mile delivery: Strategic implications and future research directions. J. Bus. Logist. 2018, 39, 7–25. [Google Scholar] [CrossRef]
  265. Pourrahmani, E.; Jaller, M. Crowdshipping in last mile deliveries: Operational challenges and research opportunities. Socio-Econ. Plan. Sci. 2021, 78, 101063. [Google Scholar] [CrossRef]
  266. Mohri, S.S.; Ghaderi, H.; Nassir, N.; Thompson, R.G. Crowdshipping for sustainable urban logistics: A systematic review of the literature. Transp. Res. Part E Logist. Transp. Rev. 2023, 178, 103289. [Google Scholar] [CrossRef]
  267. Azcuy, I.; Agatz, N.; Giesen, R. Designing integrated urban delivery systems using public transport. Transp. Res. Part E Logist. Transp. Rev. 2021, 156, 102525. [Google Scholar] [CrossRef]
  268. Juvigny, C.; Delle Donne, D.; Alfandari, L. A Genetic Approach to the Operational Freight-on-Transit Problem. In Proceedings of the Evolutionary Computation in Combinatorial Optimization (EvoCOP 2025); Lecture Notes in Computer Science; Springer: Berlin/Heidelberg, Germany, 2025; Volume 15610, pp. 116–132. [Google Scholar] [CrossRef]
  269. Bruzzone, F.; Cavallaro, F.; Nocera, S. Environmental and energy performance of integrated passenger–freight transport. Transp. Res. Interdiscip. Perspect. 2023, 19, 100958. [Google Scholar] [CrossRef]
  270. Kızıl, K.U.; Yıldız, B. Public transport-based crowd-shipping with backup transfers. Transp. Sci. 2023, 57, 174–196. [Google Scholar] [CrossRef]
  271. Delle Donne, D.; Alfandari, L.; Archetti, C.; Ljubić, I. Freight-on-Transit for urban last-mile deliveries: A strategic planning approach. Transp. Res. Part B Methodol. 2023, 169, 53–81. [Google Scholar] [CrossRef]
  272. Cheng, R.; Jiang, Y.; Nielsen, O.A. Integrated people-and-goods transportation systems: From a literature review to a general framework for future research. Transp. Rev. 2023, 43, 997–1020. [Google Scholar] [CrossRef]
  273. Tundulyasaree, K.; Martin, L.; Lieshout, R.v.; Woensel, T.V. Improving Service Quality of an Urban Rail Transit Line by Integrating Passenger and Freight Train Transportation. In Combinatorial Optimization and Applications: A Tribute to Bernard Gendron; Springer: Berlin/Heidelberg, Germany, 2024; pp. 449–478. [Google Scholar]
  274. Yang, X.; Nie, X.; Luo, H.; Huang, G.Q. Integrating parcel delivery schedules with public transport networks in urban co-modality systems. Comput. Oper. Res. 2024, 167, 106650. [Google Scholar] [CrossRef]
  275. Lin, J.; Zhang, F. Modular vehicle-based transit system for passenger and freight co-modal transportation. Transp. Res. Part C Emerg. Technol. 2024, 160, 104545. [Google Scholar] [CrossRef]
  276. El Amrani, A.M.; Fri, M.; Benmoussa, O.; Rouky, N. The integration of urban freight in public transportation: A systematic literature review. Sustainability 2024, 16, 5286. [Google Scholar] [CrossRef]
  277. Derse, O.; Van Woensel, T. Integrated people and freight transportation: A literature review. Future Transp. 2024, 4, 1142–1160. [Google Scholar] [CrossRef]
  278. Yu, S.; Puchinger, J.; Sun, S. Van-based robot hybrid pickup and delivery routing problem. Eur. J. Oper. Res. 2022, 298, 894–914. [Google Scholar] [CrossRef]
  279. Moradi, N.; Mafakheri, F.; Wang, C.; Baldacci, R. Robot-aided electric vehicle routing problem with lockers and prime customers prioritization. Eur. J. Oper. Res. 2025, 328, 1018–1035. [Google Scholar] [CrossRef]
  280. Pan, S.; Zhang, L.; Thompson, R.G.; Ghaderi, H. A parcel network flow approach for joint delivery networks using parcel lockers. Int. J. Prod. Res. 2021, 59, 2090–2115. [Google Scholar] [CrossRef]
  281. Vukićević, M.; Ratli, M.; Rivenq, A.; Zrikem, M. Covering delivery problem with electric vehicle and parcel lockers: Variable neighborhood search approach. Comput. Oper. Res. 2023, 157, 106263. [Google Scholar] [CrossRef]
  282. Song, L.; Wang, B.; Bian, Q.; Shao, L. Environmental benefits of using new last-mile solutions and using electric vehicles in China. Transp. Res. Rec. 2024, 2678, 473–489. [Google Scholar] [CrossRef]
  283. Boroujeni, N.M.; Moradi, N.; Jamalzadeh, S.; Boroujeni, N.M. Last-mile delivery optimization: Leveraging electric vehicles and parcel lockers for prime customer service. Comput. Ind. Eng. 2025, 203, 110991. [Google Scholar] [CrossRef]
  284. Yu, V.F.; Anh, P.T. The electric vehicle routing problem with time windows, partial recharges, and covering locations. Int. Trans. Oper. Res. 2025. [Google Scholar] [CrossRef]
  285. Schnieder, M.; Hinde, C.; West, A. Land efficient mobility: Evaluation of autonomous last mile delivery concepts in London. Int. J. Environ. Res. Public Health 2022, 19, 10290. [Google Scholar] [CrossRef]
  286. Moradi, N.; Mafakheri, F.; Wang, C. Covering routing problem with robots and parcel lockers: A sustainable last-mile delivery approach. In Proceedings of the IISE Annual Conference, Montreal, QC, Canada, 18–21 May 2024; Institute of Industrial and Systems Engineers (IISE): Norcross, GA, USA, 2024; pp. 1–6. [Google Scholar]
  287. Ulmer, M.W.; Streng, S. Same-day delivery with pickup stations and autonomous vehicles. Comput. Oper. Res. 2019, 108, 1–19. [Google Scholar] [CrossRef]
  288. He, Y.; Csiszár, C. Model for crowdsourced parcel delivery embedded into mobility as a service based on autonomous electric vehicles. Energies 2021, 14, 3042. [Google Scholar] [CrossRef]
  289. Dos Santos, A.G.; Viana, A.; Pedroso, J.P. 2-echelon lastmile delivery with lockers and occasional couriers. Transp. Res. Part E Logist. Transp. Rev. 2022, 162, 102714. [Google Scholar] [CrossRef]
  290. Ghaderi, H.; Zhang, L.; Tsai, P.W.; Woo, J. Crowdsourced last-mile delivery with parcel lockers. Int. J. Prod. Econ. 2022, 251, 108549. [Google Scholar] [CrossRef]
  291. Sawik, B. Optimizing Last-Mile Delivery: A Multi-Criteria Approach with Automated Smart Lockers, Capillary Distribution and Crowdshipping. Logistics 2024, 8, 52. [Google Scholar] [CrossRef]
  292. Zhang, M.; Cheah, L.; Courcoubetis, C. Exploring the potential impact of crowdshipping using public transport in Singapore. Transp. Res. Rec. 2023, 2677, 173–189. [Google Scholar] [CrossRef]
  293. De Maio, A.; Ghiani, G.; Laganà, D.; Manni, E. Sustainable last-mile distribution with autonomous delivery robots and public transportation. Transp. Res. Part C Emerg. Technol. 2024, 163, 104615. [Google Scholar] [CrossRef]
  294. Ghiani, G.; Guerriero, E.; Manni, E.; Pareo, D. Combining autonomous delivery robots and traditional vehicles with public transportation infrastructure in last-mile distribution. Comput. Ind. Eng. 2025, 203, 111001. [Google Scholar] [CrossRef]
  295. Zingler, F. A conceptual framework for integrating urban freight deliveries with public transportation and crowdsourcing. Transp. Res. Interdiscip. Perspect. 2025, 82, 1293–1312. [Google Scholar] [CrossRef]
  296. Yang, X.; Wu, W.; Huang, G.Q. A crowdsourced co-modality transportation system integrating passenger and freight. Adv. Eng. Inform. 2023, 58, 102142. [Google Scholar] [CrossRef]
  297. Gajda, M.; Gallay, O.; Mansini, R.; Ranza, F. Optimizing last-mile delivery through crowdshipping on public transportation networks. Transp. Res. Part C Emerg. Technol. 2025, 179, 105250. [Google Scholar] [CrossRef]
  298. Mohri, S.S.; Nassir, N.; Lavieri, P.S.; Thompson, R.G. Modeling package delivery acceptance in crowdshipping systems by public transportation passengers: A latent class approach. Travel Behav. Soc. 2024, 35, 100716. [Google Scholar] [CrossRef]
  299. Serafini, S.; Nigro, M.; Gatta, V.; Marcucci, E. Sustainable crowdshipping using public transport: A case study evaluation in Rome. Transp. Res. Procedia 2018, 30, 101–110. [Google Scholar] [CrossRef]
  300. Gatta, V.; Marcucci, E.; Nigro, M.; Serafini, S. Sustainable urban freight transport adopting public transport-based crowdshipping for B2C deliveries. Eur. Transp. Res. Rev. 2019, 11, 13. [Google Scholar] [CrossRef]
  301. Zhang, M.; Cheah, L. Prioritizing Outlier Parcels for Public Transport-Based Crowdshipping in Urban Logistics. Transp. Res. Rec. 2024, 2678, 601–612. [Google Scholar] [CrossRef]
  302. Fessler, A.; Thorhauge, M.; Mabit, S.; Haustein, S. A public transport-based crowdshipping concept as a sustainable last-mile solution: Assessing user preferences with a stated choice experiment. Transp. Res. Part A Policy Pract. 2022, 158, 210–223. [Google Scholar] [CrossRef]
  303. Mohri, S.S.; Nassir, N.; Thompson, R.G.; Lavieri, P.S. Public transportation-based crowd-shipping initiatives: Are users willing to participate? Why not? Transp. Res. Part A Policy Pract. 2024, 182, 104019. [Google Scholar] [CrossRef]
  304. Gobbi, A.; Mansini, R.; Moreschini, L.; Ranza, F. Optimal Locker Placement for Budget-Constrained Crowdshipping in Public Transport Networks. IFAC-PapersOnLine 2025, 59, 3041–3046. [Google Scholar] [CrossRef]
  305. Cheng, R.; Fessler, A.; Nielsen, O.A.; Larsen, A.; Jiang, Y. Assessing the potential impacts of public transport-based crowdshipping: A case study in a central district of Copenhagen. Front. Eng. Manag. 2024, 11, 697–709. [Google Scholar] [CrossRef]
  306. Wyrowski, A.; Boysen, N.; Briskorn, D.; Schwerdfeger, S. Public transport crowdshipping: Moving shipments among parcel lockers located at public transport stations. OR Spectr. 2024, 46, 873–907. [Google Scholar] [CrossRef]
  307. Maleki, M.; Rayburg, S.; Glackin, S. Demographic and Operational Factors in Public Transport-Based Parcel Locker Crowdshipping: A Mixed-Methods Analysis. Logistics 2025, 9, 55. [Google Scholar] [CrossRef]
  308. Karakikes, I.; Kepaptsoglou, K.; Milioti, C.; Stamos, I. Assessing the Impacts of Crowdshipping Using Public Transport: A Case Study in a Middle-Sized Greek City. Future Transp. 2022, 2, 55–83. [Google Scholar] [CrossRef]
  309. Mohri, S.S.; Nassir, N.; Thompson, R.G.; Lavieri, P.S.; Ghaderi, H. Crowd-shipping systems with public transport passengers: Operational planning. Transp. Res. Part E Logist. Transp. Rev. 2025, 194, 103916. [Google Scholar] [CrossRef]
Figure 1. The main steps of the review methodology of the present paper.
Figure 1. The main steps of the review methodology of the present paper.
Vehicles 07 00121 g001
Figure 2. PRISMA-style screening and inclusion flow ( N ta : the number title/abstract exclusions; N ft : the number full-text exclusions).
Figure 2. PRISMA-style screening and inclusion flow ( N ta : the number title/abstract exclusions; N ft : the number full-text exclusions).
Vehicles 07 00121 g002
Figure 3. The proposed classification scheme from the OR perspective.
Figure 3. The proposed classification scheme from the OR perspective.
Vehicles 07 00121 g003
Table 1. Goal–technique–metric map for sustainable LMD.
Table 1. Goal–technique–metric map for sustainable LMD.
Decision LayerTechnique ClassPrimary GoalsModeling FeatureTypical Metrics
Strategic (siting, sizing)Exact MILP/BendersCost, equityNetwork design with capacity/access; policy transparencyTotal cost; coverage share; average walking distance
Strategic-tactical (EV infrastructure + routing)Decomposition (CG, Lagrange)Cost, emissionsLocation-routing split; resource-constrained pathsCost; kWh; CO2; solver bounds/gaps
Tactical (routing/scheduling)Matheuristics and metaheuristicsCost, emissions, serviceEnergy/battery, time windows, synchronization neighborhoodsCost; on-time rate; energy; runtime vs. instance size
Operational (real-time dispatch)Rolling-horizon + learningService, resiliencePrediction (arrival times, acceptance), receding horizon controlOn-time %; average delay; recovery time; re-optimization count
Cross-cutting (uncertainty)Stochastic/robust optimizationResilience, serviceScenario recourse; uncertainty sets; risk measuresLateness; worst-case regret; service reliability
Evaluation (trade-offs)Multi-objective (e.g., Non-dominated Sorting Genetic Algorithm (NSGA-II), ϵ -constraint)Cost, emissions, service balancePareto set construction; decision supportPareto spread; dominance counts; knee points
Table 2. Sustainability dimensions: example metrics and OR modeling levers.
Table 2. Sustainability dimensions: example metrics and OR modeling levers.
DimensionExample Metrics (Units)Typical OR Levers (Objective/Constraints)Data/Proxies
PlanetCO2e per parcel; energy (kWh/parcel); NOx, PM (g/km); noise (dB); congestion proxy (empty vehicle kilometers traveled, curb dwell minutes)Minimize emissions/energy; cap local pollutants/noise; penalize curb dwell; ϵ -constraint on CO2eTelematics traces; emission factors; noise maps; traffic data
PeopleAccess equity (population within 400–800 m of PL/PP); average walking distance; service reliability (failed deliveries, on-time %); safety proxies (conflicts per 100k stops)Maximize coverage/equity; bound walking distance; penalize failures/lateness; soft/hard time windowsCensus/land-use; locker/PP usage; carrier KPIs; curb/incident logs
ProfitTotal generalized cost; unit cost (USD/parcel); asset utilization (%); on-time service (as viability)Minimize cost; capacity/crew constraints; service-level constraints; fleet sizingCost ledgers; depot/crew schedules; demand forecasts
Resilience (cross-cutting)Lateness; worst-case regret; recovery time; feasibility under perturbationsTwo-stage stochastic or robust optimization; rolling-horizon recourse; buffer/slack constraintsDelay distributions; demand uncertainty; scenario sets
Table 3. Comparative view of OR techniques across ground-based LMD innovations.
Table 3. Comparative view of OR techniques across ground-based LMD innovations.
SettingTypical Model StructureBenefits in PracticeDrawbacks/LimitsScalability/Runtime
EVsMILP with energy and charging; time windowsExplicit feasibility respecting the SoC, time; interpretable costs and constraints; suitable for sensitivity and policy testingExact methods degrade with tight time windows and nonlinear charging; parameter uncertainty increases solve timesExact: small/medium; metaheuristics: large (hundreds-thousands stops) with near-optimal solutions in minutes/hours
ADRsMILP with synchronization, launch/retrieval, coupled capacityCaptures timing and resource coupling; supports what-if on robot counts and speedsSynchronization explodes state space; exact methods scale poorly; requires reliable travel/handling timesMatheuristics/decomposition: medium instances; hybrid heuristics: larger with good gaps
PLsBi-level or joint location-routing MILPFewer failed deliveries; consolidates stops; amenable to strategic-operational splitsCoupling of siting and tours is hard; stochastic demand and compartment sizes complicate feasibilityDecomposition or matheuristics handle city-scale; exact is moderate scale if decoupled
PPsFacility location + routing MILPLeverages existing retail; simple policies possibleLimited hours; human factors; less secure than lockersSimilarly to PL; heuristics scale well; exact limited by time windows
CSStochastic/rolling-horizon assignment + routingFast surge capacity; good in peak and sparse areas; platform data enables learningAcceptance uncertainty; reliability; pricing incentives couple to routingMyopic + learning or CG with heuristics scale; full stochastic exact is small
FOTNetwork design + time-expanded MILP; two-stage modelingUses existing capacity; emissions savings; robust for dense corridorsTimetable synchronization; station handling; passenger interferenceDecomposition + CG scale; exact monoliths limited
Combined solutionsMulti-layer MILP with synchronization, location-routing, assignment; two-stage modeling; set-partitioning/CG; rolling-horizon controlSynergies from pooling and flexible hand-offs; shifts curb time to lockers; robust under demand spikes; supports multi-objective trade-offs (cost-energy-service)Strongly coupled decisions (siting-routing-synchronization) inflate state space; more data/parameters to calibrate; higher orchestration complexityCity-scale via matheuristics + decomposition (ALNS/VNS + Benders/CG) heuristics; exact feasible only for small pilot networks
Table 4. Representative practice cases and implementation evidence across ground-based LMD. Tags: [obs.] observed/operational, [pilot] pilot-scale, [proj.] model-projected.
Table 4. Representative practice cases and implementation evidence across ground-based LMD. Tags: [obs.] observed/operational, [pilot] pilot-scale, [proj.] model-projected.
SettingGeography/ScaleDesign/ConstraintsReported Outcomes (tag)Source(s)
EV fleet adoption (retail delivery)U.S., multi-cityRetail EV deployment; depot-charger alignment; partial charging in operationsEmissions reduction potential; curb/charging constraints binding in practice [obs.]/[proj.][13]
ADR + modular lockers (routing/siting)London, U.K.Road-based autonomous lockers vs. fixed lockers; weekly modular adjustmentModular lockers outperform fixed under moderate-high demand; fewer failed deliveries [proj.]; limited trials [pilot][285]
PL network expansionNorway, national rolloutMulti-period siting with real demand; environmental accountingLower delivery externalities; improved access and service reliability [obs.]/[proj.][194]
Collection/Delivery Points (PP/CDP)Belgium, nationwideAccessibility/coverage analysis; walking-distance equityLarge coverage gaps without multi-carrier CDPs; policy guidance [obs.][209]
Crowd-tasking using commuter flowsSingapore/Beijing, city-scale datasetsNetwork min-cost flow; citizens deliver along commutesHigh scalability/coverage using existing mobility; strong matching rates [obs.]/[proj.][237]
CS with relay pointsXi’an, China2-echelon truck→relay→crowd; nested GA selection/routing∼14% total cost and ∼26% VMT reductions vs. truck-only [proj.][225]
FOT (people+goods)Rome, ItalyIntegration with mass transit; safety/emissions accountingSubstantial projected drops in emissions and accidents [proj.][255]
White-label lockers (alBOX pilot)Austria, urban + rural pilotsMulti-carrier lockers; user acceptance and behaviorOperational feasibility; usage patterns; social acceptance insights [pilot]/[obs.][196]
ADR (street+sidewalk)Barcelona, ES (dense urban core; mixed sidewalk/road)Prototype build + city pilots; perception/navigation for street-sidewalk operation; safety + teleop fallback; operational envelope definition; curb/sidewalk integration with municipal infraReported lessons on infrastructure interfaces, HRI/etiquette, and regulatory coordination; demonstrates practical feasibility and integration considerations for ADR deployments [pilot][143]
ADR (sidewalk navigation)Singapore (NTU campus sidewalks)Husky platform + RGB-D; Nanyang Sidewalk dataset; social-force-guided intent prediction; state-lattice planner with etiquette costShows how human-space etiquette can be encoded in local planning for ADRs, informing micro-level constraints for OR models [obs.][148]
ADR (city pilot)European city (pilot)Pilot design; stakeholder alignment; regulatory coordination; infra readiness; change managementActionable recommendations for scoping use cases and city coordination; complements optimization with deployment guidance [pilot][151]
PT-based CS + PLRome (city)Feasibility and willingness analyses; APLs near PT stations; leverages spare capacityViable under PL siting and participation assumptions [proj.][299]
PT-based CS + PLRome (city)Stated-preference demand/supply; compensation and detour constraintsParticipation conditions and policy levers identified [proj.][300]
PT-based CSSingapore (city)System-level scenario analysis; participation and station-capacity constraintsLower carrier CO2 and operating effort; capacity/uptake are bottlenecks [proj.][292]
PT-based CS + PL (outlier parcels)Singapore (city)LOF-based parcel prioritization; locker siting; carrier CVRP evaluationUp to 11% parcels diverted with 31 lockers; ∼20% cost cut; CO2 down [proj.][301]
PT-based CSCopenhagen (city)Stated-choice ( n = 524 ); mixed-logit acceptance model; extra-time/compensation constraintsAcceptance elasticities and target segments for design [proj.][302]
PT-based CS + PL + carrier VRPCopenhagen (district)Budgeted PL siting at PT; downstream carrier VRP; availability constraintsFewer vans, reduced VKT and driver hours; crowdshipper availability is binding [proj.][305]
PT-based CSSydney (metro)Latent-class acceptance model ( n = 2208 ); incentive/weight/detour constraintsSegment-specific participation propensities to embed in OR models [proj.][298]
PT-based CS + PLVolos, Greece (city)City-scale microsimulation; locker siting near PT; participation-rate scenariosImpact reductions feasible; strong sensitivity to participation and siting [proj.][308]
Parcels on fixed-route buses (FOT)Zrenjanin, Serbia (city)Stakeholder-informed energy/environmental simulation; policy/energy-mix scenariosImproved energy and environmental performance vs. truck-only [proj.][269]
Mobile vs. stationary PLs vs. homeEU/General (synthetic)Operational design; dwell-time/coverage policies; emissions-cost trade-offsMPLs outperform stationary/home under suitable policies; CO2/cost-benefits [proj.][199]
PT-CS via locker-to-locker handoversSubway network (synthetic)Multi-hop parcel relays at PT lockers; decomposition heuristic; delay robustnessHandover-enabled plans beat single-carrier paths; higher robustness [proj.][306]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Moradi, N.; Mafakheri, F.; Wang, C. A Systematic Review of Sustainable Ground-Based Last-Mile Delivery of Parcels: Insights from Operations Research. Vehicles 2025, 7, 121. https://doi.org/10.3390/vehicles7040121

AMA Style

Moradi N, Mafakheri F, Wang C. A Systematic Review of Sustainable Ground-Based Last-Mile Delivery of Parcels: Insights from Operations Research. Vehicles. 2025; 7(4):121. https://doi.org/10.3390/vehicles7040121

Chicago/Turabian Style

Moradi, Nima, Fereshteh Mafakheri, and Chun Wang. 2025. "A Systematic Review of Sustainable Ground-Based Last-Mile Delivery of Parcels: Insights from Operations Research" Vehicles 7, no. 4: 121. https://doi.org/10.3390/vehicles7040121

APA Style

Moradi, N., Mafakheri, F., & Wang, C. (2025). A Systematic Review of Sustainable Ground-Based Last-Mile Delivery of Parcels: Insights from Operations Research. Vehicles, 7(4), 121. https://doi.org/10.3390/vehicles7040121

Article Metrics

Back to TopTop