Next Article in Journal
A Comparative Analysis of Simulated Annealing and Variable Neighborhood Search in the ATCo Work-Shift Scheduling Problem
Next Article in Special Issue
Dynamic Parallel Mining Algorithm of Association Rules Based on Interval Concept Lattice
Previous Article in Journal
A Coupled Fixed Point Technique for Solving Coupled Systems of Functional and Nonlinear Integral Equations
Previous Article in Special Issue
Memes Evolution in a Memetic Variant of Particle Swarm Optimization
Open AccessArticle

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

1
Institute of Numerical Sciences, Kohat University of Science & Technology, Kohat 26000, Pakistan
2
College of Computer Science, King Khalid University, Abha 61321, Saudi Arabia
3
Jinnah College for Women, University of Peshawar, Peshawar 25000, Pakistan
4
Department of Mathematics, Abdul Wali Khan University, Mardan 23200, Pakistan
5
Department of Economics, Abbottabad University of Science & Technology, Abbottabad 22010, Pakistan
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Mathematics 2019, 7(7), 635; https://doi.org/10.3390/math7070635
Received: 9 June 2019 / Revised: 8 July 2019 / Accepted: 10 July 2019 / Published: 17 July 2019
(This article belongs to the Special Issue Evolutionary Algorithms in Intelligent Systems)
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. View Full-Text
Keywords: evolutionary algorithms; formal methods in evolutionary algorithms; self-adaptive differential evolutionary algorithms; constrained optimization; ensemble of constraint handling techniques; hybrid algorithms evolutionary algorithms; formal methods in evolutionary algorithms; self-adaptive differential evolutionary algorithms; constrained optimization; ensemble of constraint handling techniques; hybrid algorithms
Show Figures

Figure 1

MDPI and ACS Style

Javed, H.; Jan, M.A.; Tairan, N.; Mashwani, W.K.; Khanum, R.A.; Sulaiman, M.; Khan, H.U.; Shah, H. On the Efficacy of Ensemble of Constraint Handling Techniques in Self-Adaptive Differential Evolution. Mathematics 2019, 7, 635.

Show more citation formats Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Search more from Scilit
 
Search
Back to TopTop