Benchmarking Parameter Control Methods in Differential Evolution for Mixed-Integer Black-Box Optimization
Differential evolution (DE) generally requires parameter control methods (PCMs) for the scale factor and crossover rate. Although a better understanding of PCMs provides a useful clue to designing an efficient DE, their effectiveness is poorly understood in mixed-integer black-box optimization. In this context, this paper benchmarks PCMs in DE on the mixed-integer black-box optimization benchmarking function (bbob-mixint) suite in a component-wise manner. First, we demonstrate that the best PCM significantly depends on the combination of the mutation strategy and repair method. Although the PCM of SHADE is state-of-the-art for numerical black-box optimization, our results show its poor performance for mixed-integer black-box optimization. In contrast, our results show that some simple PCMs (e.g., the PCM of CoDE) perform the best in most cases. Then, we demonstrate that a DE with a suitable PCM performs significantly better than CMA-ES with integer handling for larger budgets of function evaluations. Finally, we show how the adaptation in the PCM of SHADE fails.
Code (1)
Tasks
BenchmarkingSimilar Papers 제목 키워드 기반
Reviewing and Benchmarking Parameter Control Methods in Differential Evolution
Many Differential Evolution (DE) algorithms with various parameter control methods (PCMs) have been proposed. However, previous studies usually considered PCMs to be an integral component of a complex DE algorithm. Thus …
BenchmarkingLearning adaptive differential evolution algorithm from optimization experiences by policy gradient
Differential evolution is one of the most prestigious population-based stochastic optimization algorithm for black-box problems. The performance of a differential evolution algorithm depends highly on its mutation and cr…
Evolutionary AlgorithmsStochastic OptimizationPatterns of Convergence and Bound Constraint Violation in Differential Evolution on SBOX-COST Benchmarking Suite
This study investigates the influence of several bound constraint handling methods (BCHMs) on the search process specific to Differential Evolution (DE), with a focus on identifying similarities between BCHMs and groupin…
BenchmarkingSEvoBench : A C++ Framework For Evolutionary Single-Objective Optimization Benchmarking
We present SEvoBench, a modern C++ framework for evolutionary computation (EC), specifically designed to systematically benchmark evolutionary single-objective optimization algorithms. The framework features modular impl…
BenchmarkingComputational EfficiencyBenchmarking Differential Evolution on a Quantum Simulator
The use of Evolutionary Algorithms (EA) for solving Mathematical/Computational Optimization Problems is inspired by the biological processes of Evolution. Few of the primitives involved in the Evolutionary process/paradi…
BenchmarkingEvolutionary Algorithms