{'fraction_non_alphanumeric': 0.019895287958115182, 'fraction_numerical': 0.0062827225130890054, 'mean_word_length': 5.2894736842105265, '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}}
Effective Learning-Based Hybrid Search for Bandwidth Coloring

The bandwidth coloring problem (BCP) and the bandwidth multicoloring problem (BMCP) are two important generalizations of the classical vertex coloring problem. This paper presents learning-based hybrid search (LHS) for BCP and BMCP. LHS combines a construction phase to progressively build feasible (partial) colorings and a local search phase to reestablish feasibility when an illegal partial solution is encountered. The construction phase relies on a learning-based guiding function to determine the next vertex for color assignment while the local search phase uses a tabu search repair procedure to resolve coloring conflicts. Experiments on a set of 33 well-known benchmarks for BCP and a set of 33 benchmarks for BMCP demonstrate that the proposed LHS approach can match the best known solution for most benchmarks. In particular, LHS finds an improved best solution for 14 instances.