A previous work explores a Multi-Objective Subset Selection algorithm, denominated the Pareto Front Elite, to induce classifiers. These classifiers are composed by a set of rules selected following Pareto dominance concepts and forming unordered classifiers. These rules are previously created by an association rule algorithm. The performance of the classifiers induced were compared with other well known rule induction algorithms using the area under the ROC curve. The area under the ROC curve (AUC) is considered a relevant criterion to deal with imbalanced data, misclassification costs and noisy data. The results show that the Pareto Front Elite algorithm is comparable to the best known techniques. In this paper we explore multi-objective meta-heuristic approach to create rules and to build the Pareto Front using the sensitivity and specificity criteria, the chosen Metaheuristic is a Greedy Randomized Adaptive Search Procedure (GRASP) with path-relinking. We perform an experimental study to compare the two algorithms: one based on a complete set of rules, and the other based on Metaheuristic Approach. In this study we analyze the classification results, through the AUC criterion, and the Pareto Front coverage produced by each algorithm.