Reduced search space mechanism for solving constrained optimization problems

Karam M. Sallam, Ruhul A. Sarker, Daryl L. Essam

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)

Abstract

Over the last few decades, a considerable number of evolutionary algorithms (EAs) have been proposed for solving constrained optimization problems (COPs). As for most of these problems, the optimal solution exists on the boundary of the feasible space, we aim to focus the search process around the boundary. In this paper a new concept, called reduced search space (R2S), is introduced. In the process, we first identify active constraints, based on the current solutions, and then define R2S around those constraint's boundaries. However, the search may be conducted either in the entire R2S or in some portions of it. To judge the impact of this concept, we have incorporated it with a number of state-of-the-art algorithms, and we have comprehensively tested it on three sets of benchmark test functions, namely, 24 test functions taken from IEEE CEC2006, 18 test functions with 10D and 30D taken from IEEE CEC2010 and 10 test functions taken from IEEE CEC2011. The results show that our proposed mechanism significantly improves the performances of state-of-the-art algorithms.

Original languageEnglish
Pages (from-to)147-158
Number of pages12
JournalEngineering Applications of Artificial Intelligence
Volume65
DOIs
Publication statusPublished - 1 Oct 2017

Fingerprint

Dive into the research topics of 'Reduced search space mechanism for solving constrained optimization problems'. Together they form a unique fingerprint.

Cite this