A combination of the genetic algorithm and lagrangian relaxation decomposition techniques for the generation unit commitment problem

Unit commitment involves the scheduling of generators in a power system in order to meet the requirements of a given load profile. An analysis of the basis for combining the genetic algorithm (GA) and Lagrangian relaxation (LR) methods for the unit commitment problem is presented. It is shown that a robust unit commitment algorithm can be obtained by combining the global search property of the genetic algorithm with the ability of the Lagrangian decomposition technique to handle all kinds of constraints such as pollution, unit ramping and transmission security.     

Using immune genetic algorithm based hybrid techniques for short-term unit commitment problem

This paper presents a hybrid chaos search (CS), immune algorithm (IA)/genetic algorithm (GA), and fuzzy system (FS) method (CIGAFS) for solving short-term thermal generating unit commitment (UC) problems. The UC problem involves determining the start-up and shut-down schedules for generating units to meet the forecasted demand at the minimum cost. The commitment schedule must satisfy other constraints such as the generating limits per unit, reserve, and individual units. First, we combined the IA and GA, then we added the CS and the FS approach. This hybrid system was then used to solve the UC problems. Numerical simulations were carried out using three cases: 10, 20, and 30 thermal unit power systems over a 24 h period. The produced schedule was compared with several other methods, such as dynamic programming (DP), Lagrangian relaxation (LR), standard genetic algorithm (SGA), traditional simulated annealing (TSA), and traditional Tabu search (TTS). A comparison with an immune genetic algorithm (IGA) combined with the CS and FS was carried out. The results show that the CS and FS all make substantial contributions to the IGA. The result demonstrated the accuracy of the proposed CIGAFS approach.     

Cooperative coevolutionary algorithm for unit commitment

This paper presents a new cooperative coevolutionary algorithm (CCA) for power system unit commitment. CCA is an extension of the traditional genetic algorithm (GA) which appears to have considerable potential for formulating and solving more complex problems by explicitly modeling the coevolution of cooperating species. This method combines the basic ideas of Lagrangian relaxation technique (LR) and GA to form a two-level approach. The first level uses a subgradient-based stochastic optimization method to optimize Lagrangian multipliers. The second level uses GA to solve the individual unit commitment sub-problems. CCA can manage more complicated time-dependent constraints than conventional LR. Simulation results show that CCA has a good convergent property and a significant speedup over traditional GAs and can obtain high quality solutions. The "curse of dimensionality" is surmounted, and the computational burden is almost linear with the problem scale     

Application embedded chaos search immune genetic algorithm for short-term unit commitment

This paper presents a Hybrid Chaos Search (CS) immune algorithm (IA)/genetic algorithm (GA) and Fuzzy System (FS) method (CIGAFS) for solving short-term thermal generating unit commitment (UC) problems. The UC problem involves determining the start-up and shutdown schedules for generating units to meet the forecasted demand at the minimum cost. The commitment schedule must satisfy other constraints such as the generating limits per unit, reserve and individual units. First, we combined the IA and GA, then we added the chaos search and the fuzzy system approach. This hybrid system was then used to solve the UC problems. Numerical simulations were carried out using three cases: 10, 20 and 30 thermal unit power systems over a 24 h period. The produced schedule was compared with several other methods, such as dynamic programming (DP), Lagrangian relaxation (LR), Standard genetic algorithm (SGA), traditional simulated annealing (TSA), and Traditional Tabu Search (TTS). A comparison with an IGA combined with the Chaos Search and FS was carried out. The results show that the Chaos Search and FS all make substantial contributions to the IGA. The result demonstrated the accuracy of the proposed CIGAFS approach.     

A genetic algorithm solution to the unit commitment problem

This paper presents a genetic algorithm (GA) solution to the unit commitment problem. GAs are general purpose optimization techniques based on principles inspired from the biological evolution using metaphors of mechanisms such as natural selection, genetic recombination and survival of the fittest. A simple GA algorithm implementation using the standard crossover and mutation operators could locate near optimal solutions but in most cases failed to converge to the optimal solution. However, using the varying quality function technique and adding problem specific operators, satisfactory solutions to the unit commitment problem were obtained. Test results for power systems of up to 100 units and comparisons with results obtained using Lagrangian relaxation and dynamic programming are also reported     

基于混沌遗传混合优化算法的短期负荷环境和经济调度

环境和经济短期负荷调度主要由在调度周期内的最优机组组合和负荷分配组成,该文将优先次序法、遗传算法与混沌优化相结合,以应用到电站机组环境／经济运行优化问题中,在混沌遗传算法中采用递阶基因结构,将控制基因用于机组组合全局粗寻优,参数基因用于负荷分配局部优化, 基因修正与罚函数相结合解决约束问题,采用混沌扰动避免遗传算法早熟,运用基于线性搜索的混沌局部优化方法,加快算法的收敛速度和降低计算时间,优化计算结果可以同时得到最优机组组合及负荷最优分配,为实际调度系统提供了一个良好的方法。     

