Zagazig University Digital Repository
Home
Thesis & Publications
All Contents
Publications
Thesis
Graduation Projects
Research Area
Research Area Reports
Search by Research Area
Universities Thesis
ACADEMIC Links
ACADEMIC RESEARCH
Zagazig University Authors
Africa Research Statistics
Google Scholar
Research Gate
Researcher ID
CrossRef
An Efficient Marine Predators Algorithm for Solving Multi-Objective Optimization Problems: Analysis and Validations
Faculty
Computer Science
Year:
2021
Type of Publication:
ZU Hosted
Pages:
42817-42844
Authors:
Staff Zu Site
Abstract In Staff Site
Journal:
IEEE Access IEEE
Volume:
9
Keywords :
, Efficient Marine Predators Algorithm , Solving Multi-Objective
Abstract:
Recently, a new strong optimization algorithm called marine predators algorithm (MPA) has been proposed for tackling the single-objective optimization problems and could dramatically fulfill good outcomes in comparison to the other compared algorithms. Those dramatic outcomes, in addition to our recently-proposed strategies for helping meta-heuristic algorithms in fulfilling better outcomes for the multi-objective optimization problems, motivate us to make a comprehensive study to see the performance of MPA alone and with those strategies for those optimization problems. Specifically, This paper proposes four variants of the marine predators' algorithm (MPA) for solving multi-objective optimization problems. The first version, called the multi-objective marine predators' algorithm (MMPA) is based on the behavior of marine predators in finding their prey. In the second version, a novel strategy called dominance strategy-based exploration-exploitation (DSEE) recently-proposed is effectively incorporated with MMPA to relate the exploration and exploitation phase of MPA to the dominance of the solutions-this version is called M-MMPA. DSEE counts the number of dominated solutions for each solution-the solutions with high dominance undergo an exploitation phase; the others with small dominance undergo the exploration phase. The third version integrates M-MMPA with a novel strategy called Gaussian-based mutation, which uses the Gaussian distribution-based exploration and exploitation strategy to search for the optimal solution. The fourth version uses the Nelder-Mead simplex method with M-MMPA (M-MMPA-NMM) at the start of the optimization process to construct a front of the non-dominated solutions that will help M-MMPA to find more good solutions. The effectiveness of the four versions is validated on a large set of theoretical and practical problems. For all the cases, the proposed algorithm and its variants are shown to be superior to a number of well-known multi-objective optimization algorithms.
Author Related Publications
Department Related Publications
Heba Zaki Mohamed Abdallah Elfiqi, "A computational linguistic approach for the identification of translator stylometry using Arabic-English text", IEEE, 2011
More
Heba Zaki Mohamed Abdallah Elfiqi, "Measuring Complexity of Mouse Brain Morphological Changes Using GeoEntropy", AIP Publishing, 2009
More
Mohammed Abdel Basset Metwally Attia, "Training Feedforward Neural Networks Using Symbiotic Organisms Search Algorithm", Computational Intelligence and Neuroscience, 2016
More
Mohammed Abdel Basset Metwally Attia, "Solving systems of nonlinear equations via conjugate direction flower pollination algorithm", inderscience, 2017
More
Mustafa Khamis Baz Ramadan, "An Efficient method for choosing most suitable cloud storage provider reducing top security risks based on multi-criteria neutrosophic decision making", An Efficient method for choosing most suitable cloud storage provider reducing top security risks based on multi-criteria neutrosophic decision making, 2017
More
جامعة المنصورة
جامعة الاسكندرية
جامعة القاهرة
جامعة سوهاج
جامعة الفيوم
جامعة بنها
جامعة دمياط
جامعة بورسعيد
جامعة حلوان
جامعة السويس
شراقوة
جامعة المنيا
جامعة دمنهور
جامعة المنوفية
جامعة أسوان
جامعة جنوب الوادى
جامعة قناة السويس
جامعة عين شمس
جامعة أسيوط
جامعة كفر الشيخ
جامعة السادات
جامعة طنطا
جامعة بنى سويف