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

基于网络流优化的多目标预测出租车调度

Multi-Objective Predictive Taxi Dispatch via Network Flow Optimization

Beomjun Kim, Jeongho Kim, Subin Huh, Seungil You, Insoon Yang

摘要:

在本文中,我们讨论了一个大规模的车队管理问题的多目标设置。我们的目标是寻求一个后退地平线出租车调度解决方案,服务尽可能多的乘坐请求,同时最大限度地减少搬迁车辆的成本。为了获得所需的解决方案,我们首先将多目标出租车调度问题转化为一个网络流问题,可以使用经典的最小成本最大流(MCMF)算法来解决。我们表明,使用MCMF算法得到的解决方案是整数值,因此,它不需要任何额外的舍入过程,可能会引入不希望的数值误差。此外,我们证明了所提出的解决方案的时间贪婪性质,这证明了滚动优化的使用是合理的。为了提高计算效率,我们提出了一种线性规划方法,以获得近实时的最优解。我们的模拟研究,使用真实世界的数据,韩国首尔大都市区的结果表明,所提出的预测方法的性能几乎一样好的预言,预见未来。

英文摘要:

In this paper, we discuss a large-scale fleet management problem in a multi-objective setting. We aim to seek a receding horizon taxi dispatch solution that serves as many ride requests as possible while minimizing the cost of relocating vehicles. To obtain the desired solution, we first convert the multi-objective taxi dispatch problem into a network flow problem, which can be solved using the classical minimum cost maximum flow (MCMF) algorithm. We show that a solution obtained using the MCMF algorithm is integer-valued; thus, it does not require any additional rounding procedure that may introduce undesirable numerical errors. Furthermore, we prove the time-greedy property of the proposed solution, which justifies the use of receding horizon optimization. For computational efficiency, we propose a linear programming method to obtain an optimal solution in near real time. The results of our simulation studies using real-world data for the metropolitan area of Seoul, South Korea indicate that the performance of the proposed predictive method is almost as good as that of the oracle that foresees the future.

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

↑