<?xml version="1.0" encoding="UTF-8"?>
<article xmlns:xlink="http://www.w3.org/1999/xlink">
<front><article-meta>
<title-group><article-title>Optimizing Last-Mile Delivery with Crowdshipping and Considering Carriers&apos; Acceptance Probability</article-title></title-group>
<contrib-group>
<contrib contrib-type="author"><name><surname>Bagheri Ghadikolaei</surname><given-names>Majid</given-names></name><xref ref-type="aff" rid="aff1"/></contrib>
<contrib contrib-type="author"><name><surname>Aghaei</surname><given-names>Abdollah</given-names></name><xref ref-type="aff" rid="aff1"/></contrib>
<aff id="aff1">Department of Industrial Engineering, K. N. Toosi University of Technology, Tehran, Iran.</aff>
</contrib-group>
<abstract><p>The rapid growth of digital businesses in recent years, along with the inherent complexity of Last-Mile Delivery (LMD), has posed significant challenges to urban logistics in terms of cost, traffic congestion, and environmental pollution. This study develops a mathematical model that assigns parcel delivery tasks (via delivery lockers) to Public Transport (PT) passengers and Ride-Hailing Vehicles (RHVs) using a crowdshipping approach. The objective is to optimize both logistics and environmental costs. Because crowdshipping carriers may accept delivery requests with uncertainty, a logit model predicts the probability of accepting a given delivery offer based on parcel characteristics. This probability is incorporated into the objective function of a Mixed-Integer Programming (MIP) formulation as an expected cost of non-acceptance. To estimate the behavioral parameters, a fractional factorial design was used to construct a twelve-scenario stated-preference survey. We collected 200 responses from PT passengers and RVH drivers and used them to calibrate the logit model coefficients. We then solved a numerical example in Python using the PuLP optimization library. The results indicate that PT passengers are more sensitive to financial incentives, while RVH drivers are more sensitive to parcel volume. We explicitly integrated these differences into the objective function, and the findings show that neglecting carrier behavior can significantly affect decision-making and potentially lead to misleading &quot;optimal&quot; solutions. Overall, the proposed framework enables smarter and more sustainable management of LMD systems.</p></abstract>
<kwd-group kwd-group-type="author"><kwd>Last-mile delivery</kwd><kwd>Delivery lockers</kwd><kwd>Crowdshipping</kwd><kwd>Logit model</kwd><kwd>Urban logistics</kwd></kwd-group>
</article-meta></front>
<body>
<sec id="sec-1"><label>1</label><title>Introduction</title>
<p>The exponential growth of e-commerce, particularly following global pandemics, has revolutionized purchasing patterns while placing unprecedented pressure on urban logistics systems, especially the costly and complex Last-Mile Delivery (LMD) stage. The increasing volume of parcels, customers&apos; expectations for faster delivery (same-day or within a few hours), and the need for cost-effective solutions have intensified the challenges logistics companies face. These challenges increasingly highlight the need to move away from traditional logistics models toward innovative and sustainable solutions. In response, various approaches have gained attention, including alternative delivery points such as parcel lockers, crowdshipping models, and the integration of freight and passenger transportation. However, each of these solutions alone cannot address all dimensions of the problem. This study focuses on a novel hybrid solution that strategically integrates the unused capacities of Ride-Hailing Vehicles (RHVs), the voluntary participation of Public Transport (PT) passengers, and a parcel locker network, while considering the probability of parcel acceptance by carriers, to establish a flexible, efficient, and sustainable last-mile logistics system. This study&apos;s results are expected to provide valuable managerial insights for logistics companies and urban policymakers to improve efficiency, reduce costs, and move toward more sustainable urban transportation systems.</p>
</sec>
<sec id="sec-2"><label>2</label><title>Problem Statement</title>
<p>The growing demand for fast and cost-effective delivery, alongside the expansion of e-commerce, has created significant challenges for urban logistics systems. The increasing volume of deliveries has led to higher freight vehicle traffic, urban congestion, increased operating costs, and adverse environmental impacts. In this context, utilizing the unused capacities of RHVs and the voluntary participation of PT passengers have emerged as innovative approaches for addressing these challenges. These approaches, developed within the framework of integrated parcel and passenger transportation systems, have considerable potential to reduce delivery costs, improve resource utilization, and mitigate environmental impacts. In such systems, parcels are transported from their origins, such as warehouses or distribution centers, to their final destinations, such as customers&apos; homes. Intermediate parcel lockers can also be used as storage and transfer points, allowing parcels to be transported from an origin to a locker and subsequently from the locker to their final destinations. A key challenge in designing such an integrated system is the effective management of vehicle and passenger routes under capacity constraints. Each RHV or PT passenger has a predetermined origin and destination and can deviate from their original route only within a limited range. Moreover, the weight and volume capacities available for carrying parcels are limited. Therefore, these constraints must be incorporated into the parcel assignment process to ensure the feasibility of transportation decisions and prevent impractical assignments. In addition to these operational constraints, user behavior and the probability of parcel acceptance represent another critical aspect of the system. The willingness of PT passengers to accept parcels may depend on factors such as parcel weight and volume, the extent of route deviation, and the financial incentive offered. Similarly, for RHVs, parcel acceptance may be influenced by operational factors, including vehicle capacity, fuel costs, and the extent of route deviation. Ignoring these acceptance probabilities may result in assignments that are theoretically feasible but impractical from the perspective of carriers. Accordingly, an effective decision-making framework should simultaneously consider transportation routes, capacity limitations, route deviations, and the probability of parcel acceptance by different types of carriers. In this context, the proposed model aims to efficiently utilize existing transportation capacities while minimizing total system costs, improving service quality, and optimizing resource utilization. Furthermore, the model seeks to enhance carrier satisfaction by limiting unnecessary route deviations and providing appropriate financial incentives. By integrating these considerations within a unified framework, the proposed approach aims to provide a practical basis for developing a flexible and efficient LMD system that can better exploit existing urban transportation resources.</p>
</sec>
<sec id="sec-3"><label>3</label><title>Literature Review</title>
<p>The rapid growth of e-commerce and customers&apos; increasing expectations for fast and reliable delivery have created significant challenges in the field of LMD, particularly in urban environments <xref ref-type="bibr" rid="ref-1">[1]</xref>, <xref ref-type="bibr" rid="ref-2">[2]</xref>. As the most costly and complex component of the supply chain, LMD requires innovative solutions to improve efficiency, reduce costs, and mitigate environmental impacts <xref ref-type="bibr" rid="ref-3">[3]</xref>, <xref ref-type="bibr" rid="ref-4">[4]</xref>. In recent years, three main approaches have emerged in the literature as promising solutions: the use of parcel lockers, the adoption of crowdshipping, and the integration of passenger and freight transportation. This section reviews the existing research in these three areas and highlights the research gaps that motivate the present study. Parcel lockers, as automated pickup and delivery points, are recognized as an effective solution for increasing customer flexibility and improving last-mile logistics efficiency <xref ref-type="bibr" rid="ref-5">[5]</xref>, <xref ref-type="bibr" rid="ref-6">[6]</xref>. By reducing the need for recipients to be present and consolidating deliveries, parcel lockers have the potential to reduce operating costs, failed deliveries, and adverse environmental impacts such as traffic congestion and pollution <xref ref-type="bibr" rid="ref-4">[4]</xref>, <xref ref-type="bibr" rid="ref-7">[7]</xref>, <xref ref-type="bibr" rid="ref-8">[8]</xref>. Research in this area has addressed several dimensions of parcel locker systems. Early studies examined the financial and operational performance of different locker configurations, including Schneider et al.&apos;s comparison of fixed and modular lockers <xref ref-type="bibr" rid="ref-9">[9]</xref> and studies addressing service pricing <xref ref-type="bibr" rid="ref-10">[10]</xref>. A substantial body of research has subsequently focused on network design and the optimal location of parcel lockers, including the development of two-level mathematical models <xref ref-type="bibr" rid="ref-7">[7]</xref>, consideration of customer choices and preferences <xref ref-type="bibr" rid="ref-3">[3]</xref>, <xref ref-type="bibr" rid="ref-5">[5]</xref>, and the application of multi-criteria decision-making methods for location selection based on accessibility, sustainability, and security criteria <xref ref-type="bibr" rid="ref-11">[11]</xref>, <xref ref-type="bibr" rid="ref-12">[12]</xref>. More recently, researchers have investigated the integration of parcel lockers with other delivery solutions. These studies have considered lockers as intermediate nodes in two-level delivery systems involving temporary couriers or crowdshipping <xref ref-type="bibr" rid="ref-13">[13]</xref>, <xref ref-type="bibr" rid="ref-20">[14]</xref>, integration with Autonomous Mobile Lockers (AMLs) <xref ref-type="bibr" rid="ref-15">[15]</xref>, and incorporation into PT networks <xref ref-type="bibr" rid="ref-16">[16]</xref>. The impacts of parcel locker systems on customer satisfaction <xref ref-type="bibr" rid="ref-5">[5]</xref>, courier operating time <xref ref-type="bibr" rid="ref-6">[6]</xref>, and carbon emissions <xref ref-type="bibr" rid="ref-4">[4]</xref>, <xref ref-type="bibr" rid="ref-8">[8]</xref> have also been examined. Another promising approach to improving LMD is crowdshipping, which relies on ordinary individuals as temporary carriers to transport parcels. Research in this area has primarily focused on operational optimization, including the development of minimum-cost flow models <xref ref-type="bibr" rid="ref-17">[17]</xref> and the joint optimization of parcel assignment to intermediate points and crowd-courier routing using advanced algorithms <xref ref-type="bibr" rid="ref-18">[18]</xref>. The integration of crowdshipping with existing transportation infrastructure, particularly public transportation and parcel lockers, has emerged as an important research direction. Studies have investigated the potential and challenges of such integrated systems using stated-preference surveys <xref ref-type="bibr" rid="ref-19">[19]</xref> and various optimization approaches, including Stochastic Programming (SP) <xref ref-type="bibr" rid="ref-21">[20]</xref>, genetic algorithms <xref ref-type="bibr" rid="ref-22">[21]</xref>, and multi-objective optimization <xref ref-type="bibr" rid="ref-23">[22]</xref>, as well as field experiments <xref ref-type="bibr" rid="ref-16">[16]</xref>. Beyond operational planning, understanding carriers&apos; behavior and willingness to participate is critical to the practical implementation of crowdshipping systems. Accordingly, discrete choice and latent class models have been employed to analyze factors influencing task acceptance among PT passengers, including financial incentives, task characteristics, and demographic and attitudinal factors <xref ref-type="bibr" rid="ref-24">[23]</xref>, <xref ref-type="bibr" rid="ref-25">[24]</xref>. In parallel with crowdshipping, the utilization of unused capacity in passenger vehicles for simultaneous freight transportation has been investigated as another means of improving the efficiency of urban transportation resources. A substantial portion of the early literature focused on modeling and solving the Shared Autonomous Ride Problem (SARP) in taxi systems. Li et al. <xref ref-type="bibr" rid="ref-26">[25]</xref>, <xref ref-type="bibr" rid="ref-27">[26]</xref>, for example, developed approaches based on Mixed-Integer Linear Programming (MILP), Adaptive Large Neighborhood Search (ALNS), and SP. Subsequent studies extended and improved these models and solution methods, including extensions to the simultaneous transportation of multiple passengers and parcels, such as the Generalized SARP (G-SARP) <xref ref-type="bibr" rid="ref-28">[27]</xref>, and the application of advanced metaheuristic approaches, including the integration of SAMS and SP <xref ref-type="bibr" rid="ref-29">[28]</xref> and the combination of ALNS with Ant Colony Optimization (ACO) <xref ref-type="bibr" rid="ref-30">[29]</xref>. The integration of emerging technologies and alternative vehicle fleets has also received attention, including autonomous vehicles <xref ref-type="bibr" rid="ref-31">[30]</xref>, mixed electric and gasoline-powered fleets <xref ref-type="bibr" rid="ref-28">[27]</xref>, and electric taxis with intelligent management based on reinforcement learning <xref ref-type="bibr" rid="ref-32">[31]</xref>. Furthermore, the potential for incorporating public transportation modes, such as buses <xref ref-type="bibr" rid="ref-33">[32]</xref>, <xref ref-type="bibr" rid="ref-34">[33]</xref>, and integrating ride-hailing services with other transportation modes, such as electric motorcycles <xref ref-type="bibr" rid="ref-35">[34]</xref>, has been explored. Overall, the literature demonstrates that parcel lockers, crowdshipping, and the integration of freight and passenger transportation each offer considerable potential for improving the efficiency and sustainability of LMD. Nevertheless, a notable research gap remains in the simultaneous integration of these three approaches within a comprehensive and unified logistics system. In particular, while previous studies have examined combinations of two or more of these approaches, limited attention has been given to a framework that jointly incorporates a parcel locker network, RHVs, and PT passengers. Moreover, most existing models do not explicitly account for the inherent uncertainty associated with carriers&apos; willingness to accept delivery tasks. This issue is particularly important in crowdshipping systems, where transportation capacity depends not only on physical constraints but also on the behavioral decisions of potential carriers. In addition, there is a need for integrated models capable of addressing the trade-offs among conflicting economic, environmental, and service-related objectives, including timely delivery. To address these gaps, this study develops a mathematical optimization model that integrates a parcel locker network with RHV and PT carriers within a unified LMD framework. The proposed approach explicitly incorporates carriers&apos; acceptance probabilities by using a logit model, thereby accounting for behavioral uncertainty in parcel assignment decisions. Furthermore, the model considers operational constraints, such as vehicle and passenger capacity and route deviations, while optimizing a multi-component objective function that incorporates economic and environmental costs. Through this integrated framework, the study seeks to provide a more comprehensive approach to the design and operation of flexible, efficient, and sustainable LMD systems.</p>
</sec>
<sec id="sec-4"><label>4</label><title>Model Description</title>
<p>The proposed model aims to determine an optimal operational strategy for the allocation and transportation of parcels by simultaneously exploiting the available capacities of RHVs, PT passengers, and a network of parcel lockers. The model is designed to provide an efficient response to the challenges of urban last-mile logistics by minimizing the expected total system cost while improving service efficiency. To this end, the proposed logistics system is formulated as a Mixed-Integer Programming (MIP) model that integrates the physical, operational, and behavioral characteristics of the different components involved in the delivery process.</p>
<p>The main components of the modeled logistics system include parcels, parcel lockers, RHVs, and PT passengers. Parcels (P) represent the basic units of freight flow. Each parcel has a predefined origin, which is the central warehouse, a final destination, and physical characteristics, including weight (w) and volume (v). Parcel lockers (L) serve as intermediate facilities for the temporary storage and transfer of parcels. Each locker facility (l) includes a set of individual lockers (Bl), each with a specified weight and volume capacity (QwLocker l,b , QvLocker l,b ). RHV drivers (K) and PT passengers (M) act as carriers in the second stage of the delivery process. Each carrier has a predetermined route from an origin (O) to a destination (D), a limited weight and volume carrying capacity (Qv , Qw ), and a maximum allowable deviation from their original route, denoted by</p>
<p>passenger RVH</p>
<p>(Δm ،Δk ), respectively, for the corresponding carrier types.</p>
<p>In addition to these physical and operational characteristics, the model explicitly considers the uncertainty associated with carriers&apos; willingness to accept parcel delivery tasks. This behavioral aspect is particularly important for PT passengers, whose participation is voluntary and who may reject a proposed parcel. To represent this selective behavior, a logit model is employed to estimate the probability of parcel acceptance (Plp) by a given carrier. The acceptance probability is determined as a function of key factors influencing carriers&apos; decisions, including the physical characteristics of the parcel, such as its weight and volume, the extent of route deviation required to transport the parcel, and the attractiveness of the financial incentive offered. Incorporating this probability into the optimization model allows carrier behavior and the uncertainty associated with parcel acceptance to be considered when making allocation decisions.</p>
<p>The delivery process is modeled as a two-stage transportation system. In the first stage, parcels are transported from the central warehouse to one of the selected parcel lockers in the network, incurring an initial transportation cost (C1). In the second stage, parcels stored at the lockers are transported to their final destinations by available RHV or PT carriers. A parcel can be assigned to a carrier only if the carrier passes sufficiently close to the corresponding locker along their original route, satisfies the relevant capacity and route-deviation constraints, and is willing to accept the delivery task. Thus, the proposed structure enables the system to exploit existing transportation capacities while using parcel lockers as intermediate transfer points between the warehouse and final destinations.</p>
<p>Based on this structure, the primary objective of the model is to minimize the expected total system cost. The objective function incorporates four main cost components. The first is the initial transportation cost, which represents the cost of transporting each parcel from the central warehouse to a parcel locker. The second is the environmental cost, which is calculated based on the additional distance traveled by carriers to pick up and deliver parcels. The third component is the carrier operating cost or incentive cost, which represents the financial incentives paid to RHV drivers and PT passengers to encourage their participation in parcel transportation. The fourth component is the parcel non-acceptance cost, which accounts for parcels that are not assigned to any locker in the first stage, as well as parcels that are assigned to a locker but are not subsequently accepted by any available carrier.</p>
<p>To determine the optimal allocation decisions, the model employs a set of binary decision variables. The variable (zp,l,b) determines whether parcel (p) is assigned to locker (b) within locker facility (l). The binary variable (yp,l,b,m) takes a value of 1 if parcel (p) is picked up from locker (b) within locker facility (l) by PT passenger (m). Similarly, the binary variable (xp,l,b,k) determines whether parcel (p) is picked up from locker (b) within locker facility (l) by RHV (k). These decision variables establish the assignment relationships among parcels, lockers, RHV carriers, and PT passengers and form the basis for determining the optimal transportation plan. The feasibility and operational performance of the proposed system are governed by a set of constraints addressing flow, assignment, capacity, and route-deviation requirements. Flow and assignment Constraints (10), (11), and (19) ensure that each parcel is assigned to at most one locker and, if assigned to a locker, is subsequently picked up by at most one carrier. Capacity Constraints (12)-(17) ensure that the total weight and volume of parcels assigned to each locker and carrier do not exceed their respective capacities. Route-deviation Constraints (18) and (19) ensure that the deviation required for a carrier to pick up and deliver a parcel does not exceed the maximum allowable deviation for that carrier. Together, these constraints ensure that the resulting allocation decisions remain physically feasible and operationally consistent.</p>
<p>Finally, the model is developed based on several simplifying assumptions. First, all information required for decision-making, including the locations, parcel characteristics, and carrier characteristics, is assumed to be fully available. Second, the operating and environmental costs associated with carriers are assumed to be fixed and independent of traffic conditions. Third, Manhattan distance is used to calculate transportation and route-deviation distances. These assumptions provide a tractable modeling framework while retaining the main operational and behavioral characteristics of the proposed integrated LMD system.</p>
</sec>
<sec id="sec-5"><label>5</label><title>Mathematical Model</title>
<sec id="sec-6"><title>Sets</title>
<p>P: Set of parcels (p ∈ P).</p>
<p>K: Set of RHVs (k ∈ K).</p>
<p>M: Set of PT passengers (m ∈ M).</p>
<p>L: Set of lockers (l ∈ L).</p>
<p>Bl: Set of lockers available at locker facility l (⊆bBl).</p>
<p>D: Set of warehouses (d ∈ D).</p>
<p>Parameters</p>
</sec>
<sec id="sec-7"><title>Parcel characteristics</title>
<p>Op ∈ D ∀p ∈ P: Warehouse d is the origin of parcel p.</p>
<p>Dp = (xp dest, yp dest) : Coordinates of the destination of package p.</p>
<p>wp: Weight of package p.</p>
<p>vp: Volume of package p.</p>
</sec>
<sec id="sec-8"><title>Warehouse characteristics</title>
<p>Ostock d : (xd, yd).</p>
</sec>
<sec id="sec-9"><title>Characteristics of lockers and compartments</title>
<p>Olocker l = (xl, yl): Coordinates of locker l.</p>
<p>QwLocker l,b : Weight capacity of compartment b in locker l.</p>
<p>QvLocker l,b : Volume capacity of compartment b in locker l.</p>
</sec>
<sec id="sec-10"><title>Costs</title>
<p>C1: Parcel transportation cost from the warehouse to the locker per unit distance.</p>
<p>C2: Return cost.</p>
<p>C3 : Cost of reshipping parcels.</p>
<p>C4: Penalty for unassigned parcels.</p>
<p>C5: Penalty for packages not being accepted by carriers.</p>
<p>Passenger</p>
<p>fm : Operating cost of passenger m per unit distance.</p>
<p>fk RHV: Transportation cost of vehicle n per unit distance.</p>
<p>Passenger</p>
<p>em : Greenhouse gas emissions cost of passenger m per unit distance.</p>
<p>eRHV k : Greenhouse gas emissions cost of vehicle k per unit distance.</p>
</sec>
<sec id="sec-11"><title>Passenger characteristics</title>
<p>Passenger</p>
<p>Om = (xOm, yOm) : Coordinates of the origin of passenger m.</p>
<p>Passenger</p>
<p>Dm = (xDm, yDm): Coordinates of the destination of passenger m.</p>
<p>wPassenger</p>
<p>Qm : Maximum weight that can be carried by passenger m.</p>
<p>vPassenger</p>
<p>Qm : Maximum volume that can be carried by passenger m.</p>
<p>passenger</p>
<p>Δm : Maximum allowable route deviation for passenger m.</p>
</sec>
<sec id="sec-12"><title>Vehicle characteristics</title>
<p>ORHV k = (xOk, yOk) : Coordinates of the origin of vehicle k.</p>
<p>DRHV k = (xDk, yDk): Coordinates of the destination of vehicle k.</p>
<p>QwRHV k : Maximum weight capacity of vehicle k.</p>
<p>QvRHV k : Maximum volume capacity of vehicle k.</p>
<p>ΔRHV k : Maximum allowable route deviation for vehicle k.</p>
</sec>
<sec id="sec-13"><title>Logit model</title>
<p>passenger</p>
<p>πlmp : Probability of passenger m accepting package p from locker l.</p>
<p>πRHV lkp : Probability of vehicle k accepting package p from locker l.</p>
<p>Plp: Overall probability of accepting package p from locker l.</p>
</sec>
<sec id="sec-14"><title>Behavioral parameters</title>
<p>Utility coefficients for public transportation passengers:</p>
<p>β1 : Incentives.</p>
<p>β2: Cargo volume.</p>
<p>β3: Cargo weight.</p>
<p>β4: Route deviation.</p>
<p>Utility coefficients for ride-hailing services:</p>
<p>γ1: Incentives.</p>
<p>γ2: Cargo volume.</p>
<p>γ3: Cargo weight.</p>
<p>γ4: Route deviation.</p>
</sec>
<sec id="sec-15"><title>Decision variables</title>
<p>zp,l,b: A binary variable that equals 1 if parcel p is assigned to compartment b in locker l.</p>
<p>yp,l,b,m: A binary variable that equals 1 if parcel p is picked up from compartment b in locker l by passenger</p>
<p>xp,l,b,k: A binary variable that equals 1 if parcel p is picked up from compartment b in locker l by vehicle k.</p>
</sec>
<sec id="sec-16"><title>Distance calculations</title>
<p>Distance between the locker and the passenger&apos;s origin:</p>
<p>dOlocker,OPassenger = |xl − xOm| + |yl − yOm|. (1)</p>
<p>Distance between the locker and the package destination:</p>
<p>dOlocker,Dp = |xl − xDp| + |yl − yDp|. (2)</p>
<p>Distance between the passenger&apos;s destination and the parcel destination:</p>
<p>dDPassenger m ,Dp = |xDm − xDp| + |yDm − yDp|. (3)</p>
<p>Distance between the locker and the vehicle&apos;s origin:</p>
<p>dOlocker l ,ORHV k = |xl − xOk| + |yl − yOk|. (4)</p>
<p>Distance between the parcel destination and the vehicle&apos;s destination:</p>
<p>dDRHV k ,Dp = |xDk − xDp| + |yDk − yDp|. (5)</p>
<p>Distance between the passenger&apos;s origin and destination:</p>
<p>dDPassenger m ,OPassenger m = |xDm − xOm| + |yDm − yOm|. (6)</p>
<p>Distance between the vehicle&apos;s origin and destination:</p>
<p>dDRHV k ,ORHV k = |xDk − xOk| + |yDk − yOk|. (7)</p>
<p>Distance between the locker and the warehouse:</p>
<p>DOlocker l ,Ostock Op = |xl − xd| + |yl − yd|. (8)</p>
</sec>
<sec id="sec-17"><title>Objective function</title>
<p>Represents the objective function for minimizing the total system costs:</p>
<p>Minimize Z = ∑ ∑ ∑ C1 ⋅ zp,l,b ⋅ dOlocker,Ostock</p>
<p>l Op</p>
<p>p∈P l∈L b∈Bl Passenger Passenger</p>
<p>+ ∑ ∑ ∑ ∑ (fm + em ) ⋅ yp,l,b,m ⋅ (dOl,Om + dOl,Dp)</p>
<p>p∈P l∈L b∈Bl m∈M</p>
<p>+ ∑ ∑ ∑ ∑(fk RHV + eRHV k ) ⋅ xp,l,b,k ⋅ (dOl,Ok + dOl,Dp)</p>
<p>p∈P l∈L b∈Bl k∈K passenger</p>
<p>+(∑ ∑ ∑ ∑ yp,l,b,m ⋅ (1 − πlmp ) (9)</p>
<p>p∈P l∈L b∈Bl m∈M</p>
<p>+ ∑ ∑ ∑ ∑ xp,l,b,k ⋅ (1 − πRHV lkp )) ⋅ (C2 + C3)</p>
<p>p∈P l∈L b∈Bl k∈K</p>
<p>+ ∑ ∑ ∑ C4 ⋅ (1 − zp,l,b)</p>
<p>p∈P l∈L b∈Bl</p>
<p>+ ∑p∈P ∑l∈L ∑b∈Bl C5 ⋅ (zp,l,b − ∑m∈M yp,l,b,m − ∑k∈K xp,l,b,k).</p>
</sec>
<sec id="sec-18"><title>Constraints</title>
<p>According to Eq. (10), each parcel must be assigned to at most one compartment in one locker:</p>
<p>∑l∈L ∑b∈Bl zp,l,b ≤ 1, ∀p ∈ P. (10)</p>
<p>According to Eq. (11), each compartment can hold at most one parcel.</p>
<p>∑p∈P zp,l,b ≤ 1, ∀l ∈ L, b ∈ Bl. (11)</p>
<p>Eqs. (12)-(16) and (17) impose weight and volume capacity constraints for compartments, passengers, and vehicles.</p>
<p>For compartments:</p>
<p>∑p∈P wp ⋅ zp,l,b ≤ QwLocker l,b . (12)</p>
<p>∑p∈P vp ⋅ zp,l,b ≤ QvLocker l,b . (13)</p>
<p>For passengers:</p>
<p>wPassenger</p>
<p>∑p∈P wp ⋅ yp,l,b,m ≤ Qm . (14)</p>
<p>vPassenger</p>
<p>∑p∈P vp ⋅ yp,l,b,m ≤ Qm . (15) For vehicles:</p>
<p>∑p∈P wp ⋅ xp,l,b,k ≤ QwRHV k . (16)</p>
<p>∑p∈P vp ⋅ xp,l,b,k ≤ QvRHV k . (17)</p>
<p>Eqs. (18) and (19) account for the route deviation constraints.</p>
<p>For passengers:</p>
<p>yplbm ⋅ (dOlocker,OPassenger + dOlocker,D + dDPassenger,D − dDPassenger,OPassenger) ,</p>
<p>l m l p m p m m</p>
<p>passenger</p>
<p>≤ Δm (18)</p>
<p>∀p ∈ P, l ∈ L, b ∈ Bl, m ∈ M.</p>
<p>For vehicles:</p>
<p>xp,l,b,k ⋅ (dOlocker,ORHV + dOlocker,D + dDRHV,Dp − dDRHV,ORHV) ≤ ΔRHV k ∀p ∈ P, l ∈ L, b</p>
<p>l k l p k k k (19)</p>
<p>∈ Bl, k ∈ K.</p>
<p>Package transportation: According to Eq. (20), each package must be transported either by a passenger or by a vehicle.</p>
<p>∑m∈M yp,l,b,m + ∑k∈K xp,l,b,k ≤ zp,l,b, ∀p ∈ P, l ∈ L, b ∈ Bl. (20)</p>
<p>Logit model: The probability of package acceptance by passenger (m) from locker (l) is calculated based on Eqs. (21) and (22):</p>
<p>Passenger</p>
<p>passenger exp(Vlmp )</p>
<p>π = . (21)</p>
<p>lmp Passenger 1+exp(Vlmp ) Passenger Passenger</p>
<p>Vlmp = β1 ⋅ (fm ⋅ (dOl,Om + dOl,Dp)) + β2 ⋅ wp + β3 ⋅ vp +</p>
<p>(22) β4(dOlocker,OPassenger + dOlocker,Dp + dDPassenger,D − dDPassenger,OPassenger).</p>
<p>l m l m p m m</p>
<p>The probability of package acceptance by vehicle (k) from locker (l) is calculated based on Eqs. (23) and (24):</p>
<p>RHV exp(VRHV lkp )</p>
<p>πlkp = RHV . (23)</p>
<p>1+exp(Vlkp )</p>
<p>Vlk RHV = γ1 ⋅ (fk RHV ⋅ (dOl,Ok + dOl,Dp)) + γ2 ⋅ wp + γ3 ⋅ vp + γ4 ⋅ (dOlocker,ORHV +</p>
<p>l k (24)</p>
<p>dOlocker,D + dDRHV,Dp − dDRHV,ORHV).</p>
<p>l p k k k</p>
</sec>
</sec>
<sec id="sec-19"><label>6</label><title>Numerical Example</title>
<p>To evaluate the performance of the proposed model in an operational environment, a numerical example was designed comprising 200 packages, 5 locker centers (each containing 20 lockers), 20 PT passengers, and 20 RHV drivers. The coordinates of all packages, centers, and carriers were randomly generated over a (50\times 50) network, and distances were calculated using the Manhattan metric. To estimate the coefficients of the Logit model, a survey was designed using the fractional factorial design method. The survey covered various package attributes, including financial incentive, weight, volume, and route deviation, through 12 scenarios. A total of 200 responses were collected from PT passengers and RHV drivers, based on which the Logit model coefficients were calculated, as presented in <xref ref-type="table" rid="tab1">Table 1</xref>.</p>
<table-wrap id="tab1"><label>Table 1</label><caption><p>Logit model coefficients for PT and RHV carriers.</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:9:66,709.5,537.1,755.6"/><p content-type="note">This table is shown in the PDF version of the article.</p></table-wrap>
<p>The estimated coefficients of the Logit model for the two carrier groups, namely PT passengers and ride-hailing service drivers, indicate significant differences in the behavioral sensitivity of these groups to package attributes and transportation conditions. For PT passengers, the positive coefficient of the financial incentive (0.099) indicates that an increase in the reward amount considerably increases the probability of package acceptance by passengers, whereas the negative and relatively large coefficients of weight (−0.383) and volume (−0.135) indicate that PT passengers are highly sensitive to the weight and size of packages and are therefore less willing to accept such packages. Moreover, the negative coefficient of route deviation (−0.046) indicates that an increase in the distance or deviation from the original route reduces the probability of acceptance. In contrast, for ride-hailing service drivers, the financial incentive also has a positive effect (0.055), but its magnitude is lower than that for PT passengers. Instead, their sensitivity to package volume (−0.326) is greater than their sensitivity to package weight (−0.248). This finding indicates that cargo-space constraints are more important to ride-hailing service drivers than weight constraints. The coefficient of route deviation is also negative but smaller in magnitude than that for PT passengers, indicating that ride-hailing service drivers have greater tolerance for route deviations. Overall, these coefficients indicate that neglecting these behavioral differences may result in unrealistic allocations and increase the overall costs of the system.</p>
<p>Subsequently, the MIP model was implemented in the Python PuLP environment using the CBC solver. A summary of the model solution results is presented in <xref ref-type="table" rid="tab2">Table 2</xref> and <xref ref-type="fig" rid="fig1">Figs. 1</xref> and 2.</p>
<table-wrap id="tab2"><label>Table 2</label><caption><p>Model solution results.</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:9:66,331.8,537.1,428"/><p content-type="note">This table is shown in the PDF version of the article.</p></table-wrap>
<fig id="fig1"><label>Figure 1</label><caption><p>Distribution of packages by carrier type.</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:9:66,127.8,537.1,427"/><p content-type="note">This figure is shown in the PDF version of the article.</p></fig>
<fig id="fig2"><label>Figure 2</label><caption><p>Share of each cost component in the total system cost.</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:10:66,622,537.1,778.6"/><p content-type="note">This figure is shown in the PDF version of the article.</p></fig>
<p>The solution results showed that the output allocation consisted of 118 packages (59%) assigned to PT and 82 packages (41%) assigned to RHV. Lightweight and low-volume packages were predominantly assigned to PT, whereas bulky or heavy packages were assigned to RHV. The optimal objective function value was 2,837.45 total cost units, comprising the initial transportation cost (1,210), expected non-acceptance cost (840.75), and operational/environmental costs (786.70). Lightweight and low-volume packages were predominantly assigned to PT, whereas bulky or heavy packages were assigned to RHV. This finding is fully consistent with the behavioral coefficients of the Logit model <xref ref-type="table" rid="tab1">Table 1</xref>. Furthermore, the expected cost share associated with package non-acceptance accounted for approximately 30% of the total system cost, highlighting the importance of the behavioral aspect. An example of package allocation to carriers is presented in <xref ref-type="table" rid="tab3">Table 3</xref>.</p>
<table-wrap id="tab3"><label>Table 3</label><caption><p>An example of package allocation to carriers.</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:10:65.7,365.9,537.1,428.3"/><p content-type="note">This table is shown in the PDF version of the article.</p></table-wrap>
<p>The results demonstrated that incorporating the actual behavior of carriers through the Logit coefficients plays a vital role in carrier selection and reducing total costs. The model, even at a large scale, was able to satisfy all constraints and provide a balanced and operationally feasible allocation, indicating the applicability of the proposed approach to real-world urban logistics scenarios.</p>
</sec>
<sec id="sec-20"><label>7</label><title>Conclusion</title>
<p>This study addressed the optimization of LMD in urban environments by combining the use of smart lockers with crowdsourcing capacities, including PT passengers and RHV drivers. The proposed framework is a MIP model that estimates the probability of acceptance of each transportation offer based on the Logit model, considering financial incentives, route deviation, and the physical characteristics of packages, and incorporates this probability into the objective function as the expected non-acceptance cost. In addition to behavioral aspects, the model fully incorporates operational constraints, such as locker capacity, carrier transportation capacity, and maximum allowable route deviation. The implementation of the model in a realistic scenario involving 200 packages, 5 locker centers, and 40 active carriers demonstrated that all packages were allocated and transported while satisfying the constraints, with a balanced utilization of carriers. The allocation pattern resulting from the actual behavioral coefficients, particularly the differentiation of packages between PT and RHV, led to a reduction in expected costs. The coefficient analysis showed that applying a uniform policy to PT and RHV is not effective; it is preferable to provide greater financial incentives for PT, while greater attention should be paid to volume constraints and optimal loading design for RHV. The analysis of cost components showed that the largest share of the total cost was associated with the initial transportation of packages, followed by the predicted non-acceptance cost and operational environmental costs. These findings indicate that optimally combining locker capacity and crowdsourcing while accounting for the actual responses of carriers can enhance the efficiency and sustainability of urban logistics operations and provide a practical tool for decision-makers. Despite the positive results, the current model is a static, single-period framework and does not directly account for dynamic changes in demand, traffic conditions, or carrier availability. Future research could include the development of dynamic or multi-period models, the use of advanced behavioral models or machine-learning-based approaches, extensions to multi-destination routes and delivery time windows, the application of robust or stochastic optimization to better manage uncertainties, and field validation of the model using real-world data. Pursuing these directions could substantially improve the accuracy and practical applicability of LMD optimization models.</p>
</sec>
<sec id="sec-21"><title>Acknowledgments</title>
<p>The authors sincerely appreciate the valuable contributions and support provided throughout this research.</p>
</sec>
<sec id="sec-22"><title>Funding</title>
<p>No specific funding was received for this research.</p>
</sec>
<sec id="sec-23"><title>Data Availability</title>
<p>The data used in this study are available from the corresponding author upon reasonable request.</p>
</sec>
</body>
<back><ref-list><title>References</title>
<ref id="ref-1"><label>1</label><mixed-citation>Pourmohammadreza, N., &amp; Jokar, M. R. A. (2023). A novel two-phase approach for optimization of the last-mile delivery problem with service options. Sustainability, 15(10), 8098. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3390/su15108098">https://doi.org/10.3390/su15108098</ext-link></mixed-citation></ref>
<ref id="ref-2"><label>2</label><mixed-citation>Yang, H., Landes, H., &amp; Chow, J. Y. J. (2024). A large-scale analytical residential parcel delivery model evaluating greenhouse gas emissions, COVID-19 impact, and cargo bikes. International Journal of Transportation Science and Technology, 15, 136–154. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.ijtst.2023.08.002">https://doi.org/10.1016/j.ijtst.2023.08.002</ext-link></mixed-citation></ref>
<ref id="ref-3"><label>3</label><mixed-citation>Kurowski, M., Sobolewski, M., &amp; Koszorek, M. (2023). Geometrical parcel locker network design with consideration of users’ preferences as a solution for sustainable last mile delivery. Sustainability, 15(20), 15114. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3390/su152015114">https://doi.org/10.3390/su152015114</ext-link></mixed-citation></ref>
<ref id="ref-4"><label>4</label><mixed-citation>Hovi, I. B., &amp; Bø, E. (2024). Unlocking the potential: How can parcel lockers drive efficiency and environmental friendliness in E-commerce? Sustainable Futures, 7, 100189. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.sftr.2024.100189">https://doi.org/10.1016/j.sftr.2024.100189</ext-link></mixed-citation></ref>
<ref id="ref-5"><label>5</label><mixed-citation>Lai, P.-L., Jang, H., Fang, M., &amp; Peng, K. (2022). Determinants of customer satisfaction with parcel locker services in last-mile logistics. The Asian Journal of Shipping and Logistics, 38(1), 25–30. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.ajsl.2021.11.002">https://doi.org/10.1016/j.ajsl.2021.11.002</ext-link></mixed-citation></ref>
<ref id="ref-6"><label>6</label><mixed-citation>Ranjbari, A., Diehl, C., Dalla Chiara, G., &amp; Goodchild, A. (2023). Do parcel lockers reduce delivery times? Evidence from the field. Transportation Research Part E: Logistics and Transportation Review, 172, 103070. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.tre.2023.103070">https://doi.org/10.1016/j.tre.2023.103070</ext-link></mixed-citation></ref>
<ref id="ref-7"><label>7</label><mixed-citation>Pan, S., Zhang, L., Thompson, R. G., &amp; Ghaderi, H. (2021). A parcel network flow approach for joint delivery networks using parcel lockers. International Journal of Production Research, 59(7), 2090–2115. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1080/00207543.2020.1856440">https://doi.org/10.1080/00207543.2020.1856440</ext-link></mixed-citation></ref>
<ref id="ref-8"><label>8</label><mixed-citation>Niemeijer, R., &amp; Buijs, P. (2023). A greener last mile: Analyzing the carbon emission impact of pickup points in last-mile parcel delivery. Renewable and Sustainable Energy Reviews, 186, 113630. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.rser.2023.113630">https://doi.org/10.1016/j.rser.2023.113630</ext-link></mixed-citation></ref>
<ref id="ref-9"><label>9</label><mixed-citation>Schnieder, M., Hinde, C., &amp; West, A. (2021). Combining parcel lockers with staffed collection and delivery points: An optimization case study using real parcel delivery data (London, UK). Journal of Open Innovation: Technology, Market, and Complexity, 7(3), 183. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3390/joitmc7030183">https://doi.org/10.3390/joitmc7030183</ext-link></mixed-citation></ref>
<ref id="ref-10"><label>10</label><mixed-citation>Yu, Y., Lian, F., &amp; Yang, Z. (2021). Pricing of parcel locker service in urban logistics by a TSP model of last-mile delivery. Transport Policy, 114, 206–214. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.tranpol.2021.10.002">https://doi.org/10.1016/j.tranpol.2021.10.002</ext-link></mixed-citation></ref>
<ref id="ref-11"><label>11</label><mixed-citation>Moslem, S., &amp; Pilla, F. (2023). A hybrid decision making support method for parcel lockers location selection. Research in Transportation Economics, 100, 101320. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.retrec.2023.101320">https://doi.org/10.1016/j.retrec.2023.101320</ext-link></mixed-citation></ref>
<ref id="ref-12"><label>12</label><mixed-citation>Moslem, S., Gündoğdu, F. K., Saylam, S., &amp; Pilla, F. (2024). A hybrid decomposed fuzzy multi-criteria decision-making model for optimizing parcel lockers location in the last-mile delivery landscape. Applied Soft Computing, 154, 111321. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.asoc.2024.111321">https://doi.org/10.1016/j.asoc.2024.111321</ext-link></mixed-citation></ref>
<ref id="ref-13"><label>13</label><mixed-citation>Dos Santos, A. G., Viana, A., &amp; Pedroso, J. P. (2022). 2-echelon lastmile delivery with lockers and occasional couriers. Transportation Research Part E: Logistics and Transportation Review, 162, 102714. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.tre.2022.102714">https://doi.org/10.1016/j.tre.2022.102714</ext-link></mixed-citation></ref>
<ref id="ref-14"><label>14</label><mixed-citation>Ghaderi, H., Zhang, L., Tsai, P.-W., &amp; Woo, J. (2022). Crowdsourced last-mile delivery with parcel lockers. International Journal of Production Economics, 251, 108549. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.ijpe.2022.108549">https://doi.org/10.1016/j.ijpe.2022.108549</ext-link></mixed-citation></ref>
<ref id="ref-15"><label>15</label><mixed-citation>Ensafian, H., Andaryan, A. Z., Bell, M. G. H., Geers, D. G., Kilby, P., &amp; Li, J. (2023). Cost-optimal deployment of autonomous mobile lockers co-operating with couriers for simultaneous pickup and delivery operations. Transportation Research Part C: Emerging Technologies, 146, 103958. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.trc.2022.103958">https://doi.org/10.1016/j.trc.2022.103958</ext-link></mixed-citation></ref>
<ref id="ref-16"><label>16</label><mixed-citation>Fessler, A., Cash, P., Thorhauge, M., &amp; Haustein, S. (2023). A public transport based crowdshipping concept: Results of a field test in Denmark. Transport Policy, 134, 106–118. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.tranpol.2023.02.014">https://doi.org/10.1016/j.tranpol.2023.02.014</ext-link></mixed-citation></ref>
<ref id="ref-17"><label>17</label><mixed-citation>Wang, Y., Zhang, D., Liu, Q., Shen, F., &amp; Lee, L. H. (2016). Towards enhancing the last-mile delivery: An effective crowd-tasking model with scalable solutions. Transportation Research Part E: Logistics and Transportation Review, 93, 279–293. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.tre.2016.06.002">https://doi.org/10.1016/j.tre.2016.06.002</ext-link></mixed-citation></ref>
<ref id="ref-18"><label>18</label><mixed-citation>Wang, L., Xu, M., &amp; Qin, H. (2023). Joint optimization of parcel allocation and crowd routing for crowdsourced last-mile delivery. Transportation Research Part B: Methodological, 171, 111–135. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.trb.2023.03.007">https://doi.org/10.1016/j.trb.2023.03.007</ext-link></mixed-citation></ref>
<ref id="ref-19"><label>19</label><mixed-citation>Gatta, V., Marcucci, E., Nigro, M., &amp; Serafini, S. (2019). Sustainable urban freight transport adopting public transport-based crowdshipping for B2C deliveries. European Transport Research Review, 11(1), 1–</mixed-citation></ref>
<ref id="ref-20"><label>14</label><mixed-citation><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1186/s12544-019-0352-x%0A%0A">https://doi.org/10.1186/s12544-019-0352-x%0A%0A</ext-link></mixed-citation></ref>
<ref id="ref-21"><label>20</label><mixed-citation>Kızıl, K. U., &amp; Yıldız, B. (2023). Public transport-based crowd-shipping with backup transfers. Transportation Science, 57(1), 174-196. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1287/trsc.2022.1157">https://doi.org/10.1287/trsc.2022.1157</ext-link></mixed-citation></ref>
<ref id="ref-22"><label>21</label><mixed-citation>Aboelenein, A., &amp; Crispim, J. (2024). The economic impact of crowd-shipping based on public transport in Egypt: A GA approach. Procedia Computer Science, 237, 12–19. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.procs.2024.05.074">https://doi.org/10.1016/j.procs.2024.05.074</ext-link></mixed-citation></ref>
<ref id="ref-23"><label>22</label><mixed-citation>Sawik, B. (2024). Optimizing last-mile delivery: A multi-criteria approach with automated smart lockers, capillary distribution and crowdshipping. Logistics, 8(2), 52. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3390/logistics8020052">https://doi.org/10.3390/logistics8020052</ext-link></mixed-citation></ref>
<ref id="ref-24"><label>23</label><mixed-citation>Mohri, S. S., Nassir, N., Thompson, R. G., &amp; Lavieri, P. S. (2024). Public transportation-based crowd-shipping initiatives: Are users willing to participate? Why not? Transportation Research Part A: Policy and Practice, 182, 104019. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.tra.2024.104019">https://doi.org/10.1016/j.tra.2024.104019</ext-link></mixed-citation></ref>
<ref id="ref-25"><label>24</label><mixed-citation>Mohri, S. S., Nassir, N., Lavieri, P. S., &amp; Thompson, R. G. (2024). Modeling package delivery acceptance in Crowdshipping systems by Public Transportation Passengers: A latent class approach. Travel Behaviour and Society, 35, 100716. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.tbs.2023.100716">https://doi.org/10.1016/j.tbs.2023.100716</ext-link></mixed-citation></ref>
<ref id="ref-26"><label>25</label><mixed-citation>Li, B., Krushinsky, D., Van Woensel, T., &amp; Reijers, H. A. (2016). An adaptive large neighborhood search heuristic for the share-a-ride problem. Computers Operations Research, 66, 170–180. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.cor.2015.08.008">https://doi.org/10.1016/j.cor.2015.08.008</ext-link></mixed-citation></ref>
<ref id="ref-27"><label>26</label><mixed-citation>Li, B., Krushinsky, D., Reijers, H. A., &amp; Van Woensel, T. (2014). The share-a-ride problem: People and parcels sharing taxis. European Journal of Operational Research, 238(1), 31–40. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.ejor.2014.03.003">https://doi.org/10.1016/j.ejor.2014.03.003</ext-link></mixed-citation></ref>
<ref id="ref-28"><label>27</label><mixed-citation>Yu, V. F., Purwanti, S. S., Redi, A. A. N. P., Lu, C. C., Suprayogi, S., &amp; Jewpanya, P. (2018). Simulated annealing heuristic for the general share-a-ride problem. Engineering Optimization, 50(7), 1178–1197. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1080/0305215X.2018.1437153">https://doi.org/10.1080/0305215X.2018.1437153</ext-link></mixed-citation></ref>
<ref id="ref-29"><label>28</label><mixed-citation>Vincent, F. Y., Zegeye, M. M., Gebeyehu, S. G., Indrakarna, P. A. Y., &amp; Jodiawan, P. (2023). A matheuristic algorithm for the share-a-ride problem. Expert Systems with Applications, 230, 120569. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.eswa.2023.120569">https://doi.org/10.1016/j.eswa.2023.120569</ext-link></mixed-citation></ref>
<ref id="ref-30"><label>29</label><mixed-citation>Xue, S., Zhang, Q., &amp; Shiwakoti, N. (2024). Sharing a ride: A dual-service model of people and parcels sharing taxis with loose time windows of parcels. Systems, 12(8), 302. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3390/systems12080302">https://doi.org/10.3390/systems12080302</ext-link></mixed-citation></ref>
<ref id="ref-31"><label>30</label><mixed-citation>Beirigo, B. A., Schulte, F., &amp; Negenborn, R. R. (2018). Integrating people and freight transportation using shared autonomous vehicles with compartments. IFAC-Papersonline, 51(9), 392–397. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.ifacol.2018.07.064">https://doi.org/10.1016/j.ifacol.2018.07.064</ext-link></mixed-citation></ref>
<ref id="ref-32"><label>31</label><mixed-citation>Gao, Y., Zhang, S., Zhang, Z., &amp; Zhao, Q. (2024). The stochastic share-a-ride problem with electric vehicles and customer priorities. Computers Operations Research, 164, 106550. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.cor.2024.106550">https://doi.org/10.1016/j.cor.2024.106550</ext-link></mixed-citation></ref>
<ref id="ref-33"><label>32</label><mixed-citation>Bruzzone, F., Nocera, S., &amp; Pesenti, R. (2023). Feasibility and optimization of freight-on-transit schemes for the sustainable operation of passengers and logistics. Research in Transportation Economics, 101, 101336. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.retrec.2023.101336">https://doi.org/10.1016/j.retrec.2023.101336</ext-link></mixed-citation></ref>
<ref id="ref-34"><label>33</label><mixed-citation>Yang, X., Nie, X., Luo, H., &amp; Huang, G. Q. (2024). Integrating parcel delivery schedules with public transport networks in urban co-modality systems. Computers Operations Research, 167, 106650. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.cor.2024.106650">https://doi.org/10.1016/j.cor.2024.106650</ext-link></mixed-citation></ref>
<ref id="ref-35"><label>34</label><mixed-citation>Zhan, X., Szeto, W. Y., &amp; Wang, Y. (2023). The ride-hailing sharing problem with parcel transportation. Transportation Research Part E: Logistics and Transportation Review, 172, 103073. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.tre.2023.103073">https://doi.org/10.1016/j.tre.2023.103073</ext-link></mixed-citation></ref>
</ref-list></back>
</article>