arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1603.06263eess.SYcs.SY
收藏

数据驱动的鲁棒出租车调度在需求不确定性下

Data-Driven Robust Taxi Dispatch under Demand Uncertainties

University of Connecticut(康涅狄格大学);University of Illinois at Chicago(伊利诺伊大学芝加哥分校);Stony Brook University(石溪大学);University of Virginia(弗吉尼亚大学);Rutgers University(罗格斯大学);University of Minnesota(明尼苏达大学);University of Pennsylvania(宾夕法尼亚大学)

Fei Miao, Shuo Han, Shan Lin, Qian Wang, John Stankovic, Abdeltawab Hendawi, Desheng Zhang, Tian He, George J. Pappas

AI总结:

本文提出数据驱动的鲁棒出租车调度方法,以应对需求不确定性,通过构建不确定性集和利用极小极大定理,减少空驶里程并保持服务公平性。

摘要:

在现代出租车网络中,实时收集的出租车占用状态和位置数据提供了关于乘客需求和移动模式的系统模型知识,用于高效的出租车调度和协调策略。此类方法面临新挑战:如何在满足系统性能要求的同时处理预测顾客需求的不确定性,包括最小化出租车的总空驶里程并保持全市服务公平性;如何构建计算上可处理的问题。为此,我们开发了一种数据驱动的鲁棒出租车调度框架,以考虑时空相关的需求不确定性。我们所提出的鲁棒车辆调度问题在不确定需求中是凹的,在决策变量中是凸的。随机需求向量的不确定性集基于假设检验理论从数据中构建,并为鲁棒出租车调度解决方案的性能提供期望的概率保证水平。我们利用极小极大定理和强对偶性证明了鲁棒调度问题的等效计算上可处理形式。对纽约市四年出租车行程数据的评估表明,通过选择75%的概率保证水平,平均需求-供应比率误差减少了31.7%,平均总空驶驾驶距离减少了10.13%或约2000万英里,与非鲁棒调度方案相比。

英文摘要:

In modern taxi networks, large amounts of taxi occupancy status and location data are collected from networked in-vehicle sensors in real-time. They provide knowledge of system models on passenger demand and mobility patterns for efficient taxi dispatch and coordination strategies. Such approaches face new challenges: how to deal with uncertainties of predicted customer demand while fulfilling the system's performance requirements, including minimizing taxis' total idle mileage and maintaining service fairness across the whole city; how to formulate a computationally tractable problem. To address this problem, we develop a data-driven robust taxi dispatch framework to consider spatial-temporally correlated demand uncertainties. The robust vehicle dispatch problem we formulate is concave in the uncertain demand and convex in the decision variables. Uncertainty sets of random demand vectors are constructed from data based on theories in hypothesis testing, and provide a desired probabilistic guarantee level for the performance of robust taxi dispatch solutions. We prove equivalent computationally tractable forms of the robust dispatch problem using the minimax theorem and strong duality. Evaluations on four years of taxi trip data for New York City show that by selecting a probabilistic guarantee level at 75%, the average demand-supply ratio error is reduced by 31.7%, and the average total idle driving distance is reduced by 10.13% or about 20 million miles annually, compared with non-robust dispatch solutions.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