• Title/Summary/Keyword: Economic dispatch problem

Search Result 94, Processing Time 0.024 seconds

Operational Cost Minimization Considering Line Flow Limits of MIcroGrid Connection (마이크로 그리드간 선로제약을 고려한 운영비용 최소화)

  • Rhee, Sang-Bong;Kim, Kyu-Ho;Kim, Soo-Nam;Lee, Sang-Keun;Kim, Chul-Hwan
    • Proceedings of the KIEE Conference
    • /
    • 2009.07a
    • /
    • pp.151_152
    • /
    • 2009
  • The capacity constraints of tie-lines in production cost analysis are very important issues in the operation and planning of MicroGrid power systems. This paper presents the Harmony Search(HS) algorithm to solve the Economic Dispatch (ED) problem with tie-line capacity limits in MicroGrid system. The applied HS algorithm has achieved efficient and accurate solutions for three-area MicroGrid systems with renewable power units.

  • PDF

Application of Quadratic Interior Point Method to Economic Dispatch (Quadratic Interior Point 법을 적용한 전력계통의 경제급전)

  • Lee, Hong-Joo;Chung, Jai-Gil;Lee, In-Yong;Kim, Kyung-Shin;Park, Kyu-Hong
    • Proceedings of the KIEE Conference
    • /
    • 2000.07a
    • /
    • pp.344-346
    • /
    • 2000
  • The Paper describes the implementation of a quadratic interior point method for optimal power flow involves the determination of the optimal of a given objectives function subject to given constraints. The scheme developed solves the quadratic or linear optimization problem subject to linear constraints. The algorithm has been evaluated on a 14-bus system, and its accuracy and speed are demonstrated.

  • PDF

Comparison of Evolutionary Computation for Power Flow Control in Power Systems (전력계통의 전력조류제어를 위한 진화연산의 비교)

  • Lee, Sang-Keun
    • The Transactions of the Korean Institute of Electrical Engineers P
    • /
    • v.54 no.2
    • /
    • pp.61-66
    • /
    • 2005
  • This paper presents an unified method which solves real and reactive power dispatch problems for the economic operation of power systems using evolutionary computation such as genetic algorithms(GA), evolutionary programming(EP), and evolution strategy(ES). Many conventional methods to this problem have been proposed in the past, but most of these approaches have the common defect of being caught to a local minimum solution. The proposed methods, applied to the IEEE 30-bus system, were run for 10 other exogenous parameters and composed of P-optimization module and Q-optimization module. Each simulation result, by which evolutionary computations are compared and analyzed, shows the possibility of applications of evolutionary computation to large scale power systems.

Economic Generation Allocation with Power Equation Constraints (모선 전력방정식을 제약조건으로 하는 경제적 발전력 연산방법)

  • Eom, Jae-Seon;Kim, Geon-Jung;Lee, Sang-Jung;Choe, Jang-Heum
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.51 no.8
    • /
    • pp.398-402
    • /
    • 2002
  • The ELD computation has been based upon the so-called B-coefficient which uses a quadratic approximation of system loss as a function of generation output. Direct derivation of system loss sensitivity based on the Jacobian-based method was developed in early 1970s', which could eliminate the dependence upon the approximate loss formula. However, both the B-coefficient and the Jacobian-based method require a complicated Procedure for calculating the system loss sensitivity included in the constraints of the optimization problem. In this paper, an ELD formulation in which only the bus power equations are defined as the constraints has been introduced. Derivation of the partial derivatives of the system loss with respect to the generator output and calculation of the penalty factors for individual generators are not required anymore in proposed method. A comprehensive solution procedure including calculation of the Jacobians and Hessians of the formulation has been presented in detail. Proposed ELD formulation has been tested on a sample system and the simulation indicated a satisfactory result.

Stochastic Analysis of the Uncertain Hourly Load Demand Applying to Unit Commitment Problem (발전기 기동정지 계획에 적용되는 불확실한 부하곡선에 대한 통계적 분석)

  • Jung, Choon-Sik;Park, Jeong-Do;Kook, Hyun-Jong;Moon, Young-Hyun
    • Proceedings of the KIEE Conference
    • /
    • 2000.07a
    • /
    • pp.337-340
    • /
    • 2000
  • In this paper, the effects of the uncertain hourly load demand are stochastically analyzed especially by the consideration of the average over generation of the Unit Commitment(UC) results. In order to minimize the effects of the actual load profile change, a new UC algorithm is proposed. The proposed algorithm calculates the UC results with the lower load level than the one generated by the conventional load forecast. In case of the worse load forecast, the deviation of the conventional UC solution can be overcome with the lower load level and the more hourly reserve requirements. The proposed method is tested with sample systems, which shows that the proposed method can be used as the basic guideline for selecting the potimal load forecast applying to UC problem.

  • PDF

