首页> 外文期刊>Applied Energy >Distributed real-time demand response based on Lagrangian multiplier optimal selection approach
【24h】

Distributed real-time demand response based on Lagrangian multiplier optimal selection approach

机译:基于拉格朗日乘数最优选择方法的分布式实时需求响应

获取原文
获取原文并翻译 | 示例
           

摘要

In this paper, a real-time demand response (DR) framework and model for a smart distribution grid is formulated. The model is optimized in a distributed manner with the Lagrangian relaxation (LR) method. Consumers adjust their own hourly load level in response to real-time prices (RTP) of electricity to maximize their utility. Because the convergence performance of existing distributed algorithms highly relies on the selection of the iteration step size and search direction, a novel approach termed Lagrangian multiplier optimal selection (LMOS) is proposed to overcome this difficulty. Via sensitivity analysis, the energy demand elasticity of consumers can be effectively estimated. Then the LMOS model Can be established to optimize the Lagrangian multipliers in a relatively small linearized neighborhood. The salient feature of LMOS is its capability to optimally determine the Lagrangian multipliers during each iteration, which greatly improves the convergence performance of the distributed algorithm. Case studies based on a distribution grid with the number of consumers ranging from 10 to 100 and a real-world distribution grid demonstrate that the proposed method greatly outperforms the prevalent approaches, in terms of both efficiency and robustness. (C) 2017 Elsevier Ltd. All rights reserved.
机译:本文提出了一种智能配电网的实时需求响应(DR)框架和模型。使用拉格朗日松弛(LR)方法以分布式方式对模型进行了优化。消费者可以根据实时电价(RTP)调整自己的小时负荷水平,以最大程度地发挥其效用。由于现有分布式算法的收敛性能高度依赖于迭代步长和搜索方向的选择,因此提出了一种称为拉格朗日乘数最优选择(LMOS)的新颖方法来克服这一困难。通过敏感性分析,可以有效地估计消费者的能源需求弹性。然后可以建立LMOS模型,以在相对较小的线性化邻域中优化拉格朗日乘数。 LMOS的显着特征是它能够在每次迭代过程中最优地确定拉格朗日乘数,从而大大提高了分布式算法的收敛性能。基于消费者数量在10到100之间的分布网格和实际分布网格的案例研究表明,在效率和鲁棒性方面,所提出的方法大大优于现有方法。 (C)2017 Elsevier Ltd.保留所有权利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号