• The cartography of computational search spaces 

      Ochoa, Gabriela (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 ...
    • Enhancing partition crossover with articulation points analysis 

      Chicano, Francisco; Ochoa, Gabriela; Whitley, Darrell; Tinós, Renato (2018-07-25)
      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 ...
    • Local Optima Network Analysis for MAX-SAT 

      Ochoa, Gabriela; Chicano, 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, Francisco; Daolio, Fabio; Ochoa, Gabriela; Vérel, Sébastien; Tomassini, Marco; [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 ...
    • Quasi-Optimal Recombination Operator 

      Chicano, Francisco; Ochoa, Gabriela; Whitley, Darrell; Tinós, Renato (2019-07-22)
      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, Darrell; Sutton, Andrew M.; Ochoa, Gabriela; Chicano, 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 ...