Examinar Artículos, Comunicaciones, Libros por departamento (eus.) "Konputazio Zientzia eta Adimen Artifiziala"
Now showing items 1-3 of 3
-
A Tunable Generator of Instances of Permutation-Based Combinatorial Optimization Problems
(2016-04)[EN]In this paper, we propose a tunable generator of instances of permutation-based Combinatorial Optimization Problems. Our approach is based on a probabilistic model for permutations, called the Generalized Mallows model. ... -
An Evaluation of Methods for Estimating the Number of Local Optima in Combinatorial Optimization Problems
(MIT Press, 2013-11-01)[EN] The solution of many combinatorial optimization problems is carried out by metaheuristics, which generally make use of local search algorithms. These algorithms use some kind of neighborhood structure over the search ... -
Multi-Start Methods
(Springer, 2018-08-27)[EN]Multi-start procedures were originally conceived as a way to exploit a local or neighborhood search procedure, by simply applying it from multiple random initial solutions. Modern multi-start methods usually incorporate ...