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.     

Short-term thermal generation scheduling using improved immune algorithm

This paper proposes a new immune algorithm (NIA), which merges the fuzzy system (FS), the annealing immune (AI) method and the immune algorithm (IA) together, to resolve short-term thermal generation unit commitment (UC) problems. This proposed method differs from its counterparts in three main aspects, namely: (1) changing the crossover and mutation ratios from a fixed value to a variable value determined by the fuzzy system method, (2) using the memory cell and (3) adding the annealing immune operator. With these modifications, we can attain three major advantages with the NIA, i.e. (1) the NIA will not fall into a local optimal solution trap; (2) the NIA can quickly and correctly find a full set of global optimal solutions and (3) the NIA can achieve the most economic solution for unit commitment with ease. The UC determines the start-up and shut-down schedules for related generation units to meet the forecasted demand at a minimum cost while satisfying other constraints, such as each unit's generating limit. The NIA is applied to six cases with various numbers of thermal generation units over a 24-h period. The schedule generated by the NIA is compared with that by several other methods, including the dynamic programming (DP), the Lagrangian relaxation (LR), the standard genetic algorithm (GA), the traditional simulated annealing (SA) and the traditional Tabu search (TS). The comparisons verify the validity and superiority in accuracy for the proposed method.     

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

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

基于矩阵实数编码遗传算法求解大规模机组组合问题

该文提出了一种采用矩阵实数编码遗传算法(MRCGA)进行机组组合优化的新方法：采用矩阵实数编码方式对整体发电计划进行编码后，可直接运用遗传操作求解机组组合问题，避免将其分解成机组启停安排和经济负荷分配的两层优化问题进行求解；采用多窗口变异技术，增强了算法的搜索能力。此方法提出了一种新的个体调整方法，可以处理各项约束条件，保证了结果的可行性。文中通过2个算例及与其它算法的对比分析，验证了所提出的方法在大规模机组组合问题求解时具有很强的适应性和全局搜索能力。     

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

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

Unit commitment using hybrid models: a comparative study for dynamic programming, expert system, fuzzy system and genetic algorithms

Hybrid models for solving unit commitment problem have been proposed in this paper. To incorporate the changes due to the addition of new constraints automatically, an expert system (ES) has been proposed. The ES combines both schedules of units to be committed based on any classical or traditional algorithms and the knowledge of experienced power system operators. A solution database, i.e. information contained in the previous schedule is used to facilitate the current solution process. The proposed ES receives the input, i.e. the unit commitment solutions from a fuzzy-neural network. The unit commitment solutions from the artificial neural network cannot offer good performance if the load patterns are dissimilar to those of the trained data. Hence, the load demands, i.e. the input to the fuzzy-neural network is considered as fuzzy variables. To take into account the uncertainty in load demands, a fuzzy decision making approach has also been developed to solve the unit commitment problem and to train the artificial neural network. Due to the mathematical complexity of traditional techniques for solving unit commitment problem and also to facilitate comparison genetic algorithm, a non-traditional optimization technique has also been proposed. To demonstrate the effectiveness of the models proposed, extensive studies have been performed for different power systems consisting of 10, 26 and 34 generating units. The generation cost obtained and the computational time required by the proposed model has been compared with the existing traditional techniques such as dynamic programming (DP), ES, fuzzy system (FS) and genetic algorithms (GA).     

Unit commitment using a hybrid model between Lagrangian relaxation and genetic algorithm in competitive electricity markets

This paper presents a hybrid model between Lagrangian relaxation (LR) and genetic algorithm (GA) to solve the unit commitment problem. GA is used to update the Lagrangian multipliers. The optimal bidding curves as a function of generation schedule are also derived. An IEEE 118-bus system is used to demonstrate the effectiveness of the proposed hybrid model. Simulation results are compared with those obtained from traditional unit commitment.     

基于免疫遗传算法优化的神经网络配电网网损计算

