In gray-box optimization, the search algorithms have access to the variable interaction graph
(VIG) of the optimization problem. For Mk Landscapes (and NK Landscapes) we can use the …

The concept of gray-box optimization, in juxtaposition to black-box optimization, revolves
about the idea of exploiting the problem structure to implement more efficient evolutionary …

We design, develop and analyze parallel variants of a state-of-the-art graybox optimization
algorithm, namely Drils (Deterministic Recombination and Iterated Local Search), for …

Designed for graybox optimization problems, the state-of-the-art Drils algorithm
(Deterministic Recombination and Iterated Local Search) follows the framework of a hybrid …

Efficient hill climbers have been recently proposed for single-and multi-objective pseudo-
Boolean optimization problems. For k-bounded pseudo-Boolean functions where each …

Specialized graybox local search and crossover have been successfully combined within
the framework of the so-called Drils (Deterministic recombination and iterated local search) …

Examining the properties of local optima is a common method for understanding
combinatorial-problem landscapes. Unfortunately, exhaustive algorithms for finding local …

Local search algorithms and iterated local search algorithms are a basic technique. Local
search can be a stand-alone search method, but it can also be hybridized with evolutionary …

In this work, we explore efficient parallelization methods for the Parameter-less Population
Pyramid (P3) and show their computational effectiveness. First, in this paper, we present one …

In gray-box optimization, the search algorithms have access to the variable interaction graph
(VIG) of the optimization problem. For Mk Landscapes (and NK Landscapes) we can use the …