共查询到19条相似文献,搜索用时 78 毫秒
1.
提出了一种解决电力市场环境下机组组合的新方法 ,考虑了包括网络安全约束在内的多种约束条件。这种方法首先将一个大系统按系统通常的运行方式分成一些小的子系统 ,满足联络线功率不过载的约束条件 ,并在这些小的子系统之间分配负荷 ;然后将各子系统的机组组合问题分为两层的规划问题 ,用动态规划法和分段线性规划算法分别解决这两个问题 ,并满足时间约束 ,机组出力上升、下降速度约束等各种约束条件。本算法经一个 8机系统的检验 ,说明本算法是非常有效的 相似文献
2.
电力市场环境下解决机组组合问题的新方法 总被引:4,自引:0,他引:4
机组组合问题是电力市场环境下编制短期发电计划所面临的主要问题,在满足各种约束条件的情况下,如何合理地开、停机组、以及负荷如何在运行的发电机组之间经济地分配是一个比较困难的问题,特别是由于发电机组出力上升、下降速度的限制,使这个问题一直没有很好的解决方法。提出一种组合优化方法解决这一问题,即用启发式方法确定机组组合,用分段线性规划算法分配功率,并满足各种约束条件,特别是可以处理发电机组出力上升、下降速度约束、经实际系统检验是一种非常有效的算法。 相似文献
3.
4.
5.
电力市场中机组组合的智能优化算法 总被引:1,自引:0,他引:1
随着电力市场的兴起,机组优化组合问题的目标函数和约束条件都发生了重大的变化,本文提出了在电力市场机制下机组组合问题的数学模型,并运用智能优化算法-遗传算法求解,该算法不同于常规优于算法的特点在于,能够从最后一代的母体群中产生多个满足约束条件的可行方案,为电钢调度提供了极大的灵活性。而且任何可以用罚因子项表示的约束条件可以考虑到遗传算法,适合大规模及超大规模问题的求解。 相似文献
6.
7.
8.
针对电力市场条件下火力发电厂机组组合问题,提出了改进的遗传算法。该方法采用二进制编码,并取染色体形式为矩阵形式,无须解码。在形成初始群体时结合单位煤耗优先顺序法,先确定出1个交易区间内的必开和必停机组,从而减小了算法的随机性。在选择过程中,采用排序选择法,加快了算法的收敛,并让变异概率按线性规律变化,充分考虑了算法的全局性。经算例验算表明了该算法在满足安全可靠的多约束下具备可行性。 相似文献
9.
在电力市场环境下,发电商需要在不确定信息下,考虑机组的最小开、停机时间,确定各自机组期望的最优运行状态,并进而优化各自的报价.为了使电力市场模拟中的发电商决策模型更合理,作者基于报价中标概率函数,建立了考虑机组开、停机时间约束的报价决策模型,对机组自组合状态优化和报价决策行为进行研究和模拟.为了求解该不确定性混合整数问题,将其转化成为Markov过程,并提出相应算法.算例表明:考虑机组最小开、停机时间约束后,发电商会为了增加连续开机的可能性而降低在谷荷时段的报价,而这种报价策略会进一步加大市场中的峰谷电价差.该研究为电力市场模拟中发电商的决策提供了新的思路. 相似文献
10.
11.
A new unit commitment method 总被引:1,自引:0,他引:1
This paper introduces a new unit commitment method based on a decommitment procedure for solving the power system resource scheduling problem. From an initial schedule of all available units committed over the study period, a `one-at-a-time' unit decommitment is accomplished by dynamic programming according to some specified economic criteria. The decommitment process continues until no further reduction in total cost is possible, or the unit schedules of two consecutive iterations over the time period remain unchanged without any violation of the spinning reserve constraint. Two criteria for decommiting a unit are introduced and described in detail. Comparisons of the proposed unit commitment method with the Lagrangian relaxation (LR) approach and Fred Lee's sequential unit commitment method (SUC) demonstrate the potential benefits of the proposed approach for power system operations planning 相似文献
12.
《Electric Power Systems Research》2002,62(3):215-224
Unit commitment with ramping constraints is a very difficult problem with significant economic impact. A new method is developed in this paper for scheduling units with ramping constraints within Lagrangian relaxation framework based on a novel formulation of the discrete states and the integrated applications of standard dynamic programming for determining the optimal discrete states across hours, and constructive dynamic programming for determining optimal generation levels. A section of consecutive running or idle hours is considered as a commitment state. A constructive dynamic programming (CDP) method is modified to determine the optimal generation levels of a commitment state without discretizing generation levels. The cost-to-go functions, required only for a few corner points with a few continuous state transitions at a particular hour, are constructed in the backward sweep. The optimal generation levels can be obtained in the forward sweep. The optimal commitment states across the scheduling horizon can then be obtained by standard dynamic programming. Numerical testing results show that this method is efficient and the optimal commitment and generation levels are obtained in a systematic way without discretizing or relaxing generation levels. 相似文献
13.
14.
Short-term thermal unit commitment-a new method 总被引:1,自引:0,他引:1
A method and an algorithm based on this new method are presented. The effectiveness of the algorithm is illustrated by studying a 20-unit midwestern utility system, the EPRI 174-unit synthetic utility system D, and the EPRI 155-unit synthetic utility system E. The algorithm produces the same unit commitment schedule for the 20-unit system as a frequently used DP-STC algorithm in 15 s of computation time versus 524 s, respectively. The computation time is approximately linear with the number of hours in the unit commitment horizon. For the EPRI 174-unit system the algorithm requires only 205 s of computation time on a VAX 11/780 for a 48-hour horizon 相似文献
15.
16.
17.
关联虚端子是智能变电站二次设计的主要内容,在对虚端子的数据格式和命名规范进行分析的基础上,提出了基于关键字符匹配原理的虚端子自动关联方法。该方法首先设置关联好的虚端子模板文件,再通过关键字符匹配使待关联文件中的虚端子与模板文件中功能相同的虚端子位置一致,从而实现对不同厂家不同型号的大部分虚端子自动关联;对于少量不能自动关联的虚端子,可缩小选择范围后手动关联。该方法能有效减少设计工作量,提升设计效率和质量。 相似文献
18.
介绍了一种新型的水电站监控现地单元 ,阐述了其设计思想、硬件构成、各项功能及实现这些功能的原理及方法 相似文献
19.
介绍了一种新型的水电站监控现地单元,阐述了其设计思想、硬件构成、各项功能及实现这些功能的原理及方法. 相似文献