Solving Nonlinear Single-Unit Commitment Problem by Genetic Algorithm Based Clustering Technique

El-Shorbagy M.a (), Mousa A.a () and M Farag ()

Review of Computer Engineering Research, 2017, vol. 4, issue 1, 11-29

Abstract: Nonlinear single-unit commitment problem (NSUCP) is a NP-hard nonlinear mixed-integer optimization problem, encountered as one of the toughest problems in power systems. This paper presents a new algorithm for solving NSUCP using genetic algorithm (GA) based clustering technique. The proposed algorithm integrates the main features of binary-real coded GA and K-means clustering technique. Clustering technique divides population into a specific number of subpopulations. In this way, different operators of GA can be used instead of using one operator to the whole population to avoid the local minima and introduce diversity. The effectiveness of the proposed algorithm is validated by comparison with other well-known techniques. By comparison with the previously reported results, it is found that the performance of the proposed algorithm quite satisfactory.

Keywords: Nonlinear single-unit commitment problem; Genetic algorithm; Clustering technique; Optimization (search for similar items in EconPapers)
Date: 2017
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://archive.conscientiabeam.com/index.php/76/article/view/1451/2028 (application/pdf)
https://archive.conscientiabeam.com/index.php/76/article/view/1451/4800 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:pkp:rocere:v:4:y:2017:i:1:p:11-29:id:1451

Access Statistics for this article

More articles in Review of Computer Engineering Research from Conscientia Beam
Bibliographic data for series maintained by Dim Michael ().