Search Results for author:
Found 7 papers, 1 papers with code
Where the Really Hard Quadratic Assignment Problems Are: the QAP-SAT instances
The Quadratic Assignment Problem (QAP) is one of the major domains in the field of evolutionary computation, and more widely in combinatorial optimization.
A Fitness Landscape View on the Tuning of an Asynchronous Master-Worker EA for Nuclear Reactor Design
In the context of the introduction of intermittent renewable energies, we propose to optimize the main variables of the control rods of a nuclear power plant to improve its capability to load-follow.
Paradiseo: From a Modular Framework for Evolutionary Computation to the Automated Design of Metaheuristics ---22 Years of Paradiseo---
The success of metaheuristic optimization methods has led to the development of a large variety of algorithm paradigms.
An Analysis on Selection for High-Resolution Approximations in Many-Objective Optimization
This work studies the behavior of three elitist multi- and many-objective evolutionary algorithms generating a high-resolution approximation of the Pareto optimal set.
On the Impact of Multiobjective Scalarizing Functions
Recently, there has been a renewed interest in decomposition-based approaches for evolutionary multiobjective optimization.
Local Optimal Sets and Bounded Archiving on Multi-objective NK-Landscapes with Correlated Objectives
Such local search algorithms typically return a set of mutually nondominated Pareto local optimal (PLO) solutions, that is, a PLO-set.
Local Optima Networks: A New Model of Combinatorial Fitness Landscapes
This chapter overviews a recently introduced network-based model of combinatorial landscapes: Local Optima Networks (LON).