提出了一种基于免疫遗传算法(IGA)的BP神经网络方法计算配电网的理论线损。该算法在遗传算法(GA)的基础上引入生物免疫系统中的多样性保持机制和抗体浓度调节机制,有效地克服了GA算法的搜索效率低、个体多样性差及早熟现象,提高了算法的收敛性能。为了解决BP神经网络权值随机初始化带来的问题,用多样性模拟退火算法(SAND)进行神经网络权值初始化,并给出了算法详细的设计步骤。仿真结果表明,同混合遗传算法相比,该算法设计的BP神经网络具有较快的收敛速度和较强的全局收敛性能, 比现有其它计算配电网理论线损的方法更为     

基于遗传算法的机组组合研究

针对遗传算法应用于机组组合问题的具体实现技术进行了深入的研究，实现了采用不同采样空间，不同选择策略，不同适值函数和不同交叉率／变异率的遗传算法和机组组合计算程序，并对10机系统和110机系统的仿真计算进行了分析和比较。结果表明各种不同实现技术的遗传算法应用到机组组合问题具有不同程度的有效性，另外，遗传算法的不同实现技术对收敛时间，收敛代数和收敛值也有较大的影响。文中在计算研究的基础上提出了适用于机组组合问题的遗传算法的具体实现技术，为遗传算法应用到机组组合问题的实用化研究奠定了坚实的基础。     

考虑灵活运行机组的随机机组组合模型

提出一种随机机组组合模型.为兼顾节能环保,该模型除考虑常规火电机组之外,还考虑了灵活运行机组和风电机组.灵活运行机组具有多种运行模式,将每种模式虚拟为一台单独的发电机,通过设置相应的参数和约束条件实现模式之间的转换,易于与传统机组组合模型相结合.在常规机组组合模型中加入投运风险约束,通过该约束不同的变形形式可以分别考虑负荷波动、发电机组故障和风电场输出功率波动等多种随机因素.2个简单系统的算例分析显示了所述模型在处理灵活运行机组以及考虑随机因素方面的有效性.4个不同规模的算例分析显示,模型的计算时间能够满足工程计算的需要,具有一定的实际应用前景.     

A parallel genetic algorithm approach to solving the unitcommitment problem: implementation on the transputer networks

Through a constraint handling technique, this paper proposes a parallel genetic algorithm (GA) approach to solving the thermal unit commitment (UC) problem. The developed algorithm is implemented on an eight-processor transputer network, processors of which are arranged in master-slave and dual-direction ring structures, respectively. The proposed approach has been tested on a 38-unit thermal power system over a 24-hour period. Speed-up and efficiency for each topology with different number of processor are compared to those of the sequential GA approach. The proposed topology of dual-direction ring is shown to be well amenable to parallel implementation of the GA for the UC problem     

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

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

免疫算法及其在电力系统无功优化中的应用

提出一种用于电力系统无功优化的免疫算法(Immune Algorithm,IA).该算法是根据生物免疫原理提出的,与遗传算法相比,它具有抗原识别、记忆、抗体的抑制和促进等显著特点.IA将目标函数和约束条件比作抗原,将问题的解比作抗体.通过亲和度的计算来评价抗体并促进或抑制抗体的产生,减小了进化过程陷入局部最优解的可能性;通过抗原记忆,提高了局部搜索能力,加快了计算速度.将IA用于69节点实际电力系统的无功优化计算,并与传统遗传算法的计算结果进行了比较.结果表明IA能够以更快的速度得到最优解,其性能明显优于遗传算法.     

IGA优化的神经网络计算配电网理论线损

针对BP神经网络学习速度慢、容易陷入局部极小的缺点,提出了一种基于免疫遗传算法(IGA)的人工神经网络(artificial neural network,ANN)计算配电网的理论线损.该算法在遗传算法(genetic algorithm,GA)的基础上引入生物免疫系统中的多样性保持机制和抗体浓度调节机制,有效地克服了GA算法的搜索效率低、个体多样性差及早熟现象, 扩大了神经网络的权值搜索空间,提高了网络系统的学习效率和精度.实例计算结果表明,同混合遗传算法相比,该算法具有较快的收敛速度和较强的全局收敛性能,比现有其他计算配网线损的方法更为准确.     

An evolutionary optimization based on the immune system and its application to the VLSI floor-plan design problem

