首页> 外文会议>IEEE Power Energy Society General Meeting >Reduction of Computational Complexity for Optimal Electric Vehicle Schedulings
【24h】

Reduction of Computational Complexity for Optimal Electric Vehicle Schedulings

机译:减少最佳电动车程的计算复杂性

获取原文

摘要

This paper proposes a model to aggregate individual electric vehicles (EVs) into virtual EVs, which is called the EV aggregation cluster model (EACM). In addition, a multi-stage optimization method is also proposed to minimize the electricity cost for model buildings. The EACM and proposed multi-stage optimization method reduce the decision variables in an objective function while considering stage-of-charge (SoC) constraints for all individual EVs. As a result, the computational time is reduced and obtained schedules for individual EVs, allows for near minimal cost, which is validated by the simulation. In the simulation, the computational time using the proposed methods are 32% of the conventional method at most. The cost gap between an optimal EV charging schedule and an approximated one obtained by the proposed method is less than 5% regardless of the number of EVs.
机译:本文提出了一种模型,将各个电动车(EVS)聚集到虚拟EVS中,称为EV聚合群集模型(EACM)。此外,还提出了一种多级优化方法,以最小化模型建筑的电力成本。 EACM和所提出的多级优化方法在考虑所有单个EVS的阶段(SoC)约束的同时减少目标函数中的决策变量。结果,计算时间减少并获得各个EV的调度,允许近最低的成本,这通过模拟验证。在模拟中,使用所提出的方法的计算时间最多是传统方法的32%。无论EV的数量如何,所提出的方法所获得的最佳EV充电时间表和近似的成本差距小于5%。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号