Department of Mathematics and Statistics, International Islamic University, Islamabad, Pakistan.
Department of Mathematics, King Khalid University, 61413 Abha, Saudi Arabia.
Comput Intell Neurosci. 2019 Dec 5;2019:8640218. doi: 10.1155/2019/8640218. eCollection 2019.
Genetic algorithms (GAs) are stochastic-based heuristic search techniques that incorporate three primary operators: selection, crossover, and mutation. These operators are supportive in obtaining the optimal solution for constrained optimization problems. Each operator has its own benefits, but selection of chromosomes is one of the most essential operators for optimal performance of the algorithms. In this paper, an improved genetic algorithm-based novel selection scheme, i.e., stairwise selection (SWS) is presented to handle the problems of exploration (population diversity) and exploitation (selection pressure). For its global performance, we compared with several other selection schemes by using ten well-known benchmark functions under various dimensions. For a close comparison, we also examined the significance of SWS based on the statistical results. Chi-square goodness of fit test is also used to evaluate the overall performance of the selection process, i.e., mean difference between observed and expected number of offspring. Hence, the overall empirical results along with graphical representation endorse that the SWS outperformed in terms of robustness, stability, and effectiveness other competitors through authentication of performance index (PI).
遗传算法(GA)是一种基于随机的启发式搜索技术,它包含三个主要算子:选择、交叉和变异。这些算子有助于获得约束优化问题的最优解。每个算子都有其自身的优势,但选择染色体是算法获得最优性能的最关键算子之一。本文提出了一种基于改进遗传算法的新颖选择方案,即阶梯式选择(SWS),以处理探索(种群多样性)和开发(选择压力)的问题。为了评估其全局性能,我们使用了十个著名的基准函数,在不同的维度下,将其与其他几种选择方案进行了比较。为了进行更紧密的比较,我们还基于统计结果检查了 SWS 的显著性。卡方拟合优度检验也用于评估选择过程的整体性能,即观察到的和预期的后代数量之间的均值差异。因此,整体经验结果和图形表示都支持 SWS 在稳健性、稳定性和有效性方面优于其他竞争对手,通过性能指标(PI)的验证。