Search Results for author:
Found 7 papers, 0 papers with code
On the Fitness Landscapes of Interdependency Models in the Travelling Thief Problem
Since its inception in 2013, the Travelling Thief Problem (TTP) has been widely studied as an example of problems with multiple interconnected sub-problems.
Multi-layer local optima networks for the analysis of advanced local search-based algorithms
A Local Optima Network (LON) is a graph model that compresses the fitness landscape of a particular combinatorial optimization problem based on a specific neighborhood operator and a local search algorithm.
MATE: A Model-based Algorithm Tuning Engine
In contrast to most static (feature-independent) algorithm tuning engines such as irace and SPOT, our approach aims to derive the best parameter configuration of a given algorithm for a specific problem, exploiting the relationships between the algorithm parameters and the features of the problem.
A study of problems with multiple interdependent components - Part I
In fact, a PMIC can be considered simply as a single optimisation problem and the dependencies between components could be investigated by studying the decomposability of the problem and the correlations between the sub-problems.
On resampling vs. adjusting probabilistic graphical models in estimation of distribution algorithms
This step should be completed at each iteration of BOA, resulting in a very time-consuming process.
Étude de Problèmes d'Optimisation Combinatoire à Multiples Composantes Interdépendantes
This extended abstract presents an overview on NP-hard optimization problems with multiple interdependent components.
Cosolver2B: An Efficient Local Search Heuristic for the Travelling Thief Problem
Real-world problems are very difficult to optimize.
