Solving Unit Commitment Problem Using Modified Subgradient Method Combined with Simulated Annealing Algorithm


Creative Commons License

Filik U. B., KURBAN M.

MATHEMATICAL PROBLEMS IN ENGINEERING, cilt.2010, 2010 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 2010
  • Basım Tarihi: 2010
  • Doi Numarası: 10.1155/2010/295645
  • Dergi Adı: MATHEMATICAL PROBLEMS IN ENGINEERING
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Anadolu Üniversitesi Adresli: Evet

Özet

This paper presents the solving unit commitment (UC) problem using Modified Subgradient Method (MSG) method combined with Simulated Annealing (SA) algorithm. UC problem is one of the important power system engineering hard-solving problems. The Lagrangian relaxation (LR) based methods are commonly used to solve the UC problem. The main disadvantage of this group of methods is the difference between the dual and the primal solution which gives some significant problems on the quality of the feasible solution. In this paper, MSG method which does not require any convexity and differentiability assumptions is used for solving the UC problem. MSG method depending on the initial value reaches zero duality gap. SA algorithm is used in order to assign the appropriate initial value for MSG method. The major advantage of the proposed approach is that it guarantees the zero duality gap independently from the size of the problem. In order to show the advantages of this proposed approach, the four-unit Tuncbilek thermal plant and ten-unit thermal plant which is usually used in literature are chosen as test systems. Penalty function (PF) method is also used to compare with our proposed method in terms of total cost and UC schedule.