Doaa Mahmoud El-sadek

Dr. Doaa Mahmoud El-sadek

orcid

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
29 March 2022 in Mathematics
Verified
Journal Article
Open access
PDF file
IAIbrahim Attiya
Ibrahim Attiya
Laith AbualigahLaith Abualigah
Laith Abualigah
DEDoaa Mahmoud El-sadek
Doaa Mahmoud El-sadek
SCSamia Allaoua Chelloug
Samia Allaoua Chelloug
Mohamed Abd ElazizMohamed Abd Elaziz
Mohamed Abd Elaziz
The cloud computing paradigm is evolving rapidly to address the challenges of new emerging paradigms, such as the Internet of Things (IoT) and fog computing. As a result, cloud services usage is increasing dramatically with the recent growth of IoT-based applications. To successfully fulfill application requirements while efficiently harnessing cloud computing power, intelligent scheduling approaches are required to optimize the scheduling of IoT application tasks on computing resources. In this paper, the chimp optimization algorithm (ChOA) is incorporated with the marine predators algorithm (MPA) and disruption operator to determine the optimal solution to IoT applications’ task scheduling. The developed algorithm, called CHMPAD, aims to avoid entrapment in the local optima and improve the exploitation capability of the basic ChOA as its main drawbacks. Experiments are conducted using synthetic and real workloads collected from the Parallel Workload Archive to demonstrate the applicability and efficiency of the presented CHMPAD method. The simulation findings reveal that CHMPAD can achieve average makespan time improvements of 1.12–43.20% (for synthetic workloads), 1.00–43.43% (for NASA iPSC workloads), and 2.75–42.53% (for HPC2N workloads) over peer scheduling algorithms. Further, our evaluation results suggest that our proposal can improve the throughput performance of fog computing.

1 June 2022 in Mathematics
Verified
Journal Article
Open access
PDF file
IAIbrahim Attiya
Ibrahim Attiya
Laith AbualigahLaith Abualigah
Laith Abualigah
SASamah Ibrahim Alshathri
Samah Ibrahim Alshathri
DEDoaa Mahmoud El-sadek
Doaa Mahmoud El-sadek
Mohamed Abd ElazizMohamed Abd Elaziz
Mohamed Abd Elaziz
This paper presents a novel dynamic Jellyfish Search Algorithm using a Simulated Annealing and disruption operator, called DJSD. The developed DJSD method incorporates the Simulated Annealing operators into the conventional Jellyfish Search Algorithm in the exploration stage, in a competitive manner, to enhance its ability to discover more feasible regions. This combination is performed dynamically using a fluctuating parameter that represents the characteristics of a hammer. The disruption operator is employed in the exploitation stage to boost the diversity of the candidate solutions throughout the optimization operation and avert the local optima problem. A comprehensive set of experiments is conducted using thirty classical benchmark functions to validate the effectiveness of the proposed DJSD method. The results are compared with advanced well-known metaheuristic approaches. The findings illustrated that the developed DJSD method achieved promising results, discovered new search regions, and found new best solutions. In addition, to further validate the performance of DJSD in solving real-world applications, experiments were conducted to tackle the task scheduling problem in cloud computing applications. The real-world application results demonstrated that DJSD is highly competent in dealing with challenging real applications. Moreover, it achieved gained high performances compared to other competitors according to several standard evaluation measures, including fitness function, makespan, and energy consumption.

1 October 2022 in Bulletin of Faculty of Science, Zagazig University
Verified
Journal Article
Closed access
PDF file
DEDoaa Mahmoud El-sadek
Doaa Mahmoud El-sadek
RFR M Farouk
R M Farouk
Metaheuristic algorithms have evolved with exciting performance to solve complex real-world combinatorial optimization problems. These combinatorial optimization problems span across engineering, medical sciences, and sciences generally. In this paper we have proposed metaheuristic algorithms for solving the global optimization problems. The global optimization problems are one of interested problems in artificial intelligence, medical sciences, engineering and machine learning. We have discussed a number of algorithms such as Whale Optimization Algorithm (WOA), the Bat Algorithm (BA), War Strategy Optimization (WSO), and Ant Lion optimization algorithm(ALO). In our paper we have tested our algorithms on twenty-three benchmark functions. The numerical results show that the War Strategy optimization algorithm (WSO) has the best performance more than the other algorithms to solve global optimization problems, and the Bat Algorithm(BA) has the worst performance to solve the global optimization problems. The experimental results for various global optimization problems prove the superiority of the War strategy optimization algorithm.