首页> 外文会议>International Conference on Intelligent Green Building and Smart Grid >Research on Solving Method of Security Constrained Unit Commitment Based on Improved Stochastic Constrained Ordinal Optimization
【24h】

Research on Solving Method of Security Constrained Unit Commitment Based on Improved Stochastic Constrained Ordinal Optimization

机译:基于改进的随机约束有序优化的安全约束单元承诺求解方法研究

获取原文

摘要

Research on efficient and accurate algorithm for solving the problem of security constrained unit commitment (SCUC) is of great significance to the development of intermittent renewable energy and electricity marketization. On the basis of existing constrained ordinal optimization (COO), this paper proposes an improved ordinal optimization (OO) algorithm which can be applied to solving the SCUC problems. In order to solve the crude model and precise model, discrete variable identification strategy and effective security constraint reduction strategy are respectively adopted. Compared to the traditional method, this modified OO algorithm gives full play to the traditional OO in computational efficiency while further enhances the compactness and reduces the computation redundancy. The correctness and effectiveness of the proposed algorithm are verified by the IEEE118 simulation results.
机译:研究高效,准确的算法来解决安全约束单位承诺问题(SCUC)对间歇性可再生能源和电力市场化的发展具有重要意义。在现有约束序优化(COO)的基础上,提出了一种改进的序优化(OO)算法,可用于解决SCUC问题。为了求解粗模型和精确模型,分别采用离散变量识别策略和有效的安全约束减少策略。与传统方法相比,该改进的OO算法在计算效率上充分发挥了传统OO的作用,同时进一步提高了结构的紧凑性,减少了计算的冗余。 IEEE118仿真结果验证了所提算法的正确性和有效性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号