A review of distances for the Mallows and Generalized Mallows estimation of distribution algorithms
The Mallows (MM) and the Generalized Mallows (GMM) probability models have
demonstrated their validity in the framework of Estimation of distribution algorithms (EDAs) …
demonstrated their validity in the framework of Estimation of distribution algorithms (EDAs) …
Multiobjective decomposition-based mallows models estimation of distribution algorithm. A case of study for permutation flowshop scheduling problem
Estimation of distribution algorithms (EDAs) have become a reliable alternative to solve a
broad range of single and multi-objective optimization problems. Recently, distance-based …
broad range of single and multi-objective optimization problems. Recently, distance-based …
Bayesian optimization for parameter tuning in evolutionary algorithms
Advances in evolutionary computation have demonstrated that Evolutionary Algorithms
(EAs) proposed in this area are a solid alternative for solving combinatorial and continuous …
(EAs) proposed in this area are a solid alternative for solving combinatorial and continuous …
Kernels of mallows models under the hamming distance for solving the quadratic assignment problem
Abstract The Quadratic Assignment Problem (QAP) is a well-known permutation-based
combinatorial optimization problem with real applications in industrial and logistics …
combinatorial optimization problem with real applications in industrial and logistics …
Mallows and generalized Mallows model for matchings
Mallows and generalized Mallows model for matchings Page 1 Bernoulli 25(2), 2019, 1160–1188
https://doi.org/10.3150/17-BEJ1017 Mallows and generalized Mallows model for matchings …
https://doi.org/10.3150/17-BEJ1017 Mallows and generalized Mallows model for matchings …
Sampling and learning distance-based probability models for permutation spaces
E Irurozki - 2014 - dialnet.unirioja.es
Esta tesis est¿ a dedicada al aprendizaje y muestreo de los modelos de probabilidadsobre
permutaciones basados en distancias. En concreto, las distancias consideradasson la¿ de …
permutaciones basados en distancias. En concreto, las distancias consideradasson la¿ de …
A random key based estimation of distribution algorithm for the permutation flowshop scheduling problem
Random Key (RK) is an alternative representation for permutation problems that enables
application of techniques generally used for continuous optimisation. Although the benefit of …
application of techniques generally used for continuous optimisation. Although the benefit of …
Kernels of mallows models for solving permutation-based problems
Recently, distance-based exponential probability models, such as Mallows and Generalized
Mallows, have demonstrated their validity in the context of estimation of distribution …
Mallows, have demonstrated their validity in the context of estimation of distribution …
Multi-objectivising combinatorial optimisation problems by means of elementary landscape decompositions
In the last decade, many works in combinatorial optimisation have shown that, due to the
advances in multi-objective optimisation, the algorithms from this field could be used for …
advances in multi-objective optimisation, the algorithms from this field could be used for …
Rank aggregation using latent-scale distance-based models
Rank aggregation aims at combining rankings of a set of items assigned by a sample of
rankers to generate a consensus ranking. A typical solution is to adopt a distance-based …
rankers to generate a consensus ranking. A typical solution is to adopt a distance-based …