论文标题
基于拉格朗日放松和动态编程的大规模单位承诺的快速解决方案方法
A Fast Solution Method for Large-scale Unit Commitment Based on Lagrangian Relaxation and Dynamic Programming
论文作者
论文摘要
单位承诺问题（UC）对于电力系统的运营和市场机制至关重要。随着现代电力的发展，电力系统的规模正在扩大，解决UC问题也越来越困难。为此，本文提出了一种基于拉格朗日放松和动态程序修饰的新快速解决方案方法。首先，通过基于拉格朗日放松的快速方法，估计UC解决方案是初始试验UC解决方案。最初的试验UC解决方案完全考虑了全系统范围的界限。其次，引入了动态编程模块以调整试验UC解决方案，以使其满足单位约束。第三，根据调整后的试验UC解决方案提出了一种构建可行UC解决方案的方法。具体而言，在本部分中建立了可行性测试模型和试验UC解决方案的更新策略。数值测试是在IEEE 24总线，IEEE 118-Bus，Polish 2383-Bus和French 6468-Bus系统上实施的，这些系统验证了所提出的方法的效率和效率。
The unit commitment problem (UC) is crucial for the operation and market mechanism of power systems. With the development of modern electricity, the scale of power systems is expanding, and solving the UC problem is also becoming more and more difficult. To this end, this paper proposes a new fast solution method based on Lagrangian relaxation and dynamic program-ming. Firstly, the UC solution is estimated to be an initial trial UC solution by a fast method based on Lagrangian relaxation. This initial trial UC solution fully considers the system-wide con-straints. Secondly, a dynamic programming module is introduced to adjust the trial UC solution to make it satisfy the unit-wise constraints. Thirdly, a method for constructing a feasible UC solution is proposed based on the adjusted trial UC solution. Specifically, a feasibility-testing model and an updating strategy for the trial UC solution are established in this part. Numerical tests are implemented on IEEE 24-bus, IEEE 118-bus, Polish 2383-bus, and French 6468-bus systems, which verify the effec-tiveness and efficiency of the proposed method.
