• 제목/요약/키워드: Unit Commitment Problem

검색결과 52건 처리시간 0.026초

전력저장장치를 고려한 일간 최적 기동정지계획 수립연구 (Daily Unit Commitment Scheduling of Power System with Energy Storage System)

  • 송하나;장세환;김형중;노재형;박종배
    • 전기학회논문지
    • /
    • 제60권4호
    • /
    • pp.717-725
    • /
    • 2011
  • In the power system with an electric storage system that can increase utilization rate of the source of such new renewable energy, this paper introduces the approach on the daily unit commitment scheduling that determines simultaneously optimum operational condition and output of thermal generators and electric storage device. The unit commitment is one of the most important issues in economic operation and security of short-term operational plan of the power system. It is to determine on/off status of generator to minimize operational cost during the given period. The committed generator should satisfy various operational limitation such as estimated demand by system, spinning reserve condition within minimum operational cost. In order to determine on/off or charge/discharge/idle condition and output level of units and electric storage system, the MILP(Mixed Integer Linear Programming) is suggested. The proposed approach is the mixed method between LP(Linear Programming) and IP(integer programming) which seeks the value of real number and integer that maximize or minimize function objective within given condition. The daily unit commitment problem with the electric storage system is applied to MILP algorithm through linearization and formulation process. The proposed approach is applied to the test system.

객체 지향형 동적 계획법을 이용한 화력 발전기의 기동정지계획 (Object-Oriented Dynamic Programming: An Application to Unit Commitment)

  • 최상열;김헌준;정호성;신명철;서희석;박재세;권명현
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1998년도 하계학술대회 논문집 C
    • /
    • pp.1140-1142
    • /
    • 1998
  • This paper presents object-oriented dynamic programing formulation of the unit commitment problem. This approach features the classification of generating units into related groups so called class. All object which share the same set of attributes and methods are grouped together in classes and designed inheritance hierarchy to minimize the number of unit combination which must be tested without precluding the optimal path. So this programming techniques will maximize the efficiency of unit commitment.

  • PDF

Multi-Area Unit Commitment with Bilateral Contract Approach in Deregulated Electricity Market

  • Selvi, S.Chitra;Devi, R.P.Kumudini;Rajan, C.Christober Asir
    • Journal of Electrical Engineering and Technology
    • /
    • 제4권3호
    • /
    • pp.346-352
    • /
    • 2009
  • The eventual goal of this paper is to help the generating companies and load-serving entities to choose appropriate relative levels of interconnected system versus bilateral trades while considering risk, and economic performance. In competitive power markets, electricity prices are determined by balance between demand and supply in electric power exchanges or bilateral contracts. The problem formulation is bilateral contract incorporated into Multi-area unit commitment with import/export and tie-line constraints. This proposed method considers maximizing own profit or minimize the operating cost among the generating companies in multi-area system. The feasibility of the proposed algorithm has been demonstrated using IEEE system with four areas and experimental results shows that proposed method is reliable, fast and computationally efficient

병렬 타부 탐색법을 이용한 대규모의 발전기 기동정지계획 (Large Scale Unit Commitment Using Parallel Tabu Search)

  • 김형수;문경준;조덕환;황기현;박준호
    • 대한전기학회논문지:전력기술부문A
    • /
    • 제50권11호
    • /
    • pp.528-536
    • /
    • 2001
  • This paper proposes a method of solving a unit commitment problem using parallel tabu search(PTS) approach. Tabu search is a heuristic optimization method that has the tabu list to control the search process. To improve the searching ability of a global solution, we used a method of exchanging solutions among connected processors as a diversification strategy, and to reduce the computation time, a new evaluating method was proposed which evaluates only a changed par. To show the usefulness of the proposed method, we simulated for 10 units system and 110 units system. Numerical results show improvements in the generation costs and the computation time compared with other conventional methods.

  • PDF

Energy Payback을 고려한 직접부하제어의 경제성 분석 (A Study on Economic Analyse for Direct Load Control considering Energy Payback)

  • 김형중;김인수;김용하;이범;최상규;문정호;이형노
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2001년도 하계학술대회 논문집 A
    • /
    • pp.311-314
    • /
    • 2001
  • This paper describes the optimizing method of direct load control (DLC) considering unit commitment which is based on dynamic programming. To solve DLC problem considering unit commitment, 3-dimensional dynamic programming as a new unit commitment method is developed. And, energy payback is concerned for DLC. As a result, optimization of operating schedule with DLC is possible. This method is applied to the test system, and usefulness of the method is verified.

  • PDF

