• 대한전기학회논문지:전력기술부문A
• /
• 제51권12호
• /
• pp.603-610
• /
• 2002

In this paper, a new economic dispatch algorithm for unit commitment is proposed to improve both the accuracy of the final solution and the calculation speed of economic dispatch. By using the inverse incremental cost functions, economic dispatch can be transformed into a simple optimization problem associated with an n-th order polynomial equation. The proposed method remarkably reduces the computation time with adaptability to any higher order generation cost functions. The proposed method is tested with sample system, which shows that the proposed algorithm yields more accurate and economical generation scheduling results with high computation speed.

• Journal of Electrical Engineering and Technology
• /
• 제3권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.

• 대한전기학회논문지:전력기술부문A
• /
• 제55권3호
• /
• pp.123-127
• /
• 2006

The recent movement to deregulated and competitive electricity market requires new concepts in applying dispatch algorithms to system operation and planning. As power systems tend to be operated more closely to their ultimate ratings, the role of Contingency Constrained Optimal Power Flow is changed and the importance for security enhancement will be more increased in the new and competitive electricity market. This paper presents a contingency constrained optimal power flow (CCOPF) algorithm. The proposed algorithm maintains the nodal voltage levels and transmission line's power flow within the specified limits before and after a contingency. A case study demonstrates the proposed algorithm with the IEEE-14RTS under N-1 contingency criterion.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1995년도 하계학술대회 논문집 B
• /
• pp.574-577
• /
• 1995

The proposed method is described for scheduling their output of thermal power units so as to comply with total emission constraint, area emission constraint and the both of those constraints. Also, by using a trade-off curve, representing all dispatch alternatives and conflict between the emission and the fuel cost, the sensitivity analysis of the emission and the fuel cost is applied to this algorithm. By the way, this proposed method is analyzed how dispatch changes as a function of the total environmental cost, and as a function of the relative weighting of individual environmental insults, e.g, NOx and $SO_{2}$. By applying the proposed method to the system, the usefulness of this method is verified.

• Journal of Electrical Engineering and Technology
• /
• 제11권2호
• /
• pp.329-337
• /
• 2016

With the increasing deployment of distributed generators in the distribution system, a very large search space is required when dynamic programming (DP) is applied for the optimized dispatch schedules of voltage and reactive power controllers such as on-load tap changers, distributed generators, and shunt capacitors. This study proposes a new optimal voltage and reactive power scheduling method based on dynamic programming with a heuristic searching space reduction approach to reduce the computational burden. This algorithm is designed to determine optimum dispatch schedules based on power system day-ahead scheduling, with new control objectives that consider the reduction of active power losses and maintain the receiving power factor. In this work, to reduce the computational burden, an advanced voltage sensitivity index (AVSI) is adopted to reduce the number of load-flow calculations by estimating bus voltages. Moreover, the accumulated switching operation number up to the current stage is applied prior to the load-flow calculation module. The computational burden can be greatly reduced by using dynamic programming. Case studies were conducted using the IEEE 30-bus test systems and the simulation results indicate that the proposed method is more effective in terms of saving electric charges and improving the voltage profile than loss minimization.

• 에너지공학
• /
• 제6권2호
• /
• pp.129-136
• /
• 1997

본 연구는 전력계통의 화력발전소로부터 배출되는 NOx및 SO$_2$같은 대기환경오염물질을 고려한 새로운 경제부하배분법을 제시한다. 제안된 방법은 총배출량 제약, 지역별 배출랑 제약 그리고 이들의 동시제약을 만족하면서 화력발전기의 출력을 계획하는 것에 대해 설명되어진다. 또한, 모든 부하배분의 대체안이며 배출량과 총연료비 사이의 상호상충관계를 나타내는 Trade-Off곡선에 의해 배출량과 총연료비 사이의 감도해석이 이 알고리즘에 적용된다. 한편, 이 제안된 방법은 개별적 환경피해(NOx, SO$_2$등)의 상대적 가중치와 총환경비용의 함수로써 경제부하배분이 이것에 의해 어떻게 변화되는지를 해석한다. 본 연구에서 제안된 방법을 시험계통에 적용하여 그 유용성을 검증하였다.

• Journal of information and communication convergence engineering
• /
• 제1권2호
• /
• pp.93-97
• /
• 2003

This paper proposes a new generation scheduling algorithm which can consider total quantity of contamination and energy limits based on Lagrangian Relaxation. First, we formulate a Lagrangian function which consider quantity of contamination including substitution of fuel, and quantity of fuel. Second, we developed Multi-state S.U.D.P. which can treat multiple fuels. Third, we propose an effective generation scheduling algorithm including Multi-state S.U.D.P.. As a results, unit commitment and generating power can be obtained to meet the environmental and fuel constraints with fuel substitution. By applying it to the test system, effectiveness of the method is verified.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2005년도 제36회 하계학술대회 논문집 A
• /
• pp.858-860
• /
• 2005

This paper presents an Optimal Power Flow (OPF) algorithm using Interior Point Method (IPM) to swiftly and precisely perform the five minute dispatch. This newly suggested methodology is based on Affine Scailing Interior Point Method (AS IPM), which is favorable for large-scale problems involving many constraints. It is also eligible for OPF problems in order to improve the calculation speed and the preciseness of its resultant solutions. Lastly, this paper provides a relevant case study to confirm the efficiency of the proposed methodology.

• 대한전기학회논문지:전력기술부문A
• /
• 제55권3호
• /
• pp.133-138
• /
• 2006

This paper presents an Optimal Power Flow (OPF) algorithm using Interior Point Method (IPM) to swiftly and precisely perform the five minute dispatch. This newly suggested methodology is based on Affine Scaling Interior Point Method which is favorable for large-scale problems involving many constraints. It is also eligible for OPF problems in order to improve the calculation speed and the preciseness of its resultant solutions. Big-M Method is also used to improve the solution stability. Finally, this paper provides relevant case studies to confirm the efficiency of the proposed methodology.

• 전기학회논문지
• /
• 제66권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.