Bundles generation and pricing in crowdshipping

IF 2.1 Q2 OPERATIONS RESEARCH & MANAGEMENT SCIENCE
{"title":"Bundles generation and pricing in crowdshipping","authors":"","doi":"10.1016/j.ejtl.2024.100142","DOIUrl":null,"url":null,"abstract":"<div><p>Crowdshipping is a new delivery paradigm that exploits the capacity of ordinary people who offer their own vehicles and free time to perform deliveries against compensation. In this work, we consider a peer-to-peer logistic platform where a company receives orders from its customers and assigns them to occasional drivers (ODs), or crowdshippers, who perform the delivery operations. We first investigate the problem of deciding how the orders should be partitioned into bundles, where a bundle is a set of orders assigned to the same OD. Then, we focus on the problem of determining the compensation associated with each bundle, with the purpose of minimizing the total delivery costs. The pricing scheme is based on the assumption that each OD is associated with a <em>willingness-to-serve</em> function, which is modeled as a random variable that gives the probability that the OD accepts to deliver the bundle given the compensation value. This random variable captures the estimation of the <em>willingness-to-serve</em> function that the company has elaborated, for example on the basis of historical data. If the compensation offered by the company is greater than or equal to the <em>willingness-to-serve</em> value, the OD performs the delivery, otherwise she/he refuses. In case no OD is available to deliver a bundle, then all packages in the bundle are offered to a third-party delivery company. We simulate two auction systems for the assignment of bundles to ODs: a static and a dynamic auction. In exhaustive simulation tests, we compare different pricing schemes as well as the two auction systems, and outline several managerial insights.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":null,"pages":null},"PeriodicalIF":2.1000,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2192437624000177/pdfft?md5=c5cefe6620309fb3b6c6fb0260aced5a&pid=1-s2.0-S2192437624000177-main.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"EURO Journal on Transportation and Logistics","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2192437624000177","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Crowdshipping is a new delivery paradigm that exploits the capacity of ordinary people who offer their own vehicles and free time to perform deliveries against compensation. In this work, we consider a peer-to-peer logistic platform where a company receives orders from its customers and assigns them to occasional drivers (ODs), or crowdshippers, who perform the delivery operations. We first investigate the problem of deciding how the orders should be partitioned into bundles, where a bundle is a set of orders assigned to the same OD. Then, we focus on the problem of determining the compensation associated with each bundle, with the purpose of minimizing the total delivery costs. The pricing scheme is based on the assumption that each OD is associated with a willingness-to-serve function, which is modeled as a random variable that gives the probability that the OD accepts to deliver the bundle given the compensation value. This random variable captures the estimation of the willingness-to-serve function that the company has elaborated, for example on the basis of historical data. If the compensation offered by the company is greater than or equal to the willingness-to-serve value, the OD performs the delivery, otherwise she/he refuses. In case no OD is available to deliver a bundle, then all packages in the bundle are offered to a third-party delivery company. We simulate two auction systems for the assignment of bundles to ODs: a static and a dynamic auction. In exhaustive simulation tests, we compare different pricing schemes as well as the two auction systems, and outline several managerial insights.

众包的生成和定价
众包送货是一种新的送货模式,它利用普通人的能力,让他们提供自己的车辆和空闲时间,进行有偿送货。在这项工作中,我们考虑了一个点对点物流平台,在这个平台上,一家公司接收客户的订单,并将其分配给临时司机(OD)或众包送货员,由他们执行送货操作。我们首先研究的问题是决定如何将订单划分为捆绑订单,其中捆绑订单是指分配给同一 OD 的一组订单。然后,我们重点研究确定与每个捆绑相关的补偿问题,目的是最大限度地降低总配送成本。定价方案基于这样一个假设,即每个 OD 都与服务意愿函数相关联,该函数被建模为一个随机变量,给出了 OD 在给定补偿值的情况下接受交付捆绑订单的概率。该随机变量反映了公司对服务意愿函数的估计,例如根据历史数据进行的估计。如果公司提供的补偿大于或等于服务意愿值,则外包商执行交付,否则拒绝交付。如果没有 OD 可以递送捆绑包裹,那么捆绑包裹中的所有包裹都会提供给第三方递送公司。我们模拟了两种将包裹分配给 OD 的拍卖系统:静态拍卖和动态拍卖。在详尽的模拟测试中,我们对不同的定价方案以及两种拍卖系统进行了比较,并概述了一些管理见解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
4.60
自引率
0.00%
发文量
24
审稿时长
129 days
期刊介绍: The EURO Journal on Transportation and Logistics promotes the use of mathematics in general, and operations research in particular, in the context of transportation and logistics. It is a forum for the presentation of original mathematical models, methodologies and computational results, focussing on advanced applications in transportation and logistics. The journal publishes two types of document: (i) research articles and (ii) tutorials. A research article presents original methodological contributions to the field (e.g. new mathematical models, new algorithms, new simulation techniques). A tutorial provides an introduction to an advanced topic, designed to ease the use of the relevant methodology by researchers and practitioners.
文献相关原料
公司名称 产品信息 采购帮参考价格
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信