• Title, Summary, Keyword: Ramp rate limits

Search Result 8, Processing Time 0.038 seconds

Multi-Stage Generation Allocation Game Considering Ramp-rate Constraints (경쟁적 전력시장에서 발전기 증감발률을 고려한 다중시간 발전량 배분 게임)

  • Park, Yong-Gi;Park, Jong-Bae;Roh, Jae-Hyung;Kim, Hyeong-Jung;Shin, Jung-Rin
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.60 no.3
    • /
    • pp.509-516
    • /
    • 2011
  • This paper studies a novel method to find the profit-maximizing Nash Equilibriums in allocating generation quantities with consideration of ramp-rates under competitive market environment. Each GenCo in a market participates in a game to maximize its profit through competitions and play a game with bidding strategies. In order to find the Nash equilibriums it is necessary to search the feasible combinations of GenCos' strategies which satisfy every participant's profit and no one wants various constraints. During the procedure to find Nash equilibriums, the payoff matrix can be simplified as eliminating the dominated strategies. in each time interval. Because of the ramp-rate, generator's physically or technically limits to increase or decrease outputs in its range, it can restrict the number of bidding strategies of each generator at the next stage. So in this paper, we found the Nash Equilibriums for multi-stage generation allocation game considering the ramp-rate limits of generators. In the case studies, we analyzed the generation allocation game for a 12-hour multi-stage and compared it with the results of dynamic economic dispatch. Both of the two cases were considered generator's ramp-rate effects.

Economic Dispatch Using Hybrid Particle Swarm Optimization with Prohibited Operating Zones and Ramp Rate Limit Constraints

  • Prabakaran, S.;Senthilkuma, V.;Baskar, G.
    • Journal of Electrical Engineering and Technology
    • /
    • v.10 no.4
    • /
    • pp.1441-1452
    • /
    • 2015
  • This paper proposes a new Hybrid Particle Swarm Optimization (HPSO) method that integrates the Evolutionary Programming (EP) and Particle Swarm Optimization (PSO) techniques. The proposed method is applied to solve Economic Dispatch(ED) problems considering prohibited operating zones, ramp rate limits, capacity limits and power balance constraints. In the proposed HPSO method, the best features of both EP and PSO are exploited, and it is capable of finding the most optimal solution for the non-linear optimization problems. For validating the proposed method, it has been tested on the standard three, six, fifteen and twenty unit test systems. The numerical results show that the proposed HPSO method is well suitable for solving non-linear economic dispatch problems, and it outperforms the EP, PSO and other modern metaheuristic optimization methods reported in the recent literatures.

Modified Particle Swarm Optimization with Time Varying Acceleration Coefficients for Economic Load Dispatch with Generator Constraints

  • Abdullah, M.N.;Bakar, A.H.A;Rahim, N.A.;Mokhlis, H.;Illias, H.A.;Jamian, J.J.
    • Journal of Electrical Engineering and Technology
    • /
    • v.9 no.1
    • /
    • pp.15-26
    • /
    • 2014
  • This paper proposes a Modified Particle Swarm Optimization with Time Varying Acceleration Coefficients (MPSO-TVAC) for solving economic load dispatch (ELD) problem. Due to prohibited operating zones (POZ) and ramp rate limits of the practical generators, the ELD problems become nonlinear and nonconvex optimization problem. Furthermore, the ELD problem may be more complicated if transmission losses are considered. Particle swarm optimization (PSO) is one of the famous heuristic methods for solving nonconvex problems. However, this method may suffer to trap at local minima especially for multimodal problem. To improve the solution quality and robustness of PSO algorithm, a new best neighbour particle called 'rbest' is proposed. The rbest provides extra information for each particle that is randomly selected from other best particles in order to diversify the movement of particle and avoid premature convergence. The effectiveness of MPSO-TVAC algorithm is tested on different power systems with POZ, ramp-rate limits and transmission loss constraints. To validate the performances of the proposed algorithm, comparative studies have been carried out in terms of convergence characteristic, solution quality, computation time and robustness. Simulation results found that the proposed MPSO-TVAC algorithm has good solution quality and more robust than other methods reported in previous work.

