Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Journal articles
  4. A continuum approximation approach to the depot location problem in a crowd-shipping system
 
research article

A continuum approximation approach to the depot location problem in a crowd-shipping system

Stokkink, Patrick  
•
Geroliminis, Nikolas  
June 30, 2023
Transportation Research Part E-Logistics And Transportation Review

Last-mile delivery in the logistics chain contributes to congestion in urban networks due to frequent stops. Crowd-shipping is a sustainable and low-cost alternative to traditional delivery but relies heavily on the availability of occasional couriers. In this work, we propose a crowd-shipping system that uses depots to improve accessibility for potential crowd-shippers to serve a large portion of the demand for small parcels. While small-scale versions of this problem have been recently addressed, scaling to larger instances significantly complexifies the problem. A heuristic approach based on continuum approximation is designed to evaluate the quality of a potential set of depots. By combining an efficient and accurate approximation method with a large neighborhood search heuristic, we can efficiently find a good set of depots, even for large-scale networks. The proposed methodology allows for heterogeneity among crowd-shippers and allows identifying the expected number of delivered parcels in every region, which can be used to enhance lower-level assignment decisions.A case study on the Washington DC network shows that depots are built at geographically central locations but most importantly at locations around popular origins for crowd-shippers. The optimal number of depots is mainly dependent on the marginal number of parcels that can be served by crowd-shippers from a specific depot, relative to the costs involved in opening that depot. The operational costs approximated by our continuum approximation approach deviate on average 2% from the actual operational costs using dynamic assignment strategies. For small instances, our algorithm finds better solutions than solving a discrete formulation using CPLEX, while being almost 200 times faster. For large instances, the discrete formulation cannot be constructed by CPLEX, whereas the CA-based approach finds good solutions within minutes. Finally, the results show that using CA-based strategies in all three layers of decision-making can improve overall performance by 15% compared to non-predictive strategies.

  • Files
  • Details
  • Metrics
Type
research article
DOI
10.1016/j.tre.2023.103207
Web of Science ID

WOS:001040417600001

Author(s)
Stokkink, Patrick  
Geroliminis, Nikolas  
Date Issued

2023-06-30

Publisher

PERGAMON-ELSEVIER SCIENCE LTD

Published in
Transportation Research Part E-Logistics And Transportation Review
Volume

176

Article Number

103207

Subjects

Economics

•

Engineering, Civil

•

Operations Research & Management Science

•

Transportation

•

Transportation Science & Technology

•

Business & Economics

•

Engineering

•

Operations Research & Management Science

•

Transportation

•

crowd-shipping

•

depot location problem

•

network design

•

last-mile delivery

•

last-mile delivery

•

routing problem

•

design

•

pickup

•

algorithm

•

demand

•

branch

•

model

Editorial or Peer reviewed

REVIEWED

Written at

EPFL

EPFL units
LUTS  
Available on Infoscience
August 14, 2023
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/199701
Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés