• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1999년도 하계학술대회 논문집 C
• /
• pp.1098-1100
• /
• 1999

This paper proposes a method of solving a unit commitment problem using tabu search (TS). The TS is efficient optimization method using meta-heuristic. To improve the diversification properties of TS, path relinking method is introduced. To show the usefulness of the proposed method, we performed an experiment for the system of 10 units. Numerical results show improvements in the generation cost and the computation time compared to previously obtained results.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1997년도 추계학술대회 논문집 학회본부
• /
• pp.174-176
• /
• 1997

This paper proposes a unit commitment scheduling method based on hybrid genetic algorithm(GA). When the systems are scaled up, conventional genetic algorithms suffer from computational time limitations because of the growth of the search space. So greatly reduce the search space of the GA and to efficiently deal with the constraints of the problem, priority list unit ordering scheme are incorporated as the initial solution and the minimum up and down time constraints of the units are included. The violations of other constraints are handled by integrating penalty factors. To show the effectiveness of the proposed method. test results for system of 10 units is compared with results obtained using other methods.

• 대한전기학회논문지:전력기술부문A
• /
• 제53권6호
• /
• pp.334-339
• /
• 2004

In this study, a new UC (Unit Commitment) algorithm is proposed to consider the uncertainty of a daily load profile. The proposed algorithm calculates the UC results with the lower load level than the one generated by the conventional load forecast and the more hourly reserve allocation. In case of the worse load forecast, the deviation of the conventional UC solution can be overcome with the proposed method. The proposed method is tested with sample systems, which shows that the new UC algorithm yields completely feasible solution even though the worse load forecast is applied. Also, the effects of the uncertain hourly load demand are statistically analyzed especially by the consideration of the average over generation and the average under generation. Finally, it is shown that independent power producers participating in electricity spot-markets can establish bidding strategies by means of the statistical analysis. Therefore, it is expected that the proposed method can be used as the basic guideline for establishing bidding strategies under the deregulation power pool.

• 대한전기학회논문지:전력기술부문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.

• 대한전기학회논문지
• /
• 제34권6호
• /
• pp.220-229
• /
• 1985

This paper proposes a new optimal unit commitment algorithm for the rational operation of electric power systems. Especially, the algorithm is improved by considering transmission line capacity limits and load forecasting uncertainty with the consideration of the participation factors of each units, so that the method becomes more reliable and flexible one. The transmission losses are considered by using updated penalty factors obtained from the constant matrixes of the fast decoupled load flow method, the system loads are distributed at each buses, and the several necessary operational constraints are also considered for the purpose of presenting a more practicable scheme. Finally, the effectiveness of the proposed algorithm has been demonstrated by applying to the 23-bus model system.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1996년도 추계학술대회 논문집 학회본부
• /
• pp.137-140
• /
• 1996

This paper proposes a unit commitment scheduling method based on Parallel Genetic Algorithm(PGA). Due to a variety of constraints to be satisfied, such as the minimum up and down time constraints, the search space of the UC problem is highly nonconvex. So, we used transputer which is one of the practical parallel processors. It can give us fastness and effectiveness features of the proposed method for solving the problem. To show the effectiveness of the PGA based unit commitment scheduling, we tested results for system of 5 units and we can get desirable results.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1993년도 하계학술대회 논문집 A
• /
• pp.117-119
• /
• 1993

This paper presents a new method for solving unit commitment problem including hydro and pumped storage hydro units in a large scale power system. The proposed method makes it possible to get variable power of hydro and pumped storage hydro units and results in the better unit commitment with good convergency. Moreover this paper proposes an unit commitment algorithm to consider variable power of these units effectively by Lagrangian Relaxation method. By applying the proposed method to the test system, it is verified the usefulness of this method.

• 전기학회논문지
• /
• 제58권6호
• /
• pp.1057-1064
• /
• 2009

This paper introduces a new approach based on a quantum-inspired evolutionary algorithm (QEA) to solve unit commitment (UC) problems. The UC problem is a complicated nonlinear and mixed-integer combinatorial optimization problem with heavy constraints. This paper proposes a bounded quantum evolutionary algorithm (BQEA) to effectively solve the UC problems. The proposed BQEA adopts both the bounded rotation gate, which is simplified and improved to prevent premature convergence and increase the global search ability, and the increasing rotation angle approach to improve the search performance of the conventional QEA. Furthermore, it includes heuristic-based constraint treatment techniques to deal with the minimum up/down time and spinning reserve constraints in the UC problems. Since the excessive spinning reserve can incur high operation costs, the unit de-commitment strategy is also introduced to improve the solution quality. To demonstrate the performance of the proposed BQEA, it is applied to the large-scale power systems of up to 100-unit with 24-hour demand.

• 대한전기학회논문지:전력기술부문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.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2001년도 하계학술대회 논문집 A
• /
• pp.327-329
• /
• 2001

This paper presents the application of Parallel genetic algorithm and parallel tabu search to search an optimal solution of a unit commitment problem. The proposed method previously searches the solution globally using the parallel genetic algorithm, and then searches the solution locally using tabu search which has the good local search characteristic to reduce the computation time. This method combines the benefit of both method, and thus improves the performance. To show the usefulness of the proposed method, we simulated for 10 units system. Numerical results show the improvements of cost and computation time compared to previous obtained results.