A Study on the Real Power Optimization Using Interior-Point Method (IP법을 이용한 유효전력제어에 관한 연구)

  • Jung, Soon-Young;Jung, Jai-Kil;Lee, In-Yong;Jung, In-Hak;Hyun, Seung-Bum
    • Proceedings of the KIEE Conference
    • /
    • 2000.07a
    • /
    • pp.99-101
    • /
    • 2000
  • Different optimization algorithms have been proposed to solve real and reactive power optimization problems. Most of all, linear programming techniques that employed a simplex method have been extensively used. But, the growth in the size of power systems demands faster and more reliable optimization techniques. An Interior Point(IP) mehod is based on an interior point approach to aim the solution trajectory toward the optimal point and is converged to the solution faster than the simplex method. This paper deals with the use of Successive Linear Programming(SLP) for the solution of the Security Constrained Economic Dispatch(SCED) problem. This problem is solved using the IP method. A comparison with simplex method shows that the interior point technique is reliable and faster than the simplex algorithm.

  • PDF

Optimal Long-term Transmission Planning Algorithm using Non-linear Branch-and-bound Method (비선형 분산안전법을 이용한 최적장기송전계률 알고리)

  • 박영문;신중린
    • The Transactions of the Korean Institute of Electrical Engineers
    • /
    • v.37 no.5
    • /
    • pp.272-281
    • /
    • 1988
  • The problem of optimal transmission system planning is to find the most economical locations and time of transmission line construction under the various constraints such as available rights-of-way, finances, the technical characteristics of power system, and the reliability criterion of power supply, and so on. In this paper the constraint of right-of-way is represented as a finite set of available rights-of-way. And the constructed for a unit period. The electrical constraints are represented in terms of line overload and steady state stability margin. And the reliability criterion is dealt with the suppression of failure cost and with single-contingency analysis. In general, the transmission planning problem requires integer solutions and its objective function is nonlinear. In this paper the objective function is defined as a sum of the present values of construction cost and the minimum operating cost of power system. The latter is represented as a sum of generation cost and failure cost considering the change of yearly load, economic dispatch, and the line contingency. For the calculation of operating cost linear programming is adopted on the base of DC load flow calculation, and for the optimization of main objective function nonlinear Branch-and-Bound algorithm is used. Finally, for improving the efficiency of B & B algorithm a new sensitivity analysis algorithm is proposed.

Optimization of Long-term Generator Maintenance Scheduling considering Network Congestion and Equivalent Operating Hours (송전제약과 등가운전시간을 고려한 장기 예방정비계획 최적화에 관한 연구)

  • Shin, Hansol;Kim, Hyoungtae;Lee, Sungwoo;Kim, Wook
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.66 no.2
    • /
    • pp.305-314
    • /
    • 2017
  • Most of the existing researches on systemwide optimization of generator maintenance scheduling do not consider the equivalent operating hours(EOHs) mainly due to the difficulties of calculating the EOHs of the CCGTs in the large scale system. In order to estimate the EOHs not only the operating hours but also the number of start-up/shutdown during the planning period should be estimated, which requires the mathematical model to incorporate the economic dispatch model and unit commitment model. The model is inherently modelled as a large scale mixed-integer nonlinear programming problem and the computation time increases exponentially and intractable as the system size grows. To make the problem tractable, this paper proposes an EOH calculation based on demand grouping by K-means clustering algorithm. Network congestion is also considered in order to improve the accuracy of EOH calculation. This proposed method is applied to the actual Korean electricity market and compared to other existing methods.

Evaluation of Generator Reactive Power Pricing Through Optimal Voltage Control under Deregulation

  • Jung Seung-Wan;Song Sung-Hwan;Yoon Yong Tae;Moon Seung-Il
    • KIEE International Transactions on Power Engineering
    • /
    • v.5A no.3
    • /
    • pp.228-234
    • /
    • 2005
  • This paper presents the evaluation of reactive power pricing through the control of generator voltages under the assumption that the reactive power market has been transformed into the real power market. By applying the concept of economic dispatch, which minimizes the total cost of real power generation to reactive power generation, the algorithm for implementing reactive power pricing is proposed to determine the optimum voltage profiles of generators. It consists of reactive power voltage equation, the objective function that minimizes the total cost of reactive power generation, and linear analysis of inequality constraints in relation to the load voltages. From this algorithm, the total cost of the reactive power generation can be yielded to the minimum value within network constraints as the range of load voltages. This may provide the fair and reasonable price information for reactive power generation in the deregulated electricity market. The proposed algorithm has been tested on the IEEE 14-bus system using MATLAB.

The Study for the Optimal Location of Fire Stations in Seoul (서울시의 소방서 최적입지에 관한 연구)

  • Kim, Geun-Young;Kang, Sung-Il
    • Journal of the Korean Society of Hazard Mitigation
    • /
    • v.2 no.1 s.4
    • /
    • pp.153-159
    • /
    • 2002
  • Disasters are the phenomena that we have to prevent the occurrence in order to keep the safety to human lives and properties, and if occurred, we have to minimize the economic, social, and mental costs of the occurred disasters or incidents. This research analyzes the optimal location of fire stations in terms of served population maximization in Seoul. This research introduces "the maximal covering location problem(MCLP)," one of the optimization techniques, as the primary research method. This research also applies a geographic information system into spatial distribution analyses of existing fire stations and observed fire incidents. Results from the analyses show that the existing location of fire stations and branches need to be improved. The dispatch location of fire engines should be reconsidered for rapid services of fire fighting.