一种求解大规模机组组合问题的混合智能遗传算法

针对传统的采用二进制编码的遗传算法在求解大规模机组组合问题时收敛速度慢、易早熟等问题,作者结合机组组合问题的特点,提出了一种混合智能遗传算法.该算法以机组状态作为个体编码,结合启发式方法的自适应智能变异算子求解目标函数,显著缩小了求解问题的规模,保证了群体多样性,提高了算法的搜索效率,改善了算法的收敛性.仿真计算结果表明了该算法的有效性和实用性.     

机组优化组合的人工神经网络拉格朗日混合方法

本文提出了一种求解电力系统组合优化问题的混合神经网络－拉格朗日方法，至今，拉格朗日枪驰法－直被记是机组优化组合近解的实用方法，这样，基于神经网络的监督学习和自适应识别概念，我们用神经网络来推测负荷需求与拉格朗日乘子的非线性关系，并且采用了优化的学习速率和势态项来加速网络的收敛，数值计算的结果表明本文的方法是可行的。     

基于遗传粒子群混合算法的机组组合优化

节能发电调度的目标是实现能耗量最小,合理安排机组发电计划则更为至关重要。在参考文献的基础上,提出了一种用于机组组合优化的遗传粒子群混合优化算法。先用遗传算法求解机组组合,再用粒子群优化算法求解负荷经济分配。按照节能调度思路对遗传算法进行了改进,提高了优化性能。给出了10机算例系统优化结果,验证了该混合算法的可行性和有效性。     

兼顾经济和环保效益的机组组合

在节能减排背景下,提出了同时兼顾经济和环保效益的多目标机组组合模型,基于拉格朗日松弛法的思想,将该问题分解为单机子问题,在子问题中利用并列选择遗传算法对经济和环保效益进行双目标优化。分别以发电费用最小、排放最小和综合最小为目标建立模型,对6机30节点算例进行了计算和比较,验证了算法和模型的有效性,实现了综合考虑经济和环保因素的机组组合问题的求解。     

遗传粒子群混合算法在电厂机组负荷组合优化中的应用

粒子群优化算法应用于火电厂机组组合问题中存在早熟收敛等现象,提出3方面改进的遗传粒子群混合算法:改进粒子群初始化方法,提出粒子初始化机组运行状态组合合理性判据,并初始化一定比例的粒子使其机组负荷随机在对应机组负荷上限附近赋值;采用部分解除约束结合惩罚函数的约束处理方法,对粒子进行机组负荷平衡操作,使大部分粒子满足约束条件;通过引入遗传算法中的交叉和变异操作增加了粒子的多样性,减小了算法陷入局部极值的可能性。采用改进的遗传粒子群混合算法对3机及5机火电厂机组负荷组合进行优化,仿真结果表明,优化成功率能达到100%。     

A solution for unit commitment using Lagrangian relaxation combined with evolutionary programming

This paper proposes an approach which combines Lagrangian relaxation principle and evolutionary programming for short-term thermal unit commitment. Unit commitment is a complex combinatorial optimization problem which is difficult to be solved for large-scale power systems. Up to now, the Lagrangian relaxation is considered the best to deal with large-scale unit commitment although it cannot guarantee the optimal solution. In this paper, an evolutionary programming algorithm is used to improve a solution obtained by the Lagrangian relaxation method: Lagrangian relaxation gives the starting point for a evolutionary programming procedure. The proposed algorithm takes the advantages of both methods and therefore it can search a better solution within short computation time. Numerical simulations have been carried out on two test systems of 30 and 90 thermal units power systems over a 24-hour periods.     

考虑网络安全约束的机组组合新算法

市场机制驱使电网运行于安全极限的边缘,考虑网络安全约束的机组组合问题变得尤为重要,基于对偶原理的拉格朗日松弛法是解决这一问题的有效途径。文章提出了一种解决网络安全约束下的机组组合问题的新算法,在拉格朗日对偶分解的基础上结合变量复制技术,通过引入附加人工约束将网络约束嵌入单机子问题中,实现在机组组合中考虑网络安全约束。该算法摆脱了现有各种处理手段在解决网络安全约束的机组组合问题时将网络安全约束与机组启停相分离的不足,揭示了安全经济调度和安全约束下的机组组合在概念上的区别和联系。     

考虑发电机组输出功率速度限制的最优机组组合

