On the Efficacy of Ensemble of Constraint Handling Techniques in Self-Adaptive Differential Evolution

Self-adaptive variants of evolutionary algorithms (EAs) tune their parameters on the go by learning from the search history. Adaptive differential evolution with optional external archive (JADE) and self-adaptive differential evolution (SaDE) are two well-known self-adaptive versions of differential...

Full description

Saved in:
Bibliographic Details
Published in:Mathematics (Basel) 2019-07, Vol.7 (7), p.635
Main Authors: Javed, Hassan, Jan, Muhammad Asif, Tairan, Nasser, Mashwani, Wali Khan, Khanum, Rashida Adeeb, Sulaiman, Muhammad, Khan, Hidayat Ullah, Shah, Habib
Format: Article
Language:English
Subjects:
Adaptive search techniques
Archives & records
constrained optimization
Constraints
ensemble of constraint handling techniques
Evolutionary algorithms
Evolutionary computation
Feasibility
Fines & penalties
formal methods in evolutionary algorithms
Genetic algorithms
Handling
hybrid algorithms
Machine learning
Mathematics
Mutation
Optimization
Optimization algorithms
Optimization techniques
Population
self-adaptive differential evolutionary algorithms
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Self-adaptive variants of evolutionary algorithms (EAs) tune their parameters on the go by learning from the search history. Adaptive differential evolution with optional external archive (JADE) and self-adaptive differential evolution (SaDE) are two well-known self-adaptive versions of differential evolution (DE). They are both unconstrained search and optimization algorithms. However, if some constraint handling techniques (CHTs) are incorporated in their frameworks, then they can be used to solve constrained optimization problems (COPs). In an early work, an ensemble of constraint handling techniques (ECHT) is probabilistically hybridized with the basic version of DE. The ECHT consists of four different CHTs: superiority of feasible solutions, self-adaptive penalty, ε -constraint handling technique and stochastic ranking. This paper employs ECHT in the selection schemes, where offspring competes with their parents for survival to the next generation, of JADE and SaDE. As a result, JADE-ECHT and SaDE-ECHT are developed, which are the constrained variants of JADE and SaDE. Both algorithms are tested on 24 COPs and the experimental results are collected and compared according to algorithms’ evaluation criteria of CEC’06. Their comparison, in terms of feasibility rate (FR) and success rate (SR), shows that SaDE-ECHT surpasses JADE-ECHT in terms of FR, while JADE-ECHT outperforms SaDE-ECHT in terms of SR.
ISSN:2227-7390
2227-7390
DOI:10.3390/math7070635