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

A Novel Discrete Binary Gaining-Sharing Knowledge-Based Optimization Algorithm for the Travelling Counselling Problem for Utilization of Solar Energy

Author

Listed:
  • Said Ali Hassan

    (Cairo University, Egypt)

  • Prachi Agrawal

    (National Institute of Technology, Hamirpur, India)

  • Talari Ganesh

    (National Institute of Technology, Hamirpur, India)

  • Ali Wagdy Mohamed

    (Cairo University, Egypt)

Abstract

This article proposes a novel binary version of recently developed Gaining-Sharing knowledge-based optimization algorithm (GSK) to solve binary optimization problems is proposed. GSK algorithm is based on the concept of how humans acquire and share knowledge during their life span. Discrete Binary version of GSK named novel binary Gaining Sharing knowledge-based optimization algorithm (DBGSK) depends on mainly two binary stages: binary junior gaining sharing stage and binary senior gaining sharing stage with knowledge factor 1. These two stages enable DBGSK for exploring and exploitation of the search space efficiently and effectively to solve problems in binary space.An improved scheduling of the technical counselling process for utilization of the electricity from solar energy power stations is introduced. The scheduling aims at achieving the best utilization of the available day time for the counselling group,n this regard,a new application problem is presented, which is called a Travelling Counselling Problem (TCP).A Nonlinear Binary Model is introduced with a real application

Suggested Citation

  • Said Ali Hassan & Prachi Agrawal & Talari Ganesh & Ali Wagdy Mohamed, 2022. "A Novel Discrete Binary Gaining-Sharing Knowledge-Based Optimization Algorithm for the Travelling Counselling Problem for Utilization of Solar Energy," International Journal of Swarm Intelligence Research (IJSIR), IGI Global, vol. 13(1), pages 1-24, January.
    • Handle: RePEc:igg:jsir00:v:13:y:2022:i:1:p:1-24
    as

    Download full text from publisher

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

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Nour Elhouda Chalabi & Abdelouahab Attia & Khalid Abdulaziz Alnowibet & Hossam M. Zawbaa & Hatem Masri & Ali Wagdy Mohamed, 2023. "A Multi–Objective Gaining–Sharing Knowledge-Based Optimization Algorithm for Solving Engineering Problems," Mathematics, MDPI, vol. 11(14), pages 1-37, July.

    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-24. 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.