Saber Mohammed Elsayed

Saber Mohammed Elsayed

Auto-generated profile, based on publicly available information

Saber Mohammed Elsayed

School of Systems and Computing, The University of New South Wales (UNSW), Canberra ACT, Australia

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

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

Representative Publications

View All Publications
16 September 2013 in IEEE Transactions on Evolutionary Computation
Verified
Journal Article
Open access
RSRuhul A. Sarker
Ruhul A. Sarker
SESaber M. Elsayed
Saber M. Elsayed
TRTapabrata Ray
Tapabrata Ray
Over the last few decades, a number of differential evolution (DE) algorithms have been proposed with excellent performance on mathematical benchmarks. However, like any other optimization algorithm, the success of DE is highly dependent on the search operators and control parameters that are often decided a priori. The selection of the parameter values is itself a combinatorial optimization problem. Although a considerable number of investigations have been conducted with regards to parameter selection, it is known to be a tedious task. In this paper, a DE algorithm is proposed that uses a new mechanism to dynamically select the best performing combinations of parameters (amplification factor, crossover rate, and the population size) for a problem during the course of a single run. The performance of the algorithm is judged by solving three well known sets of optimization test problems (two constrained and one unconstrained). The results demonstrate that the proposed algorithm not only saves the computational time, but also shows better performance over the state-of-the-art algorithms. The proposed mechanism can easily be applied to other population-based algorithms.

1 January 2014 in Engineering Applications of Artificial Intelligence
Verified
Journal Article
Closed access
SESaber M. Elsayed
Saber M. Elsayed
RSRuhul A. Sarker
Ruhul A. Sarker
DEDaryl L. Essam
Daryl L. Essam

1 December 2011 in Computers & Operations Research
Verified
Journal Article
Closed access
SESaber M. Elsayed
Saber M. Elsayed
RSRuhul A. Sarker
Ruhul A. Sarker
DEDaryl L. Essam
Daryl L. Essam

13 May 2015 in IEEE Transactions on Power Systems
Verified
Journal Article
Closed access
MZM. F. Zaman
M. F. Zaman
SESaber M. Elsayed
Saber M. Elsayed
TRTapabrata Ray
Tapabrata Ray
RSRuhul A. Sarker
Ruhul A. Sarker
The dynamic economic dispatch problem is a high-dimensional complex constrained optimization problem that determines the optimal generation from a number of generating units by minimizing the fuel cost. Over the last few decades, a number of solution approaches, including evolutionary algorithms, have been developed to solve this problem. However, the performance of evolutionary algorithms is highly dependent on a number of factors, such as the control parameters, diversity of the population, and constraint-handling procedure used. In this paper, a self-adaptive differential evolution and a real-coded genetic algorithm are proposed to solve the dynamic dispatch problem. In the algorithm design, a new heuristic technique is introduced to guide infeasible solutions towards the feasible space. Moreover, a constraint-handling mechanism, a dynamic relaxation for equality constraints, and a diversity mechanism are applied to improve the performance of the algorithms. The effectiveness of the proposed approaches is demonstrated on a number of dynamic economic dispatch problems for a cycle of 24 h. Their simulation results are compared with each other and state-of-the-art algorithms, which reveals that the proposed method has merit in terms of solution quality and reliability.

10 May 2012 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Closed access
SESaber M. Elsayed
Saber M. Elsayed
RSRuhul A. Sarker
Ruhul A. Sarker
DEDaryl L. Essam
Daryl L. Essam
Many real-world optimization problems are difficult to solve as they do not possess the nice mathematical properties required by the exact algorithms. Evolutionary algorithms are proven to be appropriate for such problems. In this paper, we propose an improved differential evolution algorithm that uses a mix of different mutation operators. In addition, the algorithm is empowered by a covariance adaptation matrix evolution strategy algorithm as a local search. To judge the performance of the algorithm, we have solved well-known benchmark as well as a variety of real-world optimization problems. The real-life problems were taken from different sources and disciplines. According to the results obtained, the algorithm shows a superior performance in comparison with other algorithms that also solved these problems.

1 June 2011
Verified
Conference Paper
Closed access
SESaber M. Elsayed
Saber M. Elsayed
RSRuhul A. Sarker
Ruhul A. Sarker
DEDaryl L. Essam
Daryl L. Essam
Over the last two decades, many Genetic Algorithms have been introduced for solving optimization problems. Due to the variability of the characteristics in different optimization problems, none of these algorithms performs consistently over a range of problems. In this paper, we introduce a GA with a new multi-parent crossover for solving a variety of optimization problems. The proposed algorithm also uses both a randomized operator as mutation and maintains an archive of good solutions. The algorithm has been applied to solve the set of real world problems proposed for the IEEE-CEC2011 evolutionary algorithm competition.