A Binary Machine Learning Cuckoo Search Algorithm Improved by a Local Search Operator for the Set-Union Knapsack Problem

Abstract

Optimization techniques, specially metaheuristics, are constantly refined in order to decrease execution times, increase the quality of solutions, and address larger target cases. Hybridizing techniques are one of these strategies that are particularly noteworthy due to the breadth of applications. In this article, a hybrid algorithm is proposed that integrates the k-means algorithm to generate a binary version of the cuckoo search technique, and this is strengthened by a local search operator. The binary cuckoo search algorithm is applied to the NP-hard Set-Union Knapsack Problem. This problem has recently attracted great attention from the operational research community due to the breadth of its applications and the difficulty it presents in solving medium and large instances. Numerical experiments were conducted to gain insight into the contribution of the final results of the k-means technique and the local search operator. Furthermore, a comparison to state-of-the-art algorithms is made. The results demonstrate that the hybrid algorithm consistently produces superior results in the majority of the analyzed medium instances, and its performance is competitive, but degrades in large instances.

B-PSA: A Binary Pendulum Search Algorithm for the Feature Selection Problem

“…However, as indicated by authors in [6], there are different ways to binarize continuous metaheuristics. Such as different transfer functions (U-shaped [36], O-Shaped [37], X-Shaped [38], Z-Shaped [39], time-varying S-Shaped [40] and time-vatying V-Shaped [41]), other binarization rules [33], clustering-based binarization techniques [42] or even binarization supported by machine learning techniques such as Q-Learning [43] or SARSA [44]. The No Free Lunch Theorem [45] tells us that there is no algorithm capable of reaching the global optimum of all existing optimization problems.…”

Optimization Method of RFID Reader Antenna Deployment in Obstacle Environment Based on Improved FA

“…e presented method performs effectively better in reducing the time span using a different numbers of tasks and virtual machines. Reference [22] proposes a hybrid algorithm that integrates the K-means algorithm to produce a binary cuckoo search technique and a new local search operator to improve the utilization of the search space. Reference [23] evaluated a hybrid algorithm that improved the resource allocation results of the quantum cuckoo search algorithm using the k-nearest neighbor technique and applied it to the well-known multidimensional backpack problem.…”

Exploring Initialization Strategies for Metaheuristic Optimization: Case Study of the Set-Union Knapsack Problem

“…Aligning with the process of solution initialization, this paper proposes various strategies for initializing solutions, incorporating these strategies into a discrete hybrid algorithm detailed in [11]. This algorithm merges the concept of k-means with metaheuristics and is applied to the set union knapsack problem (SUKP).…”