评估网约出租车拼车服务中高级会员优先调度方案
Evaluating Priority Dispatch for Premium Membership in On-demand Taxi-sharing
AI 导读
一项 arXiv 论文用顺序最优插入方法分析了在网约出租车拼车服务中引入高级会员调度的可行性，提出两种调度方法：缩短高级用户截止时间，以及缩短截止时间并配专用高级车辆。基于 SUMO 仿真、在稳态均匀需求、含高峰期时变需求和城市集中高峰需求三种场景下与基线方法对比，结果显示合适的优先机制取决于运营条件和高级会员比例，按条件切换方法可在保持非会员负担较小的同时提供会员优先权益。
正文 · 原文
Abstract:In this paper, we analyze the dispatch-level feasibility of introducing premium membership into an on-demand taxi-sharing service using a sequential optimal insertion method. We propose two dispatch-level methods: deadline shortening for premium users, and deadline shortening with dedicated premium vehicles. We compare them with a baseline dispatch method through SUMO-based simulations under three demand scenarios: steady uniform demand, time-varying demand with a peak period, and urban-focused demand with concentrated peak traffic. Our results show that the suitable priority mechanism depends on operating conditions and premium ratio, suggesting that condition-dependent method switching may provide premium benefits while keeping non-premium-user burden smaller for overall optimization.
| Subjects: | Multiagent Systems (cs.MA); Artificial Intelligence (cs.AI) |
| Cite as: | arXiv:2610.37011 [cs.MA] |
| (or arXiv:2610.37011v1 [cs.MA] for this version) | |
| https://doi.org/10.48550/arXiv.2610.37011 arXiv-issued DOI via DataCite (pending registration) |
|
| Related DOI: | https://doi.org/10.1007/978-3-032-41794-7_30
DOI(s) linking to related resources |
Submission history
From: Hiroki Sakaji [view email]
[v1]
Tue, 27 Oct 2026 10:52:40 UTC (1,946 KB)
来源：arXiv cs.AI · arxiv.org