Choice-based crowdshipping for next-day delivery services: a dynamic task display problem

DOI10.1016/J.EJOR.2025.05.046MaRDI QIDQ6865574zbMATH OpenFDO

Authors Alp Arslan, Fırat Kılcı, Shih-Fen Cheng, Archan Misra

Publication date 2 February 2026

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.EJOR.2025.05.046

zbMATH Keywords

crowdsourced deliverydrivers' autonomydynamic task displaylast-mile logistics

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• Continuous approximation models in freight distribution management
• Crowd-shipping with time windows and transshipment nodes
• Crowdshipping by employees of distribution centers: optimization approaches for matching supply and demand
• Exact and approximation algorithms for the min-max \(k\)-traveling salesmen problem on a tree
• Revenue Management Under a General Discrete Choice Model of Consumer Behavior
• The vehicle routing problem with occasional drivers
• Workforce planning for O2O delivery systems with crowdsourced drivers

This page was built for publication: Choice-based crowdshipping for next-day delivery services: a dynamic task display problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6865574)