TY - JOUR
T1 - Auction-based Crowdsourced First and Last Mile Logistics
AU - Li, Yafei
AU - Li, Yifei
AU - Peng, Yun
AU - Fu, Xiaoyi
AU - Xu, Jianliang
AU - Xu, Mingliang
N1 - Funding information:
This work was supported in part by the Project of Science and Technology Major Project of Yunnan Province under Grant 202105AG070005 (YNB202202), in part by the NSFC under Grants 61972362, 62036010, 61602420, 62002074, and 62102107, in part by the HNSF under Grant 202300410378, in part by the HK-RGC under Grants C2004-21GF and 172922, and in part by the GDNSF under Grant 2019B1515130001.
Publisher copyright:
© 2022 IEEE.
PY - 2024/1
Y1 - 2024/1
N2 - The booming of mobile internet and crowdsourcing technology has offered great opportunities for first and last mile logistics (FLML) service. Unlike the traditional FLML service that separates the parcel collection in the first mile from the parcel delivery in the last mile, a new type of crowdsourced FLML service integrates parcel collection and parcel delivery services as a whole, which can significantly improve the efficiency of FLML service. Briefly, in a crowdsourced FLML service, the platform assigns the customers' triggered pick-up parcels to the couriers who are delivering drop-off parcels in terms of the real-time status of couriers (e.g., capacity, location, and schedule). Existing works solving the crowdsourced FLML problem only consider the utility maximization for the platform but ignore the incentive to the utilities of couriers. Inspired by this, in this paper, we investigate a novel type of crowdsourced FLML problem, namely Auction-based Crowdsourced FLML (ACF), where the platform assigns the couriers with suitable pick-up parcels based on the preferences of couriers with the goal of maximizing the social welfare of the platform and couriers. To solve the ACF problem, we present a novel auction model named Multi-attribute Reverse Vickrey (MRV), where the couriers bid on parcels according to their preferences for parcels. Based on the MRV model, we present three efficient assignment algorithms to assign parcels to couriers. In addition, we give theoretical analysis for our proposed algorithms. Extensive experiments examine the efficiency and effectiveness of our solutions.
AB - The booming of mobile internet and crowdsourcing technology has offered great opportunities for first and last mile logistics (FLML) service. Unlike the traditional FLML service that separates the parcel collection in the first mile from the parcel delivery in the last mile, a new type of crowdsourced FLML service integrates parcel collection and parcel delivery services as a whole, which can significantly improve the efficiency of FLML service. Briefly, in a crowdsourced FLML service, the platform assigns the customers' triggered pick-up parcels to the couriers who are delivering drop-off parcels in terms of the real-time status of couriers (e.g., capacity, location, and schedule). Existing works solving the crowdsourced FLML problem only consider the utility maximization for the platform but ignore the incentive to the utilities of couriers. Inspired by this, in this paper, we investigate a novel type of crowdsourced FLML problem, namely Auction-based Crowdsourced FLML (ACF), where the platform assigns the couriers with suitable pick-up parcels based on the preferences of couriers with the goal of maximizing the social welfare of the platform and couriers. To solve the ACF problem, we present a novel auction model named Multi-attribute Reverse Vickrey (MRV), where the couriers bid on parcels according to their preferences for parcels. Based on the MRV model, we present three efficient assignment algorithms to assign parcels to couriers. In addition, we give theoretical analysis for our proposed algorithms. Extensive experiments examine the efficiency and effectiveness of our solutions.
KW - location-based services
KW - crowdsourcing
KW - logistics
KW - optimization
KW - auction
UR - http://www.scopus.com/inward/record.url?scp=85141603673&partnerID=8YFLogxK
U2 - 10.1109/TMC.2022.3219881
DO - 10.1109/TMC.2022.3219881
M3 - Journal article
AN - SCOPUS:85141603673
SN - 1536-1233
VL - 23
SP - 180
EP - 193
JO - IEEE Transactions on Mobile Computing
JF - IEEE Transactions on Mobile Computing
IS - 1
ER -