Y Zhou, JK Hao, B Duval - Expert Systems with Applications, 2016 - Elsevier
Grouping problems aim to partition a set of items into multiple mutually disjoint subsets according to some specific criterion and constraints. Grouping problems cover a large class …
Abstract The Linear Ordering Problem is a popular combinatorial optimisation problem which has been extensively addressed in the literature. However, in spite of its popularity …
J Ceberio, V Santucci - ACM Transactions on Evolutionary Learning and …, 2023 - dl.acm.org
Global random search algorithms are characterized by using probability distributions to optimize problems. Among them, generative methods iteratively update the distributions by …
The anonymity and high security of the Tor network allow it to host a significant amount of criminal activities. Some Tor domains attract more traffic than others, as they offer better …
The challenges of solving problems naturally represented as permutations by Estimation of Distribution Algorithms (EDAs) have been a recent focus of interest in the evolutionary …
The Mallows (MM) and the Generalized Mallows (GMM) probability models have demonstrated their validity in the framework of Estimation of distribution algorithms (EDAs) …
V Santucci, J Ceberio - Proceedings of the Genetic and Evolutionary …, 2023 - dl.acm.org
Problems with solutions represented by permutations are very prominent in combinatorial optimization. Thus, in recent decades, a number of evolutionary algorithms have been …