Crowd-shipping systems with public transport passengers: Operational planning

• A Crowd-shipping (CS) system with Public Transport (PT) passengers is proposed. • The system is designed at an operational decision-making level. • A probabilistic model is formulated estimating the probability of accepting CS tasks by passengers. • A heuristic algorithm is proposed to solve the model for medium to large case studies. • The CS system is designed for a case study from the Sydney metropolitan area and insights are provided. This study designs a crowdshipping (CS) delivery system with public transport (PT) passengers at the operational decision-making level. In this system, parcel lockers (PLs) are positioned in PT stations, through which small and light parcels are allocated to passengers for delivery to their final delivery addresses (i.e., performing the last-mile delivery). A probabilistic mathematical model is formulated with behavioural constraints to estimate the probabilities of accepting CS tasks by passengers. The probability is estimated based on a logit function, sensitive to the parcel’s weight, reimbursement amount, and the walking detour required to deliver the parcel to its final destination. The logit model is constructed based on survey data collected from the Greater Sydney (GS) area, Australia. The mathematical model optimises the allocation of delivery tasks to the CS system and PLs, subsequently, incentivising CS-allocated tasks for participating passengers. Furthermore, the model performs the routing of vehicles to deliver non-allocated parcels, including heavy parcels. A heuristic solution algorithm is then proposed to optimise decisions related to allocation, routing, and incentivisation, which was tested on a real case study. By conducting sensitivity analysis on various model parameters, results show that for a small carrier, utilising a PT-based CS system could minimise daily delivery costs by up to 36%, depending on passengers’ rate of familiarity with the CS initiative and the number of PT stations equipped with PLs. Vehicle delivery cost in the CS-integrated delivery system is also reduced between 50% and 65%, in comparison to the conventional vehicle-only system. Our study reveals that a CS system should offer higher incentives at the beginning, and as CS familiarity grows, figures could be reduced depending on other market and operational conditions. Furthermore, simulated experiments suggest that denser PL networks enable carriers to reduce incentives even at earlier stages with lower familiarity rates.

Authors

Institutions

Publication Details

Journal
Transportation Research Part E Logistics and Transportation Review
Published
2024-12-12
DOI
https://doi.org/10.1016/j.tre.2024.103916
Citations
13
Primary Topic
Urban and Freight Transport Logistics
Type
article
Field-Weighted Citation Impact
3.45
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Crowd-shipping systems with public transport passengers: Operational planning

Neema Nassir, Russell G. Thompson‬‬, Patrícia Sauri Lavieri, Seyed Sina Mohri et al.
13 citations
Transportation Research Part E Logistics and Transportation Review
Urban and Freight Transport Logistics
3.45
article

Crowd-shipping systems with public transport passengers: Operational planning

Neema Nassir, Russell G. Thompson‬‬, Patrícia Sauri Lavieri, Seyed Sina Mohri, ‬Hadi Ghaderi
article en
13 citations

Abstract

• A Crowd-shipping (CS) system with Public Transport (PT) passengers is proposed. • The system is designed at an operational decision-making level. • A probabilistic model is formulated estimating the probability of accepting CS tasks by passengers. • A heuristic algorithm is proposed to solve the model for medium to large case studies. • The CS system is designed for a case study from the Sydney metropolitan area and insights are provided. This study designs a crowdshipping (CS) delivery system with public transport (PT) passengers at the operational decision-making level. In this system, parcel lockers (PLs) are positioned in PT stations, through which small and light parcels are allocated to passengers for delivery to their final delivery addresses (i.e., performing the last-mile delivery). A probabilistic mathematical model is formulated with behavioural constraints to estimate the probabilities of accepting CS tasks by passengers. The probability is estimated based on a logit function, sensitive to the parcel’s weight, reimbursement amount, and the walking detour required to deliver the parcel to its final destination. The logit model is constructed based on survey data collected from the Greater Sydney (GS) area, Australia. The mathematical model optimises the allocation of delivery tasks to the CS system and PLs, subsequently, incentivising CS-allocated tasks for participating passengers. Furthermore, the model performs the routing of vehicles to deliver non-allocated parcels, including heavy parcels. A heuristic solution algorithm is then proposed to optimise decisions related to allocation, routing, and incentivisation, which was tested on a real case study. By conducting sensitivity analysis on various model parameters, results show that for a small carrier, utilising a PT-based CS system could minimise daily delivery costs by up to 36%, depending on passengers’ rate of familiarity with the CS initiative and the number of PT stations equipped with PLs. Vehicle delivery cost in the CS-integrated delivery system is also reduced between 50% and 65%, in comparison to the conventional vehicle-only system. Our study reveals that a CS system should offer higher incentives at the beginning, and as CS familiarity grows, figures could be reduced depending on other market and operational conditions. Furthermore, simulated experiments suggest that denser PL networks enable carriers to reduce incentives even at earlier stages with lower familiarity rates.

Transportation Research Part E Logistics and Transportation ReviewVol. 194
The University of Melbourne (AU), Swinburne University of Technology (AU)
Openalex Percentile: Top 7%
Urban and Freight Transport Logistics
3.45
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.