- RIUMA Principal
- Listar por autor
Listar por autor "Whitley, L. Darrell"
Mostrando ítems 1-16 de 16
-
A methodology to find the elementary landscape decomposition of combinatorial optimization problems
A small number of combinatorial optimization problems have search spaces that correspond to elementary landscapes, where the objective function f is an eigenfunction of the Laplacian that describes the neighborhood structure ... -
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, ... -
Efficient Hill Climber for Constrained Pseudo-Boolean Optimization Problems
Chicano-García, José-Francisco; Whitley, L. Darrell; Tinós, Renato (2016-09-09)Efficient hill climbers have been recently proposed for single- and multi-objective pseudo-Boolean optimization problems. For $k$-bounded pseudo-Boolean functions where each variable appears in at most a constant number ... -
Efficient Hill Climber for Multi-Objective Pseudo-Boolean Optimization
Chicano-García, José-Francisco; Whitley, L. Darrell; Tinós, Renato (2016-04-06)Local search algorithms and iterated local search algorithms are a basic technique. Local search can be a stand-alone search method, but it can also be hybridized with evolutionary algorithms. Recently, it has been shown ... -
Efficient identification of improving moves in a ball for Pseudo-Boolean problems
Chicano-García, José-Francisco; Whitley, L. Darrell; Sutton, Andrew M. (2014-06-27)Hill climbing algorithms are at the core of many approaches to solve optimization problems. Such algorithms usually require the complete enumeration of a neighborhood of the current solution. In the case of problems defined ... -
Elementary landscape decomposition of the frequency assignment problem
Chicano-García, José-Francisco; Whitley, L. Darrell; Alba-Torres, Enrique; Luna, Francisco (2014-09-30)The Frequency Assignment Problem (FAP) is an important problem that arises in the design of radio networks, when a channel has to be assigned to each transceiver of the network. This problem is a generalization of the graph ... -
Elementary Landscape Decomposition of the Hamiltonian Path Optimization Problem
Whitley, L. Darrell; Chicano-García, José-Francisco (2014-04-04)There exist local search landscapes where the evaluation function is an eigenfunction of the graph Laplacian that corresponds to the neighborhood structure of the search space. Problems that dis- play this structure are ... -
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 ... -
Exact computation of the expectation curves for uniform crossover
Uniform crossover is a popular operator used in genetic algorithms to combine two tentative solutions of a problem represented as binary strings. We use the Walsh decomposition of pseudo-Boolean functions and properties ... -
Exact computation of the expectation surfaces for uniform crossover along with bit-flip mutation
Uniform crossover and bit-flip mutation are two popular operators used in genetic algorithms to generate new solutions in an iteration of the algorithm when the solutions are represented by binary strings. We use the Walsh ... -
Fitness function distributions over generalized search neighborhoods in the q-ary hypercube
Sutton, Andrew M.; Chicano-García, José-Francisco; Whitley, L. Darrell (2014-10-03)The frequency distribution of a fitness function over regions of its domain is an important quantity for understanding the behavior of algorithms that employ randomized sampling to search the function. In general, exactly ... -
NK Hybrid Genetic Algorithm for Clustering
The NK hybrid genetic algorithm for clustering is proposed in this paper. In order to evaluate the solutions, the hybrid algorithm uses the NK clustering validation criterion 2 (NKCV2). NKCV2 uses information about the ... -
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-elementary Landscapes and Superpositions of Elementary Landscapes
Whitley, L. Darrell; Chicano-García, José-Francisco (2014-10-07)There exist local search landscapes where the evaluation function is an eigenfunction of the graph Laplacian that corresponds to the neighborhood structure of the search space. Problems that display this structure are ... -
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 ...