在共享出行和众包配送平台中,通过个性化菜单和激励措施提高司机的灵活性

IF 1.9 4区 管理学 Q3 OPERATIONS RESEARCH & MANAGEMENT SCIENCE Naval Research Logistics Pub Date : 2024-07-05 DOI:10.1002/nav.22212
Hannah Horner, Jennifer Pazour, John E. Mitchell
{"title":"在共享出行和众包配送平台中,通过个性化菜单和激励措施提高司机的灵活性","authors":"Hannah Horner, Jennifer Pazour, John E. Mitchell","doi":"10.1002/nav.22212","DOIUrl":null,"url":null,"abstract":"This article formulates and solves a stochastic optimization model to investigate the impact of crowdsourced platforms (e.g., ridesharing, on‐demand delivery, volunteer food rescue, and carpooling) offering small, personalized menus of requests and incentive offers for drivers to choose from. To circumvent nonlinear variable relationships, we exploit model structure to formulate the program as a stochastic linear integer program. The proposed solution approach models stochastic responses as a sample of variable and fixed scenarios, and to counterbalance solution overfitting, uses a participation ratio parameter. The problem is also decomposed and iterated among two separate subproblems, one which optimizes menus, and another, which optimizes incentives. Computational experiments, based on a ride sharing application using occasional drivers demonstrate the importance of using multiple scenarios to capture stochastic driver behavior. Our method provides robust performance even when discrepancies between predicted and observed driver behaviors exist. Computational results show that offering menus and personalized incentives can significantly increase match rates and platform profit compared to recommending a single request to each driver. Further, compared to the menu‐only model, the average driver income is increased, and more customer requests are matched. By strategically using personalized incentives to prioritize promising matches and to increase drivers' willingness to accept requests, our approach benefits both drivers and customers. Higher incentives are offered when drivers are more likely to accept, while fewer incentives and menu slots are reserved for driver‐request pairs less likely to be accepted.","PeriodicalId":49772,"journal":{"name":"Naval Research Logistics","volume":null,"pages":null},"PeriodicalIF":1.9000,"publicationDate":"2024-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Increasing driver flexibility through personalized menus and incentives in ridesharing and crowdsourced delivery platforms\",\"authors\":\"Hannah Horner, Jennifer Pazour, John E. Mitchell\",\"doi\":\"10.1002/nav.22212\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This article formulates and solves a stochastic optimization model to investigate the impact of crowdsourced platforms (e.g., ridesharing, on‐demand delivery, volunteer food rescue, and carpooling) offering small, personalized menus of requests and incentive offers for drivers to choose from. To circumvent nonlinear variable relationships, we exploit model structure to formulate the program as a stochastic linear integer program. The proposed solution approach models stochastic responses as a sample of variable and fixed scenarios, and to counterbalance solution overfitting, uses a participation ratio parameter. The problem is also decomposed and iterated among two separate subproblems, one which optimizes menus, and another, which optimizes incentives. Computational experiments, based on a ride sharing application using occasional drivers demonstrate the importance of using multiple scenarios to capture stochastic driver behavior. Our method provides robust performance even when discrepancies between predicted and observed driver behaviors exist. Computational results show that offering menus and personalized incentives can significantly increase match rates and platform profit compared to recommending a single request to each driver. Further, compared to the menu‐only model, the average driver income is increased, and more customer requests are matched. By strategically using personalized incentives to prioritize promising matches and to increase drivers' willingness to accept requests, our approach benefits both drivers and customers. Higher incentives are offered when drivers are more likely to accept, while fewer incentives and menu slots are reserved for driver‐request pairs less likely to be accepted.\",\"PeriodicalId\":49772,\"journal\":{\"name\":\"Naval Research Logistics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.9000,\"publicationDate\":\"2024-07-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Naval Research Logistics\",\"FirstCategoryId\":\"91\",\"ListUrlMain\":\"https://doi.org/10.1002/nav.22212\",\"RegionNum\":4,\"RegionCategory\":\"管理学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"OPERATIONS RESEARCH & MANAGEMENT SCIENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Naval Research Logistics","FirstCategoryId":"91","ListUrlMain":"https://doi.org/10.1002/nav.22212","RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}
引用次数: 0

摘要

本文建立并求解了一个随机优化模型,以研究众包平台(如共享乘车、按需配送、志愿食物救援和拼车)提供小型个性化菜单供司机选择的影响。为了规避非线性变量关系,我们利用模型结构将程序表述为随机线性整数程序。建议的求解方法将随机响应建模为变量和固定情景的样本,并使用参与比例参数来平衡求解的过度拟合。该问题还在两个独立的子问题之间进行分解和迭代,一个是优化菜单的问题,另一个是优化激励机制的问题。计算实验基于使用临时司机的共享乘车应用,证明了使用多种情景捕捉随机司机行为的重要性。即使在预测的驾驶员行为与观察到的驾驶员行为之间存在差异时,我们的方法也能提供稳健的性能。计算结果表明,与向每位司机推荐单一请求相比,提供菜单和个性化激励措施能显著提高匹配率和平台利润。此外,与仅提供菜单的模式相比,司机的平均收入得到了提高,匹配的客户请求也更多。通过战略性地使用个性化激励措施来优先考虑有前景的匹配,并提高司机接受请求的意愿,我们的方法对司机和客户都有利。当司机更有可能接受请求时,就会提供更高的奖励,而对于不太可能接受请求的司机-请求配对,则会保留较少的奖励和菜单位置。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Increasing driver flexibility through personalized menus and incentives in ridesharing and crowdsourced delivery platforms
This article formulates and solves a stochastic optimization model to investigate the impact of crowdsourced platforms (e.g., ridesharing, on‐demand delivery, volunteer food rescue, and carpooling) offering small, personalized menus of requests and incentive offers for drivers to choose from. To circumvent nonlinear variable relationships, we exploit model structure to formulate the program as a stochastic linear integer program. The proposed solution approach models stochastic responses as a sample of variable and fixed scenarios, and to counterbalance solution overfitting, uses a participation ratio parameter. The problem is also decomposed and iterated among two separate subproblems, one which optimizes menus, and another, which optimizes incentives. Computational experiments, based on a ride sharing application using occasional drivers demonstrate the importance of using multiple scenarios to capture stochastic driver behavior. Our method provides robust performance even when discrepancies between predicted and observed driver behaviors exist. Computational results show that offering menus and personalized incentives can significantly increase match rates and platform profit compared to recommending a single request to each driver. Further, compared to the menu‐only model, the average driver income is increased, and more customer requests are matched. By strategically using personalized incentives to prioritize promising matches and to increase drivers' willingness to accept requests, our approach benefits both drivers and customers. Higher incentives are offered when drivers are more likely to accept, while fewer incentives and menu slots are reserved for driver‐request pairs less likely to be accepted.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Naval Research Logistics
Naval Research Logistics 管理科学-运筹学与管理科学
CiteScore
4.20
自引率
4.30%
发文量
47
审稿时长
8 months
期刊介绍: Submissions that are most appropriate for NRL are papers addressing modeling and analysis of problems motivated by real-world applications; major methodological advances in operations research and applied statistics; and expository or survey pieces of lasting value. Areas represented include (but are not limited to) probability, statistics, simulation, optimization, game theory, quality, scheduling, reliability, maintenance, supply chain, decision analysis, and combat models. Special issues devoted to a single topic are published occasionally, and proposals for special issues are welcomed by the Editorial Board.
期刊最新文献
Partial information sharing in supply chains with ARMA demand Efficient online estimation and remaining useful life prediction based on the inverse Gaussian process Double‐sided queues and their applications to vaccine inventory management Optimal condition‐based parameter learning and mission abort decisions Single machine scheduling with the total weighted late work and rejection cost
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1