本文对发电机组输出功率速度限制条件下的电优机组组合问题进行了研究，提出了基于拉格朗日松弛原理的协调求解方法，构造在了构弛功率平衡约束的情况下的分离单机子问题的简单的网络模型，从而利用最短路径算法求出可行的组合方案。在此基础，利用动态优化调度的新算法－积留量法进行调整，从而达到机组组合与运行的良好协调，算例的试算，获得了较满意的效果。     

Coordination of Midterm Outage Scheduling With Short-Term Security-Constrained Unit Commitment

The proposed model solves the coordinated generation and transmission maintenance scheduling with security-constrained unit commitment (SCUC) over the scheduling horizon of weeks to months. The model applies the Lagrangian relaxation technique to decompose the optimization problem into subproblems for generation maintenance scheduling, transmission maintenance scheduling, and short-term SCUC. The decomposition and cooperation strategy is applied to the first two subproblems for the scheduling of generation and transmission maintenance. The SCUC solution is based on the mixed integer programming (MIP) technique. The optimal hourly results for maintenance scheduling, generation unit commitment, and transmission flows are obtained using a chronological load curve. Effective strategies are applied for accelerating the convergence of the hourly solution. The numerical examples demonstrate the effectiveness of the proposed model.     

Implementation of a Lagrangian relaxation based unit commitmentproblem

An effort is made to provide an understanding of the practical aspects of the Lagrangian relaxation methodology for solving the thermal unit commitment problem. Unit commitment is a complex, mixed integer, nonlinear programming problem complicated by a small set of side constraints. Until recently, unit commitment for realistic size system has been solved using heuristic approaches. The Lagrangian relaxation offers a new approach for solving such problems. Essentially, the method involves decomposition of the problem into a sequence of master problems and easy subproblems, whose solutions converge to an ϵ-optimal solution to the original problem. The authors concentrate on the implementation aspects of the Lagrangian relaxation method applied to realistic and practical unit commitment problems     

基于SCUC的可入网混合电动汽车优化调度方法

在可入网混合电动汽车(PHEV)有望规模化应用的背景下,以传统的计及安全约束的机组最优组合(SCUC)问题为基础,发展了能够容纳PHEV的电力系统优化调度数学模型。所发展的模型以保证系统安全运行为前提,兼顾了PHEV车主的经济效益与发电的碳排放成本。利用PHEV作为可移动电量储存单元的特性,将模型解耦为机组最优组合与计及交流潮流约束的充/放电计划优化2个子模型。应用混合整数规划方法和牛顿—拉夫逊潮流算法迭代求解优化问题,可以同时获取日前机组调度计划和各时段的PHEV最优接纳容量及充/放电计划等结果。最后,以6节点和IEEE 118节点2个系统为例,验证了所构建模型的正确性和有效性。     

The conditions for obtaining feasible solutions to security-constrained unit commitment problems

The core of solving security-constrained unit commitment (SCUC) problems within the Lagrangian relaxation framework is how to obtain feasible solutions. However, due to the existence of the transmission constraints, it is very difficult to determine if feasible solutions to SCUC problems can be obtained by adjusting generation levels with the commitment states obtained in the dual solution of Lagrangian relaxation. The analytical and computational necessary and sufficient conditions are presented in this paper to determine the feasible unit commitment states with grid security constraints. The analytical conditions are proved rigorously based on the feasibility theorem of the Benders decomposition. These conditions are very crucial for developing an efficient method for obtaining feasible solutions to SCUC problems. Numerical testing results show that these conditions are effective.     

遗传/禁忌组合算法在发电机组优化组合中的应用

在研究遗传算法 (GA)和禁忌算法 (TS)的基础上 ,提出一种采用遗传 /禁忌组合算法 (GA/TS)的策略 ,并将其应用于发电机组的优化组合中 ,同时用算例证明该方法的有效性和应用前景。     

市场竞争条件下发电机组启停机计划优化研究

探讨市场竞争条件下的发电机组启停机计划问题有助于发电厂制定发电机组安全经济运行方案。文章以发电厂收益最大化为目标函数,考虑了无功和备用收益的影响,以机组本身的可用状态、发电功率限制、爬坡速率以及系统备用容量和电力市场交易等为约束条件,构造了市场竞争条件下发电机组启停机计划问题的数学模型,并提出了一种综合了二次规划、遗传算法、模拟退火算法的优点的混合优化方法进行解算。对某8机系统进行的算例分析表明:市场竞争条件下考虑了备用收入影响的发电厂启停机计划发生了一些变化;发电厂为了追求更大的收益更加注重生产成本问题;其通过竞争获得的发电功率直接影响发电机组启停计划及其功率分配;文中提出的混合优化算法较适用于求解市场条件下的启停机计划等优化问题。