Publication:
Crowdshipping problem with dynamic compensations and transshipments

dc.contributor.coauthorKizil, Kerim U.
dc.contributor.departmentDepartment of Industrial Engineering
dc.contributor.kuauthorŞardağ, Ali
dc.contributor.kuauthorYıldız, Barış
dc.contributor.otherDepartment of Industrial Engineering
dc.contributor.schoolcollegeinstituteCollege of Engineering
dc.contributor.schoolcollegeinstituteGraduate School of Sciences and Engineering
dc.date.accessioned2024-12-29T09:39:55Z
dc.date.issued2024
dc.description.abstractRapid urban growth and consequent increase in e-commerce demand make urban logistics a harder task than ever. The growing size of urban delivery operations not only entails operational challenges but also generates several negative externalities, such as increased traffic, pollution, noise, and accidents. This trend creates a pressing need for efficient delivery mechanisms that are more economical and environmentally friendly than existing systems. Crowdshipping, wherein ordinary members of the society partake in delivery operations for a small compensation, is one of the answers that cater to this need and has attracted considerable research interest recently. However, designing compensation mechanisms to prompt efficient participation from the public remains largely unexplored in the literature. In this study, we devise a dynamic compensation scheme for crowdshipping operations in a many-to-many express delivery framework, where the crowdshipper compensations are determined based on spatial and temporal distributions of the delivery demand and continually updated during the service time to leverage the crowd participation as needed. To address the resulting complex network management problem, we derive analytical solutions for compensation optimization and use these results along with effective pruning strategies to build a lookup table to simultaneously determine package routes and compensation offers in real time. Computational studies and extensive simulations conducted with real-world data show that our proposed approach can provide significant cost savings and considerably reduce operational costs and other transport- related negative externalities when compared to classical delivery modes, crowdshipping with static compensations, and crowdshipping without transshipment.
dc.description.indexedbyWoS
dc.description.indexedbyScopus
dc.description.publisherscopeInternational
dc.description.sponsorsThis study has been supported by the European Research Council (ERC) under grant number 101076231 as a part of the GoodMobility project (https://goodmobility.ku.edu.tr) . Furthermore, this work would not have been possible without the help of the Trendyol Operations and Innovation Department. We thank them not only for providing us with real-life data but also for the many informative and insightful discussions. We finally would like to extend our gratitude to the anonymous reviewers who provided invaluable feedback that helped us refine and enrich the contents of this study.
dc.description.volume166
dc.identifier.doi10.1016/j.trc.2024.104796
dc.identifier.eissn1879-2359
dc.identifier.issn0968-090X
dc.identifier.quartileQ1
dc.identifier.scopus2-s2.0-85200573514
dc.identifier.urihttps://doi.org/10.1016/j.trc.2024.104796
dc.identifier.urihttps://hdl.handle.net/20.500.14288/23163
dc.identifier.wos1291486700001
dc.keywordsCrowdshipping
dc.keywordsDynamic pricing
dc.keywordsCompensation
dc.keywordsDynamic programming
dc.keywordsTransshipment
dc.keywordsLast-mile delivery
dc.keywordsSustainability
dc.languageen
dc.publisherPergamon-Elsevier Science Ltd
dc.sourceTransportation Research Part C-Emerging Technologies
dc.subjectTransportation science and technology
dc.titleCrowdshipping problem with dynamic compensations and transshipments
dc.typeJournal article
dspace.entity.typePublication
local.contributor.kuauthorŞardağ, Ali
local.contributor.kuauthorYıldız, Barış
relation.isOrgUnitOfPublicationd6d00f52-d22d-4653-99e7-863efcd47b4a
relation.isOrgUnitOfPublication.latestForDiscoveryd6d00f52-d22d-4653-99e7-863efcd47b4a

Files