{'fraction_non_alphanumeric': 0.017333333333333333, 'fraction_numerical': 0.0026666666666666666, 'mean_word_length': 5.418803418803419, '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}}
Variable Neighborhood Search for Solving the Capacitated Single Allocation Hub Location Problem

In this paper a Variable Neighborhood Search (VNS) algorithm for solving the Capacitated Single Allocation Hub Location Problem(CSAHLP) is presented. CSAHLP consists of two subproblems; the first ischoosing a set of hubs from all nodes in a network, while the other comprises finding the optimal allocation of non-hubs to hubs when a set of hubsis already known. The VNS algorithm was used for the first subproblem,while the CPLEX solver was used for the second. Computational resultsdemonstrate that the proposed algorithm has reached optimal solutions onall 20 test instances for which optimal solutions are known, and this in shortcomputational time.