IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v11y2023i14p3092-d1193278.html
   My bibliography  Save this article

A Multi–Objective Gaining–Sharing Knowledge-Based Optimization Algorithm for Solving Engineering Problems

Author

Listed:
  • Nour Elhouda Chalabi

    (Computer Science Department, University Mohamed Boudiaf of Msila, Msila 28000, Algeria)

  • Abdelouahab Attia

    (LMSE Laboratory, Mohamed El Bachir El Ibrahimi University of Bordj Bou Arreridj, Bordj Bou Arreridj 34000, Algeria
    Computer Science Department, University Mohamed El Bachir El Ibrahimi of Bordj Bou Arreridj, Bordj Bou Arreridj 34000, Algeria)

  • Khalid Abdulaziz Alnowibet

    (Statistics and Operations Research Department, College of Science, King Saud University, P.O. Box 2455, Riyadh 11451, Saudi Arabia)

  • Hossam M. Zawbaa

    (CeADAR Ireland’s Center for Applied AI, Technological University Dublin, D7 EWV4 Dublin, Ireland)

  • Hatem Masri

    (Applied Science University, Sakhir 32038, Bahrain)

  • Ali Wagdy Mohamed

    (Operations Research Department, Faculty of Graduate Studies for Statistical Research, Cairo University, Giza 12613, Egypt
    Applied Science Research Center, Applied Science Private University, Amman 11937, Jordan)

Abstract

Metaheuristics in recent years has proven its effectiveness; however, robust algorithms that can solve real-world problems are always needed. In this paper, we suggest the first extended version of the recently introduced gaining–sharing knowledge optimization (GSK) algorithm, named multiobjective gaining–sharing knowledge optimization (MOGSK), to deal with multiobjective optimization problems (MOPs). MOGSK employs an external archive population to store the nondominated solutions generated thus far, with the aim of guiding the solutions during the exploration process. Furthermore, fast nondominated sorting with crowding distance was incorporated to sustain the diversity of the solutions and ensure the convergence towards the Pareto optimal set, while the ϵ -dominance relation was used to update the archive population solutions. ϵ -dominance helps provide a good boost to diversity, coverage, and convergence overall. The validation of the proposed MOGSK was conducted using five biobjective (ZDT) and seven three-objective test functions (DTLZ) problems, along with the recently introduced CEC 2021, with fifty-five test problems in total, including power electronics, process design and synthesis, mechanical design, chemical engineering, and power system optimization. The proposed MOGSK was compared with seven existing optimization algorithms, including MOEAD, eMOEA, MOPSO, NSGAII, SPEA2, KnEA, and GrEA. The experimental findings show the good behavior of our proposed MOGSK against the comparative algorithms in particular real-world optimization problems.

Suggested Citation

  • 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.
    • Handle: RePEc:gam:jmathe:v:11:y:2023:i:14:p:3092-:d:1193278
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/11/14/3092/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/11/14/3092/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Lulu Fan & Tatsuo Yoshino & Tao Xu & Ye Lin & Huan Liu, 2018. "A Novel Hybrid Algorithm for Solving Multiobjective Optimization Problems with Engineering Applications," Mathematical Problems in Engineering, Hindawi, vol. 2018, pages 1-15, January.
    2. 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.
    3. Zouache, Djaafar & Moussaoui, Abdelouahab & Ben Abdelaziz, Fouad, 2018. "A cooperative swarm intelligence algorithm for multi-objective discrete optimization with application to the knapsack problem," European Journal of Operational Research, Elsevier, vol. 264(1), pages 74-88.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Jakubik, Johannes & Binding, Adrian & Feuerriegel, Stefan, 2021. "Directed particle swarm optimization with Gaussian-process-based function forecasting," European Journal of Operational Research, Elsevier, vol. 295(1), pages 157-169.
    2. Ziqian Wang & Xin Huang & Yan Zhang & Danju Lv & Wei Li & Zhicheng Zhu & Jian’e Dong, 2024. "Modeling and Solving the Knapsack Problem with a Multi-Objective Equilibrium Optimizer Algorithm Based on Weighted Congestion Distance," Mathematics, MDPI, vol. 12(22), pages 1-19, November.
    3. Elias Munapo & Santosh Kumar, 2021. "Reducing the complexity of the knapsack linear integer problem by reformulation techniques," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 12(6), pages 1087-1093, December.
    4. Chou, Jui-Sheng & Truong, Dinh-Nhat, 2020. "Multiobjective optimization inspired by behavior of jellyfish for solving structural design problems," Chaos, Solitons & Fractals, Elsevier, vol. 135(C).
    5. Djaafar Zouache & Fouad Ben Abdelaziz & Mira Lefkir & Nour El-Houda Chalabi, 2021. "Guided Moth–Flame optimiser for multi-objective optimization problems," Annals of Operations Research, Springer, vol. 296(1), pages 877-899, January.

    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:gam:jmathe:v:11:y:2023:i:14:p:3092-:d:1193278. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.