Tabu 탐색법을 이용한 화력 발전기의 기동정지계획 (Thermal Unit Commitment using Tabu Search)

  • 천희주;김형수;황기현;문경준;박준호
    • 대한전기학회논문지:전력기술부문A
    • /
    • 제49권2호
    • /
    • pp.70-77
    • /
    • 2000
  • This paper proposes a method of solving a unit commitment problem using tabu search (TS) which is heuristic algorithm. Ts is a local search method that starts from any initial solution and attempts to determine a better solution using memory structures. In this paper, to reduce the computation time for finding the optimal solution, changing tabu list size as intensification strategy and path relinking method as diversification strategy are proposed. To show the usefulness of the proposed method, we simulated for 10 units system and 110 units system. Numerical results show improvements in the generation costs and the computation time compared with priority list, genetic algorithm(GA), and hybrid GA.

  • PDF

다양한 발전원 계통에서의 발전기 협조에 관한 연구 (A Study on the Unit Commitment for Various Generation Type System)

  • 안재승;김성학;황갑주
    • 대한전기학회논문지
    • /
    • 제43권5호
    • /
    • pp.739-746
    • /
    • 1994
  • This paper present an efficient methodology to solve the unit commitment problem for large scaled power system which involves various type of generation. We introduce the global optimization approach to coordinate the thermal type, hydro type and pumped storage type generation. To overcome the shortcomings in dynamic programming for thermal unit commitment, an improved heurisitic method using lambda(λ) was proposed, Hydro and pumped type allocation was Solved by analytical approach using λ which exculde undisirable iteration for satisfying the energy usage constraints. The case studies for proposed algorithm are proven by sample system and KEPCO practical system, which produced very resonable both computing requirements and convergency.

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

  • 정춘식;박정도;국현종;문영현
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2000년도 하계학술대회 논문집 A
    • /
    • 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

확률적 운전예비력 및 운전비단가 우선순위법에 의한 화력시스텝의 실제적인 기동- 정지계획 (An Efficient Priority Based Unit Commitment using the Unit Operation Costs and the Probabilistic Reserve Requirements)

  • 이봉용;심건보;김정훈
    • 대한전기학회논문지
    • /
    • 제37권6호
    • /
    • pp.331-338
    • /
    • 1988
  • A simple algorithm is presented for solving the thermal unit commitment problem which is one of very important areas in economic operation of power systems. This algorithm is based on simple priority ordering by the unit operation cost and it is shown that the operation cost of chosen sets of generators is the minimum. The proposed method differs from the conventional priority-based formulations in that the unit operation are calculated in every load level. Further the poerating reserve requiements are satisfied by the newly derived analytical security function or the expectation of reserve. The proposed method is proven to be very simple, accurate and efficient in a sample system.

  • PDF

병렬 적응 진화알고리즘을 이용한 발전기 기동정지계획에 관한 연구 (A Parallel Adaptive Evolutionary Algorithm for Thermal Unit Commitment)

  • 김형수;조덕환;문경준;이화석;박준호;황기현
    • 대한전기학회논문지:전력기술부문A
    • /
    • 제55권9호
    • /
    • pp.365-375
    • /
    • 2006
  • This paper is presented by the application of parallel adaptive evolutionary algorithm(PAEA) to search an optimal solution of a thermal unit commitment problem. The adaptive evolutionary algorithm(AEA) takes the merits of both a genetic algorithm(GA) and an evolution strategy(ES) in an adaptive manner to use the global search capability of GA and the local search capability of ES. To reduce the execution time of AEA, the developed algorithm is implemented on an parallel computer which is composed of 16 processors. To handle the constraints efficiently and to apply to Parallel adaptive evolutionary algorithm(PAEA), the states of thermal unit are represented by means of real-valued strings that display continuous terms of on/off state of generating units and are involved in their minimum up and down time constraints. And the violation of other constraints are handled by repairing operator. The procedure is applied to the $10{\sim}100$ thermal unit systems, and the results show capabilities of the PAEA.