Constraint handling is one of the most influential aspects of applying metaheuristics to real-world applications, which can hamper the search progress if treated improperly. In this work, we focus on a particular case - the box constraints, for which many boundary constraint handling methods (BCHMs) have been proposed. We call for the necessity of studying the impact of BCHMs on metaheuristics' performance and behavior, which receives seemingly little attention in the field. We target quantifying such impacts through systematic benchmarking by investigating 28 major variants of Differential Evolution (DE) taken from the modular DE framework (by combining different mutation and crossover operators) and $13$ commonly applied BCHMs, resulting in $28 \times 13 = 364$ algorithm instances after pairing DE variants with BCHMs. After executing the algorithm instances on the well-known BBOB/COCO problem set, we analyze the best-reached objective function value (performance-wise) and the percentage of repaired solutions (behavioral) using statistical ranking methods for each combination of mutation, crossover, and BBOB function group. Our results clearly show that the choice of BCHMs substantially affects the empirical performance as well as the number of generated infeasible solutions, which allows us to provide general guidelines for selecting an appropriate BCHM for a given scenario.
翻译:对现实世界应用计量经济学是最有影响力的方面之一,在实际应用中应用计量经济学,如果处理不当,可能会妨碍搜索进展。在这项工作中,我们侧重于一个特定案例,即框框限制,为此提出了许多边界限制处理方法(BCHMs),我们呼吁必须研究BCHMs对计量经济学业绩和行为的影响,在外地似乎很少受到注意。我们的目标是通过系统基准来量化这些影响,方法是通过调查从模块化框架(DE)中取出的28种差异演化(DE)主要变异(通过将不同的变异和交叉操作者合并)和通常应用的13美元BCHMs,结果导致28\时间13=364美元的算法例,然后将DE变量与BCHMs配对。在著名的BBBB/CO问题集执行算法后,我们分析了最接近的目标函数值(业绩)和修复解决方案(bhavioral)的百分比,方法是使用组合、交叉和BBBBBB函数组的统计分级方法,我们的结果清楚地表明BCHMA选择了一种适当的业绩,这是我们所选择的大致选择的一种做法。