대한전기학회논문지:전력기술부문A (The Transactions of the Korean Institute of Electrical Engineers A)

대한전기학회 (The Korean Institute of Electrical Engineers)
권호 표지

Tabu 탐색법을 이용한 화력 발전기의 기동정지계획

Thermal Unit Commitment using Tabu Search

  • 천희주 (부산대 대학원 전기공학과) ;
  • 김형수 (부산대 대학원 전기공학과) ;
  • 황기현 (부산대 대학원 전기공학과) ;
  • 문경준 (부산대 대학원 전기공학과) ;
  • 박준호 (부산대 공대 전기공학과)
  • 발행 : 2000.02.01
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

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.

키워드

참고문헌

  1. J. Wood and F. Wollenberg, 'Power Generation, Operation, And Control', pp. 131-170
  2. C. K. Pang , H. C. Chen, 'Optimal Short-Term Thermal Unit Commitment', IEEE Trans. on PAS, Vol. 95, No. 4, pp. 1336-1346, July/August 1976 https://doi.org/10.1109/T-PAS.1976.32228
  3. A. I. Cohen, M. Yoshimura, 'A Branch-and-Bound Algorithm for Unit Commitment', IEEE Trans. on PAS, Vol. PAS-102, pp. 444-451, Feb. 1983 https://doi.org/10.1109/TPAS.1983.317714
  4. L.F.B. Baptistella, J.C. Geromel, 'A Decomposition Approach to Problem of Unit Commitment Schedule for Hydrothermal Systems', IEEE Proc. Vol. 127, part D, No 6, pp. 250, Nov. 1980
  5. S. Virmani, C. Adrian, K. Imhof, S. Mukherjee, 'Implementation of a Lagrangian Relaxation Based Unit Commitment Problem', IEEE Trans. on PWRS, Vol. 4, No. 4, pp. 1373-1380, Oct. 1989 https://doi.org/10.1109/59.41687
  6. N. Chowhury, R. Billinton, 'Unit Commitment in Interconnected Generating Systems Using a Probabilistic Technique', IEEE Trans. on PWRS, Vol. 5, No. 4, pp. 1231-1237, November 1990 https://doi.org/10.1109/59.99374
  7. S. K. Tong, S. M. Shahiderpour, Z. Ouyang, 'A Heuristic Short-Term Unit Commitment', IEEE Trans. on PWRS, Vol. 6, No. 3, pp. 1210-1216, August 1991 https://doi.org/10.1109/59.119268
  8. Z. Ouyang, S.M. Shahidehpour, 'A Hybrid Artificial Neural Network-Dynamic Programming Approach to Unit Commitment', IEEE trans. on PWRS, Vol. 7, no. 1, pp. 236-242, February 1992 https://doi.org/10.1109/59.141709
  9. S. A. Kazarlis, A. G. Bakirtzis, V. Petridis, 'A Genetic Algorithm Solution to the Unit Commitment Problem', IEEE Trans. on PWRS, Vol. 11, No. 1, pp. 83-92, February 1996 https://doi.org/10.1109/59.485989
  10. F. Glover, 'Tabu Search - Part I,' ORSA Journal on Computing Vol. 1. No. 3, pp. 190-206, 1989
  11. F. Glover and M Laguna, 'Tabu Search' pp. 111-116
  12. S. O. Orero and M. R. Irving. 'Large scale unit commitment using a hybird genetic algorithm', Elsevier Science Ltd pp. 45-55 ,1996