Clustering-Based Binarization Methods Applied to the Crow Search Algorithm for 0/1 Combinatorial Problems

Abstract

<jats:p>Metaheuristics are smart problem solvers devoted to tackling particularly large optimization problems. During the last 20 years, they have largely been used to solve different problems from the academic as well as from the real-world. However, most of them have originally been designed for operating over real domain variables, being necessary to tailor its internal core, for instance, to be effective in a binary space of solutions. Various works have demonstrated that this internal modification, known as binarization, is not a simple task, since the several existing binarization ways may lead to very different results. This of course forces the user to implement and analyze a large list of binarization schemas for reaching good results. In this paper, we explore two efficient clustering methods, namely KMeans and DBscan to alter a metaheuristic in order to improve it, and thus do not require on the knowledge of an expert user for identifying which binarization strategy works better during the run. Both techniques have widely been applied to solve clustering problems, allowing us to exploit useful information gathered during the search to efficiently control and improve the binarization process. We integrate those techniques to a recent metaheuristic called Crow Search, and we conduct experiments where KMeans and DBscan are contrasted to 32 different binarization methods. The results show that the proposed approaches outperform most of the binarization strategies for a large list of well-known optimization instances.</jats:p>

Intelligent Learning-Based Methods for Determining the Ideal Team Size in Agile Practices

“…Several works analyze how metaheuristics are improved using machine learning, regression, and clustering techniques [25][26][27][28]. In [29], a machine learning model that predicts solution quality for a given instance is created using the support vector machine.…”

Q-Learnheuristics: Towards Data-Driven Balanced Metaheuristics

“…There is a parameter a that is reduced from 2 to 0 to provide changes between exploration and exploitation. When the equation vector (29) has value: | − → A | ≥ 1, a new random search agent is chosen. On the other hand, when | − → A | < 1, the best solution is selected; the point of this is to be able to update the position of the search agents.…”

“…Supervised techniques learn from labeled data to infer future samples in the form of classification or regression [27]. Unsupervised techniques consider unlabeled data to find clusters or patterns with usual algorithms as k-means [28], dbscan [29] or BIRCH [30]. Semisupervised techniques share features of supervised and unsupervised learning, resulting in a hybrid approach in which labeled data are managed in a supervised manner while unlabeled data are managed in an unsupervised manner [31].…”

A Knowledge-Based Hybrid Approach on Particle Swarm Optimization Using Hidden Markov Models

“…A similar work can be seen in [66]. Clustering techniques were studied for the exploration of the search space [67] and for dynamic binarization strategies on combinatorial problems [68]. In [69], case-based reasoning techniques were investigated to the identify sub-spaces of searches to solve a combinatorial problem.…”

“…Table 3 shows the results obtained by our proposal and the original PSO in 11 hard instances of the set covering problem [68]. Each instance was executed 31 times and each run iterated 1000 cycles.…”