IDEAS home Printed from https://ideas.repec.org/a/taf/rajsxx/v12y2020i7p867-872.html
   My bibliography  Save this article

Application of metaheuristic algorithms in DC-optimal power flow

Author

Listed:
  • Oluwafemi Ajayi
  • Nnamdi Nwulu
  • Uyikumhe Damisa

Abstract

This paper presents the application of two metaheuristic algorithms (Exchange Market Algorithm and Ant Lion Optimizer) in solving the DC optimal power flow problem. The objective of this study is to minimize fuel costs associated with electricity generation. Advanced Interactive Multidimensional Modelling Software is also used to solve the same optimization problem and the results obtained from using this method are used to validate those from the two metaheuristic algorithms. The three methods have been implemented on the standard IEEE 14- and 30-bus system, as well as the 62-bus Indian utility system. From the analysis, the results obtained prove the robustness and effectiveness of using both algorithms to solve DC optimal power flow and even more complex optimization problems.

Suggested Citation

  • Oluwafemi Ajayi & Nnamdi Nwulu & Uyikumhe Damisa, 2020. "Application of metaheuristic algorithms in DC-optimal power flow," African Journal of Science, Technology, Innovation and Development, Taylor & Francis Journals, vol. 12(7), pages 867-872, November.
    • Handle: RePEc:taf:rajsxx:v:12:y:2020:i:7:p:867-872
    DOI: 10.1080/20421338.2020.1726084
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/20421338.2020.1726084
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/20421338.2020.1726084?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:taf:rajsxx:v:12:y:2020:i:7:p:867-872. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/rajs .

    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.