• Title/Summary/Keyword: Dynamic economic dispatch

Search Result 26, Processing Time 0.023 seconds

An efficient dynamic load dispatch algorithm with Lagrange multipliers adjustment (라그랑지승수 수정에 의한 효율적인 동적부하배분 알고리즘)

  • 송길영;오광희;김용하
    • The Transactions of the Korean Institute of Electrical Engineers
    • /
    • v.45 no.4
    • /
    • pp.467-473
    • /
    • 1996
  • This Paper presents a new algorithm to solve Dynamic Economic Dispatch problem. Proposed algorithm is composed of two computational modules; one is dispatch, the other adjusting module. In the dispatch module based on the traditional Static Economic Dispatch method, the power dispatch of each unit is calculated. And in case the results of dispatch module violate ramp rate constraints, Lagrange multipliers are adjusted in the adjusting module. Tests and computer results on test systems are given to show the efficiency of the proposed algorithm. (author). 11 refs., 6 figs., 4 tabs.

  • 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.

Dynamic Economic Dispatch for Microgrid Based on the Chance-Constrained Programming

  • Huang, Daizheng;Xie, Lingling;Wu, Zhihui
    • Journal of Electrical Engineering and Technology
    • /
    • v.12 no.3
    • /
    • pp.1064-1072
    • /
    • 2017
  • The power of controlled generators in microgrids randomly fluctuate because of the stochastic volatility of the outputs of photovoltaic systems and wind turbines as well as the load demands. To address and dispatch these stochastic factors for daily operations, a dynamic economic dispatch model with the goal of minimizing the generation cost is established via chance-constrained programming. A Monte Carlo simulation combined with particle swarm optimization algorithm is employed to optimize the model. The simulation results show that both the objective function and constraint condition have been tightened and that the operation costs have increased. A higher stability of the system corresponds to the higher operation costs of controlled generators. These operation costs also increase along with the confidence levels for the objective function and constraints.

Application of Differential Evolution to Dynamic Economic Dispatch Problem with Transmission Losses under Various Bidding Strategies in Electricity Markets

  • Rampriya, B.;Mahadevan, K.;Kannan, S.
    • Journal of Electrical Engineering and Technology
    • /
    • v.7 no.5
    • /
    • pp.681-688
    • /
    • 2012
  • This paper presents the application of Differential Evolution (DE) algorithm to obtain a solution for Bid Based Dynamic Economic Dispatch (BBDED) problem including the transmission losses and to maximize the social profit in a deregulated power system. The IEEE-30 bus test system with six generators, two customers and two trading periods are considered under various bidding strategies in a day-ahead electricity market. By matching the bids received from supplying and distributing entities, the Independent System Operator (ISO) maximize the social profit, (with the choices available). The simulation results of DE are compared with the results of Particle swarm optimization (PSO). The results demonstrate the potential of DE algorithm and show its effectiveness to solve BBDED.

Dynamic Economic Dispatch and Control of a Stand-alone Microgrid in DongAo Island

  • Ma, Yiwei;Yang, Ping;Guo, Hongxia;Wang, Yuewu
    • Journal of Electrical Engineering and Technology
    • /
    • v.10 no.4
    • /
    • pp.1432-1440
    • /
    • 2015
  • A dynamic economic dispatch and control method is proposed to minimize the overall generating cost for a stand-alone microgrid in DongAo Island, which is integrated with wind turbine generator, solar PV, diesel generator, battery storage, the seawater desalination system and the conventional loads. A new dispatching strategy is presented based on the ranking of component generation costs and two different control modes, in which diesel generator and battery storage alternate to act as the master power source to follow system power fluctuation. The optimal models and GA-based optimization process are given to minimize the overall system generating cost subject to the corresponding constraints and the proposed dispatch strategy. The effectiveness of the proposed method is verified in the stand-alone microgrid in DongAo Island, and the results provide a feasible theoretical and technical basis for optimal energy management and operation control of stand-alone microgrid.

