摘要
安全约束机组组合(security constrained unit commitment,SCUC)是电网出清场景中最为广泛使用的一类模型。建立了一种针对超大规模SCUC现货市场出清问题的求解框架,首先提出了SCUC问题的时间解耦求解方法,通过缩小问题的规模来加快求解速度;其次针对时间解耦后模型的子问题提出了拉格朗日松弛求解技术,在不影响求解准确度的情况下,有效降低了关键困难约束的求解难度。数值实验证明,所提出的框架极大地提升了求解效率,且十分稳定。
Security constrained unit commitment(SCUC)is the most widely used model in power grid clearing scenarios.A solution framework for the super large SCUC spot market clearing problem is established.Firstly,the time decoupling solution method for SCUC problem is introduced,which is intended to reduce the size of the problem to accelerate the solving speed.Then a Lagrangian relaxation technique is proposed to solve the time decoupled subproblem,which effectively reduces the difficulty of solving key complex constraints without affecting the accuracy of the solution.Numerical experiments show that the proposed framework greatly improves the solution efficiency and is very stable.
作者
彭超逸
顾慧杰
周华锋
邱方堃
张淼
葛言
PENG Chaoyi;GU Huijie;ZHOU Huafeng;QIU Fangkun;ZHANG Miao;GE Yan(Power Dispatching and Control Center,CSG,Guangzhou 510663,China;Cardinal Operations(Beijing)Co.,Ltd.,Beijing 100102,China;Research Institute for Interdisciplinary Sciences,Shanghai University of Finance and Economics,Shanghai 200433,China)
出处
《南方电网技术》
CSCD
北大核心
2024年第1期3-13,27,共12页
Southern Power System Technology
基金
国家自然科学基金资助项目(NSFC-72150001,72225009,11831002)
中国南方电网有限责任公司技改项目(000000GS 61200020)。