Binary 100-digit challenge using IEEE-754 coded numerical optimization scenarios (100b-digit) and V-shape binary distance-based success history differential evolution (DISHv)
Aleš Zamuda · Proceedings of the Genetic and Evolutionary Computation Conference Companion · 2019
This paper proposes a new discrete optimization benchmark 100b-Digit, a binary discretized version for the 100-Digit Challenge. The continuous version 100-Digit Challenge utilizing continuous input parameters for a fitness function was suggested for the competitions at 2019 GECCO and 2019 CEC, while this paper proposes an extension, a discrete version of the 100-Digit Challenge, discretizing using an IEEE-754 double precision floating-point representation for the search space variables.