arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1705.03070eess.SYcs.SYmath.OC
收藏

面向自主电动按需服务的多类调度与充电方案

A Multi-Class Dispatching and Charging Scheme for Autonomous Electric Mobility On-Demand

University of Idaho(爱达荷大学)

Syrine Belakaria, Mustafa Ammous, Sameh Sorour, Ahmed Abdel-Rahim

AI总结:

本文提出一种多类调度与充电方案,通过雾计算解决自主电动按需服务中的计算和充电延迟问题,优化车辆充电比例和客户服务决策,提升系统响应时间。

摘要:

尽管车辆自动化和电气化取得了显著进展,但自主电动按需服务的大规模部署仍受计算和充电延迟两大瓶颈制约。本文通过引入雾计算,提出了一种优化的多类调度与充电方案。首先引入了表示该方案的排队模型,推导了该模型的稳定性条件及任何给定城市区域能容纳的充电类别的数量。然后利用随机线性规划优化决定每类车辆的充电比例或直接服务客户,以最小化系统最大响应时间。结果表明,所提模型和优化决策方案在对比始终充电和均分方案方面具有优势。

英文摘要:

Despite the significant advances in vehicle automation and electrification, the next-decade aspirations for massive deployments of autonomous electric mobility on demand (AEMoD) services are still threatened by two major bottlenecks, namely the computational and charging delays. This paper proposes a solution for these two challenges by suggesting the use of fog computing for AEMoD systems, and developing an optimized multi-class charging and dispatching scheme for its vehicles. A queuing model representing the proposed multi-class charging and dispatching scheme is first introduced. The stability conditions of this model and the number of classes that fit the charging capabilities of any given city zone are then derived. Decisions on the proportions of each class vehicles to partially/fully charge, or directly serve customers are then optimized using a stochastic linear program that minimizes the maximum response time of the system. Results show the merits of our proposed model and optimized decision scheme compared to both the always-charge and the equal split schemes.

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

↑