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

Hassan Javed, Muhammad Asif Jan, Nasser Tairan, Wali Khan Mashwani, Rashida Adeeb Khanum, Muhammad Sulaiman, Hidayat Ullah Khan and Habib Shah
Additional contact information
Hassan Javed: Institute of Numerical Sciences, Kohat University of Science & Technology, Kohat 26000, Pakistan
Muhammad Asif Jan: Institute of Numerical Sciences, Kohat University of Science & Technology, Kohat 26000, Pakistan
Nasser Tairan: College of Computer Science, King Khalid University, Abha 61321, Saudi Arabia
Wali Khan Mashwani: Institute of Numerical Sciences, Kohat University of Science & Technology, Kohat 26000, Pakistan
Rashida Adeeb Khanum: Jinnah College for Women, University of Peshawar, Peshawar 25000, Pakistan
Muhammad Sulaiman: Department of Mathematics, Abdul Wali Khan University, Mardan 23200, Pakistan
Hidayat Ullah Khan: Department of Economics, Abbottabad University of Science & Technology, Abbottabad 22010, Pakistan
Habib Shah: College of Computer Science, King Khalid University, Abha 61321, Saudi Arabia

Mathematics, 2019, vol. 7, issue 7, 1-19

Abstract: 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.

Keywords: evolutionary algorithms; formal methods in evolutionary algorithms; self-adaptive differential evolutionary algorithms; constrained optimization; ensemble of constraint handling techniques; hybrid algorithms (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/7/7/635/pdf (application/pdf)
https://www.mdpi.com/2227-7390/7/7/635/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:7:y:2019:i:7:p:635-:d:249290

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().