共查询到20条相似文献,搜索用时 156 毫秒
1.
文章对电力营销计量改造过程中存在问题及解决对策进行研究.首先阐述了电力营销计量改造的重要性与必要性.然后分析了电力营销计量改造过程中存在的计量点位置缺乏合理性、电能计量表选用有待明确等问题.最后,为更好地实现电力营销计量改造,给出加强计量点改造、加强预付费计量系统应用等有效措施。 相似文献
2.
针对城农网改造对节能降损起到的作用及改造后存在的一些问题,提出了解决方法,并进行了探讨和研究. 相似文献
3.
4.
根据刘家峡3号水轮发电机定子存在的问题及隐患,阐述了改造前、后发电机的主要参数及设计结构.本次改造解决了机组定子原来存在的定子接地、绝缘击穿等问题,提高机组安全运行稳定性,为后续电站改造提供了参考. 相似文献
5.
针对中电国华北京热电分公司2×200MW机组胶球清洗装置在投运过程中出现的问题进行了分析和探讨,并对存在问题的1号机组甲侧收球网实施了改造.实践表明,改造可行有效,解决了收球率低的问题. 相似文献
6.
江苏国信扬州发电有限责任公司二期锅炉煤粉细度偏差较大,锅炉结渣严重、飞灰含碳偏高等情况影响机组安全经济运行,为此,对4号锅炉磨煤机进行旋转分离器改造.介绍了旋转分离器的改造方案、结构特点和改造后进行的验证试验,实际运行表明改造后可以有效解决锅炉存在的部分问题. 相似文献
7.
针对水口水电厂原集成型发电机-变压器保护装置存在的问题,采用微机化装置进行改造,本文对此次改造解决的几个技术问题进行分析。 相似文献
8.
9.
10.
11.
Short-term hydrothermal coordination (STHTC) is a very complicated optimization problem. It is a dynamic large-scale non-linear problem and requires solving unit commitment and economic power load dispatch problems. From this perspective, many successful and powerful optimization methods and algorithms have been employed to solve this problem. These optimization methodologies and techniques are widely diverse and have been the subject of ongoing enhancements over the years. This paper presents a survey of literature on the various optimization methods applied to solve the STHTC problem. A review and a methodology-based classification of most of the publications on the topic are presented. 相似文献
12.
13.
S. Sivasubramani K.S. Swarup 《International Journal of Electrical Power & Energy Systems》2011,33(3):745-752
This paper proposes a multi-objective harmony search (MOHS) algorithm for optimal power flow (OPF) problem. OPF problem is formulated as a non-linear constrained multi-objective optimization problem where different objectives and various constraints have been considered into the formulation. Fast elitist non-dominated sorting and crowding distance have been used to find and manage the Pareto optimal front. Finally, a fuzzy based mechanism has been used to select a compromise solution from the Pareto set. The proposed MOHS algorithm has been tested on IEEE 30 bus system with different objectives. Simulation results are also compared with fast non-dominated sorting genetic algorithm (NSGA-II) method. It is clear from the comparison that the proposed method is able to generate true and well distributed Pareto optimal solutions for OPF problem. 相似文献
14.
Mehdi Eghbal Naoto Yorino Yoshifumi Zoka E. E. El-Araby 《IEEJ Transactions on Electrical and Electronic Engineering》2009,4(5):625-632
This paper presents a new approach to treat reactive power (VAr) planning problem using multi-objective evolutionary algorithms (EAs). Specifically, strength Pareto EA (SPEA) and multi-objective particle swarm optimization (MOPSO) approaches have been developed and successfully applied. The overall problem is formulated as a nonlinear constrained multi-objective optimization problem. Minimizing the total incurred cost of the VAr planning problem and maximizing the amount of available transfer capability (ATC) are defined as the main objective functions. The aim is to find the optimal allocation of VAr devices in such a way that investment and operating costs are minimized and at the same time the amount of ATC is maximized. The proposed approaches have been successfully tested on IEEE 14 buses system. As a result a wide set of optimal solutions known as Pareto set is obtained and encouraging results show the superiority of the proposed approaches and confirm their potential to solve such a large-scale multi-objective optimization problem. Copyright © 2009 Institute of Electrical Engineers of Japan. Published by John Wiley & Sons, Inc. 相似文献
15.
16.
PKCS 复杂性的系统讨论,相继发表 PKCS 的破译问题浅介;PKCS 的约定问题浅介,本文就 PKCS 的复杂性度量中的计算方法问题作个浅介,以求对 PKCS 系统的复杂性有个较为全面的认识,文中在定义单向函数的基础上,讨论了计算方法中有关定理、命题和推论,以及从计算的目的出发进一步讨论了 PKCS 的殆遍复杂性. 相似文献
17.
《Electric Power Systems Research》2001,58(1):45-51
This paper presents a reliable approach for solving the transmission network expansion planning (TNEP) problem through a genetic algorithm (GA). GAs have demonstrated the ability to deal with non-convex, non-linear, integer-mixed optimization problems, such as the TNEP problem, better than a number of mathematical methodologies. The procedure presented consists on finding unfeasible solutions for the problem through the GA. These solutions are used for predicting the cost of the optimum solution using a ‘loss of load limit curve’, of the transmission system. Once this cost is estimated, the optimum solution can be found by performing a local search starting from the unfeasible solutions that have costs close to the estimated cost. This approach makes the GA more robust and reliable for solving the problem for different transmission systems. 相似文献
18.
Reactive power optimization problem has a substantial inspiration on secure and economic operation of power system. In this work we utilized Hybridized Tabu Search-Simulated Annealing (HTSSA) algorithm to solve reactive power problem. At first both the algorithm separately solved the reactive power problem, then hybridization has been done and the hybridized algorithm has been utilized to solve the reactive power problem. Detailed comparisons have been done between three modes. The validity of the proposed algorithm has been tested in standard IEEE 30 bus system. And the results show the proposed algorithm HTSSA efficiently solved the reactive power problem. Simulation results clearly show that real power loss considerably reduced and voltage profiles also within the limits. 相似文献
19.
20.
Abstract This paper considers the formulation and computational solution of the optimal power flow problem in hydro-thermal electric system. The problem is formulated using the cartesian coordinate form of the power flow equations. Here the hydro generation is energy limited. As a result, a dynamic optimization problem involving the daily scheduling of the system is encountered. This dynamic optimal power flow problem requires the solution of a large scale set of non-linear simultaneous equations. In this paper, Newton's method is used to solve the problem. Due to the large scale nature of the problem, we have exploited the sparsity of the Jacobian and developed three different versions of the algorithms and implementation of these versions have been detailed in this paper. In all cases, the algorithm has been successfully tested with six standard IEEE test systems varying in size from 5 bus to 118 bus. Computational results and the CPU times required by all of the methods are given. Results are compared with the results obtained by the earlier version using polar form for load flow constraints and it is shown that the sparse implementation using rectangular coordinates offers superior computational speed. 相似文献