View in EDS

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

Saved in:
Bibliographic Details
Title: Choice-based crowdshipping for next-day delivery services: A dynamic task display problem.
Authors: Arslan, Alp1 (AUTHOR) a.arslan1@lancaster.ac.uk, Kılcı, Fırat2 (AUTHOR), Cheng, Shih-Fen3 (AUTHOR), Misra, Archan3 (AUTHOR)
Source: European Journal of Operational Research. Jan2026, Vol. 328 Issue 1, p336-348. 13p.
Subjects: Direct costing, Statistical decision making, Crowds, Labor supply, Customization
Abstract: This paper studies integrating the crowd workforce into next-day home delivery services. In this setting, both crowd drivers and contract drivers collaborate in making deliveries. Crowd drivers have limited capacity and can choose not to deliver if the presented tasks do not align with their preferences. The central question addressed is: How can the platform minimize the total task fulfilment cost, which includes payouts to crowd drivers and additional payouts to contract drivers for delivering the unselected tasks by customizing task displays to crowd drivers? To tackle this problem, we formulate it as a finite-horizon Stochastic Decision Problem, capturing crowd drivers' utility-driven task preferences, with the option of not choosing a task based on the displayed options. An inherent challenge is approximating the non-constant marginal cost of serving orders not chosen by crowd drivers, which are then assigned to contract drivers. We address this by leveraging a common approximation technique, dividing the service region into zones. Furthermore, we devise a stochastic look-ahead strategy that tackles the curse of dimensionality issues arising in dynamic task display execution and a non-linear (problem specifically concave) boundary condition associated with the cost of hiring contract drivers. In experiments inspired by Singapore's geography, we demonstrate that choice-based crowd shipping can reduce next-day delivery fulfilment costs by up to 16.9%. The observed cost savings are closely tied to the task display policies and the task choice behaviours of drivers. • Study a crowdshipping system for next-day delivery services. • Consider crowd drivers' task choice behaviours. • Propose an efficient look-ahead policy and assess it. • Present the benefits of choice-based crowdshipping. [ABSTRACT FROM AUTHOR]
Copyright of European Journal of Operational Research is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 188180031
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Choice-based crowdshipping for next-day delivery services: A dynamic task display problem.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Arslan%2C+Alp%22">Arslan, Alp</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> a.arslan1@lancaster.ac.uk</i><br /><searchLink fieldCode="AR" term="%22Kılcı%2C+Fırat%22">Kılcı, Fırat</searchLink><relatesTo>2</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Cheng%2C+Shih-Fen%22">Cheng, Shih-Fen</searchLink><relatesTo>3</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Misra%2C+Archan%22">Misra, Archan</searchLink><relatesTo>3</relatesTo> (AUTHOR)
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22European+Journal+of+Operational+Research%22">European Journal of Operational Research</searchLink>. Jan2026, Vol. 328 Issue 1, p336-348. 13p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Direct+costing%22">Direct costing</searchLink><br /><searchLink fieldCode="DE" term="%22Statistical+decision+making%22">Statistical decision making</searchLink><br /><searchLink fieldCode="DE" term="%22Crowds%22">Crowds</searchLink><br /><searchLink fieldCode="DE" term="%22Labor+supply%22">Labor supply</searchLink><br /><searchLink fieldCode="DE" term="%22Customization%22">Customization</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: This paper studies integrating the crowd workforce into next-day home delivery services. In this setting, both crowd drivers and contract drivers collaborate in making deliveries. Crowd drivers have limited capacity and can choose not to deliver if the presented tasks do not align with their preferences. The central question addressed is: How can the platform minimize the total task fulfilment cost, which includes payouts to crowd drivers and additional payouts to contract drivers for delivering the unselected tasks by customizing task displays to crowd drivers? To tackle this problem, we formulate it as a finite-horizon Stochastic Decision Problem, capturing crowd drivers' utility-driven task preferences, with the option of not choosing a task based on the displayed options. An inherent challenge is approximating the non-constant marginal cost of serving orders not chosen by crowd drivers, which are then assigned to contract drivers. We address this by leveraging a common approximation technique, dividing the service region into zones. Furthermore, we devise a stochastic look-ahead strategy that tackles the curse of dimensionality issues arising in dynamic task display execution and a non-linear (problem specifically concave) boundary condition associated with the cost of hiring contract drivers. In experiments inspired by Singapore's geography, we demonstrate that choice-based crowd shipping can reduce next-day delivery fulfilment costs by up to 16.9%. The observed cost savings are closely tied to the task display policies and the task choice behaviours of drivers. • Study a crowdshipping system for next-day delivery services. • Consider crowd drivers' task choice behaviours. • Propose an efficient look-ahead policy and assess it. • Present the benefits of choice-based crowdshipping. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of European Journal of Operational Research is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=188180031
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1016/j.ejor.2025.05.046
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 13
        StartPage: 336
    Subjects:
      – SubjectFull: Direct costing
        Type: general
      – SubjectFull: Statistical decision making
        Type: general
      – SubjectFull: Crowds
        Type: general
      – SubjectFull: Labor supply
        Type: general
      – SubjectFull: Customization
        Type: general
    Titles:
      – TitleFull: Choice-based crowdshipping for next-day delivery services: A dynamic task display problem.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Arslan, Alp
      – PersonEntity:
          Name:
            NameFull: Kılcı, Fırat
      – PersonEntity:
          Name:
            NameFull: Cheng, Shih-Fen
      – PersonEntity:
          Name:
            NameFull: Misra, Archan
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 01
              Text: Jan2026
              Type: published
              Y: 2026
          Identifiers:
            – Type: issn-print
              Value: 03772217
          Numbering:
            – Type: volume
              Value: 328
            – Type: issue
              Value: 1
          Titles:
            – TitleFull: European Journal of Operational Research
              Type: main
ResultId 1