IDEAS home Printed from https://ideas.repec.org/a/igg/jsir00/v13y2022i1p1-25.html
   My bibliography  Save this article

Solution of the Multi-Objective Optimal Power Flow Problem Using Oppositional-Based Algorithm

Author

Listed:
  • Nilkanth Raval

    (Nirma University, India)

  • Kuntal Bhattacharjee

    (Nirma University, India)

  • Soumesh Chatterjee

    (Nirma University, India)

Abstract

An efficient optimal power flow (OPF) algorithm allows the finest setting of the plant by solving multi-objective optimization problem to minimise the overall operating cost. This paper proposes the quasi oppositional backtrack search algorithm (QOBSA) for optimal setting of OPF control variables. The QOBSA is stochastic algorithm which gives committed and robust results compared to the traditional methods. This technique has been implemented to test the control parameters for the IEEE 30-bus with single and multi-objective functions like the minimization of fuel cost, minimization of total voltage deviation (TVD), voltage stability enhancement, emission reduction, and multi-fuel cost minimization. The result provides better voltage profile at every bus based on L-index which in turn greatly reduces the burden on load buses. The QOBSA code has been developed in the MATLAB platform and tested with the help of IEEE 30-bus and the outcomes have been compared with ongoing literature.

Suggested Citation

  • Nilkanth Raval & Kuntal Bhattacharjee & Soumesh Chatterjee, 2022. "Solution of the Multi-Objective Optimal Power Flow Problem Using Oppositional-Based Algorithm," International Journal of Swarm Intelligence Research (IJSIR), IGI Global, vol. 13(1), pages 1-25, January.
    • Handle: RePEc:igg:jsir00:v:13:y:2022:i:1:p:1-25
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJSIR.309938
    Download Restriction: no
    ---><---

    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:igg:jsir00:v:13:y:2022:i:1:p:1-25. 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.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.