Genetic algorithms (GAs) are search procedures for combinatorial optimization problems. Because GAs are based on multipoint search and use the crossover operator, they have an excellent global search ability. However, GAs are not effective for searching the solution space locally due to crossover-based search, and the diversity of the population sometimes decreases rapidly. In order to overcome these drawbacks, we propose a new algorithm called immunity-based GA (IGA), combining features of the immune system with GAs. IGA is expected to improve the local search ability of GAs and to maintain the diversity of the population. We apply IGA to the VLSI floor-plan design problem. Experimental results show that IGA performs better than GAs.     

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

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

现代启发式算法在电网规划中应用的比较

分析了以遗传算法、模拟退火算法和禁忌搜索算法为代表的现代启发式算法应用于电网规划这类非线性组合优化问题时存在的缺陷。在传统遗传算法的基础上,结合模拟退火算法概率性的突跳搜索机制和禁忌搜索算法能避免迂回的邻域搜索机制提出了一种混合算法,并以地理信息系统为平台来求解电网规划问题。实际应用结果表明,采用文中的混合算法可提高计算速度、收敛性能和计算效率。     

Quantum-Inspired Particle Swarm Optimization for Valve-Point Economic Load Dispatch

Economic load dispatch (ELD) is an important topic in the operation of power plants which can help to build up effective generating management plans. The ELD problem has nonsmooth cost function with equality and inequality constraints which make it difficult to be effectively solved. Different heuristic optimization methods have been proposed to solve this problem in previous study. In this paper, quantum-inspired particle swarm optimization (QPSO) is proposed, which has stronger search ability and quicker convergence speed, not only because of the introduction of quantum computing theory, but also due to two special implementations: self-adaptive probability selection and chaotic sequences mutation. The proposed approach is tested with five standard benchmark functions and three power system cases consisting of 3, 13, and 40 thermal units. Comparisons with similar approaches including the evolutionary programming (EP), genetic algorithm (GA), immune algorithm (IA), and other versions of particle swarm optimization (PSO) are given. The promising results illustrate the efficiency of the proposed method and show that it could be used as a reliable tool for solving ELD problems.      

Stochastic unit commitment problem considering risk constraints and its improved GA‐based solution method

This paper proposes a model of the stochastic unit commitment (SUC) problem, which takes account of the uncertainty of electric power demand and its resulting risk, and its solution method based on an improved genetic algorithm (IGA). The uncertainty of electric power demand is modeled using a set of scenarios which are introduced by scenario analysis. The variance, which measures the dispersion of generation costs of unit commitment schedule under each scenario around the expected generation cost, is used as a measure of risk. Based on the expected returns–variance of returns (E–V) rule in the theory of portfolio analysis, a utility function is devised by appending the variance of the expected generation cost into the original expected generation cost function, with consideration of the risk attitude of the generation companies and power exchange centers. The objective of this optimization problem is to minimize the utility function. The proposed IGA is used to solve this NP‐hard optimization problem. Based on numerical examples, the superiority of the IGA‐based solution method is verified through comparison with a traditional GA‐based solution method. Optimal schedules of SUC, as well as the expected costs and variances, are compared with/without risk constraints, and with different risk attitudes. Test results show that, in solving the SUC problem, it is necessary to consider the electric power demand uncertainty and its resulting risk, as well as the risk attitude of the decision maker. © 2012 Institute of Electrical Engineers of Japan. Published by John Wiley & Sons, Inc.     

求解机组组合问题的改进模式搜索算法

针对传统的模式搜索法（general pattern search filter algorithm,GPS—Filter）效率低的问题,提出一种改进的广义模式搜索一过滤器算法（improved general pattem search filter algorithm,IGPS—Filter）来求解机组组合（unit commitment problems,uo问题,该算法能在求解过程中直接处理离散变量,有效地求解0．1混合变量的规划问题。首先使IGPS—Filter算法融合UC问题的特点,预先确定大部分机组的开停状态,只对少量机组进行“1-邻域”搜索;其次,结合线搜索和域搜索对连续域变量进行求解,充分利用线搜索的快速性及域搜索处理病态问题的有效性,既提高运算效率又提高解的质量。最后,采用10-100机组24时段和IEEE-118节点54机24时段系统进行仿真,验证了方法的有效性。