Listar por autor "Ochoa, Gabriela"
Mostrando ítems 1-9 de 9
-
The cartography of computational search spaces
(2018-05-04)This talk will present our recent findings and visual (static and animated) maps characterising combinatorial and computer program search spaces. We seek to lay the foundations for a new perspective to understand problem ... -
Dynastic Potential Crossover Operator
An optimal recombination operator for two parent solutions provides the best solution among those that take the value for each variable from one of the parents (gene transmission property). If the solutions are bit strings, ... -
Enhancing partition crossover with articulation points analysis
Partition Crossover is a recombination operator for pseudo-Boolean optimization with the ability to explore an exponential number of solutions in linear or square time. It decomposes the objective function as a sum of ... -
Generalizing and Unifying Gray-box Combinatorial Optimization Operators.
Gray-box optimization leverages the information available about the mathematical structure of an optimization problem to design efficient search operators. Efficient hill climbers and crossover operators have been proposed ... -
Local Optima Network Analysis for MAX-SAT
Ochoa, Gabriela; Chicano-García, José-Francisco
(2019-07-22)
Local Optima Networks (LONs) are a valuable tool to understand fitness landscapes of optimization problems observed from the perspective of a search algorithm. Local optima of the optimization problem are linked by an edge ... -
Local Optima Networks, Landscape Autocorrelation and Heuristic Search Performance
Chicano-García, José-Francisco; Daolio, Fabio; Ochoa, Gabriela; Verel, Sébastien; Tomassini, Marco; Alba-Torres, Enrique[et al.] (2014-10-06)
Recent developments in fitness landscape analysis include the study of Local Optima Networks (LON) and applications of the Elementary Landscapes theory. This paper represents a first step at combining these two tools to ... -
Optimizing One Million Variable NK Landscapes by Hybridizing Deterministic Recombination and Local Search
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 VIG to identify an improving solution ... -
Quasi-Optimal Recombination Operator
The output of an optimal recombination operator for two parent solutions is a solution with the best possible value for the objective function among all the solutions fulfilling the gene transmission property: the value ... -
The component model for elementary landscapes and partial neighborhoods
Whitley, L. Darrell; Sutton, Andrew M.; Ochoa, Gabriela; Chicano-García, José-Francisco (2014-09-29)
Local search algorithms exploit moves on an adjacency graph of the search space. An “elementary landscape” exists if the objective function f is an eigenfunction of the Laplacian of the graph induced by the neighborhood ...