我们考虑一个日益流行的需求响应场景,用户根据实时电价安排灵活的电动汽车(EV)充电负荷。目标是在考虑用户不满的情况下最小化总充电成本。我们关注在线场景,即用户在每个时隙做出不可撤销的充电决策时,既无法获得未来实时电价的准确预测,也不知道其分布。对用户不满的考虑以及实现最优竞争比,使我们的工作区别于现有研究,并使本研究具有独特的挑战性。我们的核心贡献是两个简单的在线算法,在所有确定性算法中具有尽可能最优的竞争比。该最优竞争比的上界为 min{√(α/p_min), p_max/p_min},并且该界关于 α 是渐近紧致的,其中 p_max 和 p_min 是实时价格的上限和下限,α≥p_min 反映了对用户不满的考量。在 α 取较小和较大值时的界限表明,考虑用户不满(α 取小值)与不考虑用户不满(α 取大值)的问题存在根本差异。在此过程中,我们还开发了一种通用的在线算法设计技术,该技术源自 One-Way-Trading Problem 中提示的思想,可能具有独立的研究价值。基于真实世界轨迹的仿真结果证实了我们的理论发现,并表明与可设想的替代方案相比,我们的算法实现了显著的性能提升。结果还表明,提高 EV 充电速率限制几乎线性地降低了总成本。
英文摘要:
We consider an increasingly popular demand-response scenario where a user schedules the flexible electric vehicle (EV) charging load in response to real-time electricity prices. The objective is to minimize the total charging cost with user dissatisfaction taken into account. We focus on the online setting where neither accurate prediction nor distribution of future real-time prices is available to the user when making irrevocable charging decision in each time slot. The emphasis on considering user dissatisfaction and achieving optimal competitive ratio differentiates our work from existing ones and makes our study uniquely challenging. Our key contribution is two simple online algorithms with the best possible competitive ratio among all deterministic algorithms. The optimal competitive ratio is upper-bounded by \min\left\{ \sqrt{α/p_{\min}},p_{\max}/p_{\min}\right\} and the bound is asymptotically tight with respect to α, where p_{\max} and p_{\min} are the upper and lower bounds of real-time prices and α\geq p_{\min} captures the consideration of user dissatisfaction. The bound under small and large values of αsuggests the fundamental difference of the problems with considering user dissatisfaction (αtakes small values) and without (αtakes large values). Along the way we also develop a general technique for designing online algorithms from an idea hinted in One-Way-Trading Problem, which can be of independent interest. Simulation results based on real-world traces corroborate our theoretical findings and show that our algorithms achieve substantial performance gain as compared to conceivable alternatives. The results also suggest that increasing EV charging rate limit decreases overall cost almost linearly.
Electrical Vehicle Charging Station Profit Maximization: Admission, Pricing, and Online Scheduling
The Chinese University of Hong Kong(香港中文大学);Shenzhen Research Institute, The Chinese University of Hong Kong(香港中文大学深圳研究院);College of Information Engineering, Shenzhen University(深圳大学信息工程学院)
本文提出JoAP机制,通过联合优化电动汽车接入控制、定价和充电调度,提升充电站利润。通过 tandem 队列网络模型分析,设计最优算法并在模拟中验证其在不同等待时间惩罚率下利润提升达330%-531%。
Cost Minimization of Charging Stations with Photovoltaics: An Approach with EV Classification
Singapore University of Technology and Design(新加坡科技设计大学);Ministry of Home Affairs, Singapore(新加坡内政部);National ICT Australia(国家ICT澳大利亚);Australian National University(澳大利亚国立大学);Princeton University(普林斯顿大学)
Towards Hierarchical Multi-Agent Decision-Making for Uncertainty-Aware EV Charging
Dept. of Computer Science and Information Engineering, National Cheng Kung University, Taiwan(国立成功大学计算机科学与信息工程系);School of Computing and Augmented Intelligence, Arizona State University, USA(亚利桑那州立大学计算与增强智能学院)
The Fair Distribution of Power to Electric Vehicles: An Alternative to Pricing
College of Computer Science, Sichuan University(四川大学计算机学院);Department of Electrical Engineering, Columbia University(哥伦比亚大学电气工程系);Institute IMDEA Networks(IMDEA网络研究所);University of Electronic Science and Technology of China(电子科技大学)