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

Optimum Scheduling the Electric Distribution Substations with a Case Study: An Integer Gaining-Sharing Knowledge-Based Metaheuristic Algorithm

Author

Listed:
  • Said Ali Hassan
  • Khalid Alnowibet
  • Prachi Agrawal
  • Ali Wagdy Mohamed

Abstract

This work is dedicated to the economic scheduling of the required electric stations in the upcoming 10-year long-term plan. The calculation of the required electric stations is carried out by estimating the yearly consumption of electricity over a long-time plan and then determining the required number of stations. The aim is to minimize the total establishing and operating costs of the stations based on a mathematical programming model with nonlinear objective function and integer decision variables. The introduced model is applied for a real practical case study to conclude the number of yearly constructed stations over a long-term plan in the electricity sector in Jeddah City, Saudi Arabia. The current planning method is based only on intuition by constructing the same number of required stations in each year without searching for better solutions. To solve the introduced mathematical model, a novel recent gaining sharing knowledge-based algorithm, named GSK, has been used. The Augmented Lagrangian Method (ALM) is applied to transform the constrained formulation to become unconstrained with penalization to the objective function. According to the obtained results of the real case study, the proposed GSK with ALM approved an ability to solve this case with respect to convergence, efficiency, quality, and robustness.

Suggested Citation

  • Said Ali Hassan & Khalid Alnowibet & Prachi Agrawal & Ali Wagdy Mohamed, 2020. "Optimum Scheduling the Electric Distribution Substations with a Case Study: An Integer Gaining-Sharing Knowledge-Based Metaheuristic Algorithm," Complexity, Hindawi, vol. 2020, pages 1-13, December.
  • Handle: RePEc:hin:complx:6675741
    DOI: 10.1155/2020/6675741
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/8503/2020/6675741.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/8503/2020/6675741.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2020/6675741?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:complx:6675741. 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.