Now showing items 1-3 of 3
Extending Distance-based Ranking Models In Estimation of Distribution Algorithms
Recently, probability models on rankings have been proposed in the field of estimation of distribution algorithms in order to solve permutation-based combinatorial optimisation problems. Particularly, distance-based ranking ...
A review on Estimation of Distribution Algorithms in Permutation-based Combinatorial Optimization Problems
Estimation of Distribution Algorithms (EDAs) are a set of algorithms that belong to the field of Evolutionary Computation. Characterized by the use of probabilistic models to represent the solutions and the dependencies ...
Sampling and learning the Mallows model under the Ulam distance
[EN]In this paper we deal with probability distributions over permutation spaces. The Probability model in use is the Mallows model. The distance for permutations that the model uses in the Ulam distance.