Applications of the Genetic Algorithm to the Unit Commitment

Unit Commitment 문제에 유전알고리즘 적용

  • Kim, H.S. (Dept. of Electrical Engineering, Pusan National University) ;
  • Hwang, G.H. (Dept. of Electrical Engineering, Pusan National University) ;
  • Mun, K.J. (Dept. of Electrical Engineering, Pusan National University) ;
  • Lee, H.S. (Dept. of Electrical Engineering, Pusan National University) ;
  • Park, J.H. (Dept. of Electrical Engineering, Pusan National University)
  • Published : 1996.07.22

Abstract

This paper proposes a unit commitment scheduling method based on Genetic Algorithm(GA). Due to a variety of constraints to be satisfied, the search space of the UC problem is highly nonconvex, so the UC problem cannot be solved efficiently only using the standard GA To efficiently deal with the constraints of the problem and greatly reduce the search space of the GA, the minimum up and down time constraints are embedded in the binary strings that are coded to represent the on-off states of the generating units. The violations of other constraints arc handled by integrating penalty factors. To show the effectiveness of the GA based unit commitment scheduling, test results for system of 5 units are compared with results obtained using Lagrangian Relaxation and Dynamic Programming.

Keywords