IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/1564693.html
   My bibliography  Save this article

Finding Optimal Load Dispatch Solutions by Using a Proposed Cuckoo Search Algorithm

Author

Listed:
  • Thang Trung Nguyen
  • Cong-Trang Nguyen
  • Le Van Dai
  • Nguyen Vu Quynh

Abstract

Optimal load dispatch (OLD) is an important engineering problem in power system optimization field due to its significance of reducing the amount of electric generation fuel and increasing benefit. In the paper, an improved cuckoo search algorithm (ICSA) is proposed for determining optimal generation of all available thermal generation units so that all constraints consisting of prohibited power zone (PPZ), real power balance (RPB), power generation limitations (PGL), ramp rate limits (RRL), and real power reserve (RPR) are completely satisfied. The proposed ICSA method performance is more robust than conventional Cuckoo search algorithm (CCSA) by applying new modifications. Compared to CCSA, the proposed ICSA approach can obtain high quality solutions and speed up the solution search ability. The ICSA robustness is verified on different systems with diversification of objective functions as well as the considered constraint set. The results from the proposed ICSA method are compared to other algorithms for comparison. The result comparison analysis indicates that the proposed ICSA approach is more robust than CCSA and other existing optimization approaches in finding solutions with significant quality and shortening simulation time. Consequently, it should lead to a conclusion that the proposed ICSA approach deserves to be applied for finding solutions of OLD problem in power system optimization field.

Suggested Citation

  • Thang Trung Nguyen & Cong-Trang Nguyen & Le Van Dai & Nguyen Vu Quynh, 2019. "Finding Optimal Load Dispatch Solutions by Using a Proposed Cuckoo Search Algorithm," Mathematical Problems in Engineering, Hindawi, vol. 2019, pages 1-29, May.
  • Handle: RePEc:hin:jnlmpe:1564693
    DOI: 10.1155/2019/1564693
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2019/1564693.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/MPE/2019/1564693.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2019/1564693?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:jnlmpe:1564693. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.