The Behaviors of the Material Parameters Affecting PCI Induced-Fuel Failure (핵연료봉의 PCI파손에 영향을 미치는 인자들의 거동분석)

  • Sim, Ki-Seob;Woan Hwang;Sohn, Dong-Seong;Suk, Ho-Chun
    • Nuclear Engineering and Technology
    • /
    • v.20 no.4
    • /
    • pp.241-245
    • /
    • 1988
  • It is very important to investigate the behaviors of the material parameters governing PCI fuel failure during power ramp because PCI fuel failure is considered to be related to the operations limits of power reactors. In this study, the behavior characteristics of the material parameters such as hoop stress, hoop strain, ridge height, creep strain rate and strain energy in cladding were studied as a function of the operating parameters such as power shock and ramp rate. The FEMAXI-IV fuel rod performance analysis code was used for this study.

  • PDF

An Improved Dynamic Programming Approach to Economic Power Dispatch with Generator Constraints and Transmission Losses

  • Balamurugan, R.;Subramanian, S.
    • Journal of Electrical Engineering and Technology
    • /
    • v.3 no.3
    • /
    • pp.320-330
    • /
    • 2008
  • This paper presents an improved dynamic programming (IDP) approach to solve the economic power dispatch problem including transmission losses in power systems. A detailed mathematical derivation of recursive dynamic programming approach for the economic power dispatch problem with transmission losses is presented. The transmission losses are augmented with the objective function using price factor. The generalized expression for optimal scheduling of thermal generating units derived in this article can be implemented for the solution of the economic power dispatch problem of a large-scale system. Six-unit, fifteen-unit, and forty-unit sample systems with non-linear characteristics of the generator, such as ramp-rate limits and prohibited operating zones are considered to illustrate the effectiveness of the proposed method. The proposed method results have been compared with the results of genetic algorithm and particle swarm optimization methods reported in the literature. Test results show that the proposed IDP approach can obtain a higher quality solution with better performance.

Investigation of Oswatitsch Scheme for Maximum Total Pressure Recovery of Hypersonic Wedge-type Intakes (극초음속 쐐기형 흡입구의 최대 전압력 회복률을 위한 오스와치 기법 분석)

  • Heo, Yub;Moon, Kyoo-Hwan;Sun, Hong-Gye
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.45 no.12
    • /
    • pp.1031-1038
    • /
    • 2017
  • In order to improve the performance of the air breathing engines, it is important to maximize the total pressure recovery through air intake. In this study, we investigated whether the Oswatitsch method, which guarantees the maximum pressure recovery for supersonic intake, is effective at hypersonic speed by compressing the intake air with the same intensity at each ramp. The non-linearity of the shock wave normal Mach number at each ramp stage was analyzed by comparing the compression ramp angle and the number of ramp to the inflow Mach number in terms of compressible thermodynamics and the operation limits of the inlet. Based on this analysis, the Oswaitisch technique yields valid conditions not only in supersonic but also hypersonic flight regime.

Hybrid Artificial Immune System Approach for Profit Based Unit Commitment Problem

  • Lakshmi, K.;Vasantharathna, S.
    • Journal of Electrical Engineering and Technology
    • /
    • v.8 no.5
    • /
    • pp.959-968
    • /
    • 2013
  • This paper presents a new approach with artificial immune system algorithm to solve the profit based unit commitment problem. The objective of this work is to find the optimal generation scheduling and to maximize the profit of generation companies (Gencos) when subjected to various constraints such as power balance, spinning reserve, minimum up/down time and ramp rate limits. The proposed hybrid method is developed through adaptive search which is inspired from artificial immune system and genetic algorithm to carry out profit maximization of generation companies. The effectiveness of the proposed approach has been tested for different Gencos consists of 3, 10 and 36 generating units and the results are compared with the existing methods.

Secant Method for Economic Dispatch with Generator Constraints and Transmission Losses

  • Chandram, K.;Subrahmanyam, N.;Sydulu, M.
    • Journal of Electrical Engineering and Technology
    • /
    • v.3 no.1
    • /
    • pp.52-59
    • /
    • 2008
  • This paper describes the secant method for solving the economic dispatch (ED) problem with generator constraints and transmission losses. The ED problem is an important optimization problem in the economic operation of a power system. The proposed algorithm involves selection of minimum and maximum incremental costs (lambda values) and then the evaluation of optimal lambda at required power demand is done by secant method. The proposed algorithm has been tested on a power system having 6, 15, and 40 generating units. Studies have been made on the proposed method to solve the ED problem by taking 120 and 200 units with generator constraints. Simulation results of the proposed approach were compared in terms of solution quality, convergence characteristics, and computation efficiency with conventional methods such as lambda iterative method, heuristic methods such as genetic algorithm, and meta-heuristic methods like particle swarm optimization. It is observed from different case studies that the proposed method provides qualitative solutions with less computational time compared to various methods available in the literature.