Search Results for author:
Found 7 papers, 0 papers with code
Finding Near-Optimal Portfolios With Quality-Diversity
In this paper, we present a novel approach for finding a diverse set of such portfolios based on quality-diversity (QD) optimization.
Automated design of relocation rules for minimising energy consumption in the container relocation problem
Relocation rules (RRs), which consist of a priority function and relocation scheme, are heuristics commonly used for solving the mentioned problem due to their flexibility and efficiency.
On Evolvability and Behavior Landscapes in Neuroevolutionary Divergent Search
Finally, a novel definition of evolvability that takes into account the evolvability of offspring and is appropriate for use with discretized behavior spaces is proposed, together with a Markov-chain-based estimation method for it.
A Search for Nonlinear Balanced Boolean Functions by Leveraging Phenotypic Properties
In the context of the underlying problem, the phenotypes are represented by Walsh-Hadamard spectra of the candidate solutions (Boolean functions).
Novel ensemble collaboration method for dynamic scheduling problems
In this method, DRs are applied independently at each decision point to create a simulation of the schedule for all currently released jobs.
Building the Building Blocks: From Simplification to Winning Trees in Genetic Programming
The winning trees can be used to initialize the population for the new GP run and result in improved convergence and fitness, provided some conditions on the size of solutions and winning trees are fulfilled.
Heuristic and Metaheuristic Methods for the Unrelated Machines Scheduling Problem: A Survey
The unrelated parallel machines scheduling problem (UPMSP), which is only one of the many different problem types that exist, found its application in many areas like production industries or distributed computing.
