Crowdsourced on-demand food delivery: An order batching and assignment algorithm

计算机科学 众包 匹配(统计) 供应 服务提供商 启发式 运筹学 外包 数学优化 服务(商务) 业务 营销 工程类 人工智能 万维网 统计 电信 数学
作者
Michele D. Simoni,Matthias Winkenbach
出处
期刊:Transportation Research Part C-emerging Technologies [Elsevier BV]
卷期号:149: 104055-104055 被引量:87
标识
DOI:10.1016/j.trc.2023.104055
摘要

Since the early 2010s, the meal delivery business went through a veritable revolution due to online food delivery platforms. By allowing customers to quickly order from a wide range of restaurants and outsourcing currently available couriers using their vehicles (crowdsourcing), this typology of service dynamically bridges demand and supply. The main goal of online food delivery platforms consists of matching couriers to meal orders within short time intervals to provide an efficient, reliable, and sustainable service. A way to increase efficiency consists of consolidating orders into batches, such that the same courier can serve several orders in multiple pickup and drop-off routes. Since such an assignment-batching problem becomes computationally prohibitively costly in real-world scenarios characterized by a large number of customer orders as well as uncertain demand and supply, heuristic solution methods come into play. This study proposes an order batching and assignment algorithm that leverages a graph-based approach after decomposing the original problem into more tractable sub-problems employing clustering. The solution is improved by local search moves and re-optimization procedures and integrated with advanced policies to improve solutions over time. An ‘Insertion policy’ aimed at increasing batch size, and a ‘Swap policy’ aimed at identifying more efficient assignments, are implemented and compared to a ‘Myopic policy’ that does not involve any re-optimization over time. An agent-based simulation framework is developed to implement dynamic policies where couriers’ operations and movements are realistically reproduced. The performance of the developed solution approach is tested through experiments based on a real-world case study. Results show that the algorithm allows for high-quality solutions in several configurations characterized by different demand and supply patterns (e.g., density levels, couriers availability) and problem sizes.In particular, the two advanced policies investigated considerably improve the solutions.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
abc完成签到 ,获得积分0
刚刚
猫的薛定谔完成签到,获得积分10
1秒前
1秒前
yyyy发布了新的文献求助10
1秒前
星辰大海的应助被可口可乐采纳,获得10
2秒前
ding的应助被科研通管家采纳,获得10
2秒前
molihuakai的应助被科研通管家采纳,获得10
2秒前
李健的应助被科研通管家采纳,获得10
2秒前
风吹麦浪的应助被科研通管家采纳,获得10
2秒前
无极微光的应助被科研通管家采纳,获得20
2秒前
研友_VZG7GZ的应助被科研通管家采纳,获得10
2秒前
2秒前
慕青的应助被科研通管家采纳,获得10
2秒前
3秒前
搜集达人的应助被科研通管家采纳,获得10
3秒前
Akim的应助被科研通管家采纳,获得10
3秒前
Lucas的应助被科研通管家采纳,获得10
3秒前
桐桐的应助被科研通管家采纳,获得10
3秒前
3秒前
秋风的应助被科研通管家采纳,获得30
3秒前
田様的应助被科研通管家采纳,获得10
3秒前
CipherSage的应助被科研通管家采纳,获得10
3秒前
大模型的应助被科研通管家采纳,获得10
4秒前
打打的应助被科研通管家采纳,获得10
4秒前
丘比特的应助被科研通管家采纳,获得10
4秒前
赘婿的应助被科研通管家采纳,获得10
4秒前
斯文败类的应助被科研通管家采纳,获得10
4秒前
Owen的应助被科研通管家采纳,获得10
4秒前
天天快乐的应助被科研通管家采纳,获得10
4秒前
慕慕完成签到 ,获得积分10
4秒前
4秒前
香蕉觅云的应助被科研通管家采纳,获得10
5秒前
天天快乐的应助被积极衫采纳,获得10
5秒前
开朗猕猴桃完成签到,获得积分10
5秒前
FashionBoy的应助被科研通管家采纳,获得10
5秒前
大模型的应助被科研通管家采纳,获得10
5秒前
Ava的应助被科研通管家采纳,获得10
5秒前
psj完成签到,获得积分0
5秒前
充电宝的应助被科研通管家采纳,获得10
5秒前
李健的应助被科研通管家采纳,获得10
5秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
拉伸高分子熔体中缠结行为的模拟和小角中子散射研究 1700
Grapes 1000
The World Atlas of Wine 9th edition 1000
奈特基础组织学:配套组织病理学(第4版)(Netter's Essential Histology With Correlated Histopathology) 800
John McDowells Bildungstheorie 800
八旗制度の研究 600
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 计算机科学 工程类 有机化学 化学工程 生物化学 物理 复合材料 内科学 催化作用 光电子学 人工智能 细胞生物学 无机化学 物理化学 数学
热门帖子
关注 科研通微信公众号,转发送积分 8178582
求助须知:如何正确求助?哪些是违规求助? 9569391
关于积分的说明 21804062
捐赠科研通 7773535
什么是DOI,文献DOI怎么找? 3432871
关于科研通互助平台的介绍 2556860
邀请新用户注册赠送积分活动 2478451