A Swap Optimization for Dynamic Economic Dispatch Problem with Non-smooth Function (비평활 발전비용함수를 가진 동적 경제급전문제의 교환 최적화)

  • Lee, Sang-Un
    • Journal of the Korea Society of Computer and Information
    • /
    • v.17 no.11
    • /
    • pp.189-196
    • /
    • 2012
  • This paper proposes Swap algorithm for solving Dynamic Economic Dispatch (DED) problem. The proposed algorithm initially balances total load demand $P_d$ with total generation ${\Sigma}P_i$ by deactivating a generator with the highest unit generation cost $C_i^{max}/P_i^{max}$. It then swaps generation level $P_i=P_i{\pm}{\Delta}$, (${\Delta}$=1.0, 0.1, 0.01, 0.001) for $P_i=P_i-{\Delta}$, $P_j=P_j+{\Delta}$ provided that $_{max}[F(P_i)-F(P_i-{\Delta})]$ > $_{min}[F(P_j+{\Delta})-F(P_j)]$, $i{\neq}j$. This new algorithm is applied and tested to the experimental data of Dynamic Economic Dispatch problem, demonstrating a considerable reduction in the prevalent heuristic algorithm's optimal generation cost and in the maximization of economic profit.

Opposition Based Differential Evolution Algorithm for Dynamic Economic Emission Load Dispatch (EELD) with Emission Constraints and Valve Point Effects

  • Thenmalar, K.;Ramesh, S.;Thiruvenkadam, S.
    • Journal of Electrical Engineering and Technology
    • /
    • v.10 no.4
    • /
    • pp.1508-1517
    • /
    • 2015
  • Optimal Power dispatch is the short-term decision of the optimal output of a number of power generation facilities, to meet the system demand, with the objective of Power dispatching at the lowest possible cost, subject to transmission lines power loss and operational constraints. The operational constraint includes power balance constraint, generator limit constraint, and emission dispatch constraint and valve point effects. In this paper, Opposition based Differential Evolution Algorithm (ODEA) has been proposed to handle the objective function and the operational constraints simultaneously. Furthermore, the valve point loading effects and transmission lines power loss are also considered for the efficient and effective Power dispatch. The ODEA has unique features such as self tuning of its control parameters, self acceleration and migration for searching. As a result, it requires very minimum executions compared with other searching strategies. The effectiveness of the algorithm has been validated through four standard test cases and compared with previous studies. The proposed method out performs the previous methods.

Economic Profit Analysis for Centralized Operation of Economic Load Dispatch Problem (경제급전문제의 통합운영에 관한 경제적 이득 분석)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.16 no.2
    • /
    • pp.181-188
    • /
    • 2016
  • This paper demonstrates that centralized economic load dispatch optimization is much more economical than independent optimization carried out by individual power generating companies. The algorithm applied here optimizes by balancing the generation power at the valve-point, then readjusting generation power by comparing incremental operating cost incurred by marginal increase in the generation power and decremental operating cost likewise incurred by marginal decrease in the generation power. Upon comparing 3 individual optimization cases of 10, 13, and 40 generators respectively with centralized optimization of 63 generators, centralized operation for economic load dispatch optimization has proven to maximize economic benefits by markedly reducing operation costs of individual optimization.

The Dynamic Allocated Bees Algorithms for Multi-objective Problem

  • Lee, Ji-Young;Oh, Jin-Seok
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.33 no.3
    • /
    • pp.403-410
    • /
    • 2009
  • The aim of this research is to develop the Bees Algorithm named 'the dynamic allocated Bees Algorithm' for multi-objective problem, especially in order to be suit for Pareto optimality. In addition two new neighbourhood search methods have been developed to produce enhanced solutions for a multi-objective problem named 'random selection neighbourhood search' and 'weighted sum neighbourhood search' and they were compared with the basic neighbourhood search in the dynamic allocated Bees Algorithm. They were successfully applied to an Environmental/Economic (electric power) dispatch (EED) problem and simulation results presented for the standard IEEE 30-bus system and they were compared to those obtained using other approaches. The comparison shows the superiority of the proposed dynamic allocated Bees Algorithms and confirms its suitability for solving the multi-objective EED problem.

SPINNING RESERVE CONSTRAINED DYNAMIC ECONOMIC DISPATCH (순동예비력제약을 고려한 동적 경제부하배분)

  • SONG, K.Y.;OH, K.H.;KWON, Y.G.;CHA, J.M.;KIM, Y.H.
    • Proceedings of the KIEE Conference
    • /
    • 1995.07b
    • /
    • pp.524-527
    • /
    • 1995
  • This paper deals with the optimal dynamic dispatch problem owing to spinning-reserve and power-rate limits. Two computational modules are used in the solution of the problems. The first is an efficient dispatch module for the consideration of reasonable spinning-reserve requirements. The latter os the Lagrange multipliers adjusting module, which is satisfying the Kuhn-Tucker conditions for power-rate constraints. The proposed algorithm obtains very fast solution speed and maintains good accuracy from test examples.

  • PDF