Please use this identifier to cite or link to this item:
https://www.um.edu.mt/library/oar/handle/123456789/97531
Title: | Improving lagrangian relaxation unit commitment with Cuckoo Search Algorithm |
Authors: | Zeynal, Hossein Xiao Hui, Lim Jiazhen, Yap Eidiani, Mostafa Azzopardi, Brian |
Keywords: | Dynamic programming Electric power systems -- Mathematical models Mathematical optimization Integer programming Computational intelligence |
Issue Date: | 2014-12 |
Publisher: | IEEE |
Citation: | Zeynal, H., Hui, L. X., Jiazhen, Y., Eidiani, M., & Azzopardi, B. (2014, December). Improving lagrangian relaxation unit commitment with Cuckoo Search Algorithm. 2014 IEEE International Conference on Power and Energy (PECon), Malaysia. 77-82 |
Abstract: | In many utilities, it is essential to devise an optimum commitment solution of generating units for better operational efficiency, under empirical conditions. Among the methods reported in the technical literatures, Dynamic Programming (DP), Lagrangian Relaxation (LR), and Mixed-Integer Programming (MIP) are the most industry proven algorithms in the line of business. This paper improves the available solution offered in LR technique, which was mainly suffered from high fluctuation of duality gap between the primal and dual solutions. As a remedy, a Cuckoo Search Algorithm (CSA) is proposed to optimize the gap progress throughout the LR solution process. Simulation results reiterate that the developed LR-UC integrating CSA enhances the solution quality. |
URI: | https://www.um.edu.mt/library/oar/handle/123456789/97531 |
Appears in Collections: | Scholarly Works - FacEngSCE |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Improving_Lagrangian_Relaxation_Unit_Commitment_with_Cuckoo_Search_Algorithm(2014).pdf Restricted Access | 838.51 kB | Adobe PDF | View/Open Request a copy |
Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.