Evolutionary mating algorithm
File version
Author(s)
Mustaffa, Zuriani
Saari, Mohd Mawardi
Daniyal, Hamdan
Mirjalili, Seyedali
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)
Date
Size
File type(s)
Location
License
Abstract
This paper proposes a new evolutionary algorithm namely Evolutionary Mating Algorithm (EMA) to solve constrained optimization problems. The algorithm is based on the adoption of random mating concept from Hardy–Weinberg equilibrium and crossover index in order to produce new offspring. In this algorithm, effect of the environmental factor (i.e. the presence of predator) has also been considered and treated as an exploratory mechanism. The EMA is initially tested on the 23 benchmark functions to analyze its effectiveness in finding optimal solutions for different search spaces. It is then applied to Optimal Power Flow (OPF) problems with the incorporation of Flexible AC Transmission Systems (FACTS) devices and stochastic wind power generation. The extensive comparative studies with other algorithms demonstrate that EMA provides better results and can be used in solving real optimization problems from various fields.
Journal Title
Neural Computing and Applications
Conference Title
Book Title
Edition
Volume
Issue
Thesis Type
Degree Program
School
Publisher link
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement
Item Access Status
Note
This publication has been entered in Griffith Research Online as an advanced online version.
Access the data
Related item(s)
Subject
Data structures and algorithms
Artificial intelligence
Computer vision and multimedia computation
Machine learning
Science & Technology
Computer Science, Artificial Intelligence
Evolutionary mating algorithm
Persistent link to this record
Citation
Sulaiman, MH; Mustaffa, Z; Saari, MM; Daniyal, H; Mirjalili, S, Evolutionary mating algorithm, Neural Computing and Applications, 2022