{'fraction_non_alphanumeric': 0.013289036544850499, 'fraction_numerical': 0.0, 'mean_word_length': 5.503597122302159, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Extending the Hybridization of Metaheuristics with Data Mining to a Broader Domain

The incorporation of data mining techniques into metaheuristics has been efficiently adopted to solve several optimization problems. Nevertheless, we observe in the literature that this hybridization has been limited to problems for which the solutions are characterized for sets of elements. In this work, we develop a hybrid data mining metaheuristic based on GRASP and VND to solve the one-commodity pickup-and-delivery traveling salesman, a problem for which solutions are defined by sequences of elements. This way, we extend the domain of combinatorial optimization problems which can benefit from the combination of data mining and metaheuristic. Computational experiments showed that this hybridization with data mining process improves the pure algorithm both in average quality of solution and execution time.