Daryl Essam

Daryl Essam

Auto-generated profile, based on publicly available information

Daryl Essam

School of Systems & Computing, University of New South Wales (UNSW), Canberra, Australia

Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

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

Representative Publications

View All Publications
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

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.

12 December 2008 in Memetic Computing
Verified
Journal Article
Open access
PDF file
SHS. M. Kamrul Hasan
S. M. Kamrul Hasan
RSRuhul Sarker
Ruhul Sarker
DEDaryl Essam
Daryl Essam
DCDavid Cornforth
David Cornforth
The job-shop scheduling problem is well known for its complexity as an NP-hard problem. We have considered JSSPs with an objective of minimizing makespan while satisfying a number of hard constraints. In this paper, we developed a memetic algorithm (MA) for solving JSSPs. Three priority rules were designed, namely partial re-ordering, gap reduction and restricted swapping, and used as local search techniques in our MA. We have solved 40 benchmark problems and compared the results obtained with a number of established algorithms in the literature. The experimental results show that MA, as compared to GA, not only improves the quality of solutions but also reduces the overall computational time.

10 January 2024 in Swarm and Evolutionary Computation
Verified
Journal Article
Open access
JLJing Liu
Jing Liu
RSRuhul Sarker
Ruhul Sarker
SESaber Elsayed
Saber Elsayed
DEDaryl Essam
Daryl Essam
NSNurhadi Siswanto
Nurhadi Siswanto

1 February 2013 in Computers & Industrial Engineering
Verified
Journal Article
Closed access
HHH. Hishamuddin
H. Hishamuddin
RSR.A. Sarker
R.A. Sarker
DED. Essam
D. Essam