Casado, AlejandraPérez-Peló, SergioSánchez-Oro, JesúsDuarte, Abraham2023-09-192023-09-192022Casado, A., Pérez-Peló, S., Sánchez-Oro, J. et al. A GRASP algorithm with Tabu Search improvement for solving the maximum intersection of k-subsets problem. J Heuristics 28, 121–146 (2022). https://doi.org/10.1007/s10732-022-09490-81572-9397https://hdl.handle.net/10115/24377This research was funded by “Ministerio de Ciencia, Innovación y Universidades” under grant ref. PGC2018-095322-B-C22, “Comunidad de Madrid” and “Fondos Estructurales” of European Union with grant refs. S2018/TCS-4566, Y2018/EMT-5062. Funding Open Access funding provided thanks to the CRUE-CSIC agreement with Springer Nature.The selection of individuals with similar characteristics from a given population have always been a matter of interest in several scientific areas: data privacy, genetics, art, among others. This work is focused on the maximum intersection of k-subsets problem (kMIS). This problem tries to find a subset of k individuals with the maximum number of features in common from a given population and a set of relevant features. The research presents a Greedy Randomized Adaptive Search Procedure (GRASP) where the local improvement is replaced by a complete Tabu Search metaheuristic with the aim of further improving the quality of the obtained solutions. Additionally, a novel representation of the solution is considered to reduce the computational effort. The experimental comparison carefully analyzes the contribution of each part of the algorithm to the final results as well as performs a thorough comparison with the state-of-the-art method. Results, supported by non-parametric statistical tests, confirms the superiority of the proposal.engAtribución 4.0 Internacionalhttp://creativecommons.org/licenses/by/4.0/kMISGRASPTabu searchMetaheuristicsinfo:eu-repo/semantics/article10.1007/s10732-022-09490-8info:eu-repo/semantics/openAccess