Dispatch or Hold? An Inverse Optimization and Reinforcement Learning Approach for Multiobjective On-Demand Delivery

马尔可夫决策过程 计算机科学 强化学习 数学优化 合并(业务) 经济调度 运筹学 集合(抽象数据类型) 启发式 交付性能 马尔可夫链 最优化问题 订单(交换) 马尔可夫过程 提前期 模拟退火 钥匙(锁)
作者
Yihua Wang,Long He,Zhengling Qi,Stefan Minner
出处
期刊:Transportation Science [Institute for Operations Research and the Management Sciences]
标识
DOI:10.1287/trsc.2025.0149
摘要

In large-scale on-demand food delivery systems, dynamic order dispatching needs to balance immediate dispatch and order holding amid competing objectives, including delivery efficiency, service timeliness, and courier utilization. Holding certain orders for future consolidation may improve delivery efficiency but impair timeliness. In such systems, real-time decisions must be made to determine both when to dispatch orders and how to dispatch orders by grouping them to share dispatch routes. We propose a hierarchical offline estimation and on-policy learning framework that integrates inverse optimization with deep reinforcement learning. First, the framework decides which orders to dispatch immediately and which to hold for future periods. Next, it consolidates the dispatched orders by solving a multiobjective weighted set partitioning problem. We estimate the tradeoff weights across multiple delivery objectives using real-world data via cutting plane–based inverse optimization that supports combinatorial decisions. The learned cost structure is then embedded in a Markov decision process, and a dispatch policy is trained with proximal policy optimization to maximize long-term performance. We validate our approach using real-world data from a major food delivery platform. Compared with the platform’s current practice and the heuristic benchmarks, the learned policy significantly improves operational performance and provides the most effective balance across all operational objectives. The evaluation results demonstrate that strategic order holding can effectively increase grouping opportunities and improve overall delivery efficiency. In periods and areas with low order arrival density, a longer holding time can yield better consolidation opportunities and improved delivery efficiency. However, orders with long travel distances are less suitable for holding due to limited potential for grouping. History: This paper has been accepted for the Transportation Science Special Issue on The First INFORMS TSL Data-Driven Research Challenge. Funding: This research was supported by the Deutsche Forschungsgemeinschaft as part of the following research group: Advanced Optimization in a Networked Economy [Grant GRK2201/277991500] and by the Cross-Disciplinary Research Fund (CDRF) from George Washington University. Supplemental Material: The online appendix is available at https://doi.org/10.1287/trsc.2025.0149 .

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
年轮完成签到,获得积分20
刚刚
1秒前
1秒前
2秒前
搜集达人应助paperslicing采纳,获得10
2秒前
2秒前
zhangzi完成签到,获得积分10
3秒前
3秒前
TYT发布了新的文献求助20
3秒前
林瑶完成签到,获得积分10
4秒前
4秒前
37发布了新的文献求助10
5秒前
年轮发布了新的文献求助10
6秒前
6秒前
黄湘完成签到,获得积分20
7秒前
难过从云发布了新的文献求助10
7秒前
7秒前
专注凌柏完成签到,获得积分10
8秒前
凸迩丝儿发布了新的文献求助10
8秒前
9秒前
9秒前
9秒前
9秒前
黄湘发布了新的文献求助10
9秒前
10秒前
10秒前
10秒前
Lee完成签到,获得积分10
10秒前
大个应助难过从云采纳,获得10
12秒前
红叶再开应助林夕采纳,获得10
12秒前
Blue_Pig发布了新的文献求助10
12秒前
mesome完成签到,获得积分10
13秒前
13秒前
zllwaw发布了新的文献求助10
13秒前
邢哥哥发布了新的文献求助10
14秒前
热心雪一发布了新的文献求助10
14秒前
TYT发布了新的文献求助10
14秒前
15秒前
暖暖发布了新的文献求助10
15秒前
15秒前
高分求助中
Markov Chain Monte Carlo 10000
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Common Foundations of American and East Asian Modernisation: From Alexander Hamilton to Junichero Koizumi 5000
Pediatric Dermoscopy Trichoscopy & Onychoscopy 2030
Matrix Methods in Data Mining and Pattern Recognition Second Edition 610
Handbuch Trainingswissenschaft – Trainingslehre 500
Additive Manufacturing Design and Applications (ASM Handbook, Volume 24A) 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7576901
求助须知:如何正确求助?哪些是违规求助? 9156507
关于积分的说明 19588888
捐赠科研通 7160703
什么是DOI,文献DOI怎么找? 3265177
关于科研通互助平台的介绍 2430231
邀请新用户注册赠送积分活动 2255777