{'fraction_non_alphanumeric': 0.022644927536231884, 'fraction_numerical': 0.0018115942028985507, 'mean_word_length': 5.616766467065868, '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}}
Hybrid binary wolf pack algorithm for the 0-1 multidimensional knapsack problem

Wolf Pack Algorithm (WPA) has been successfully applied in unconstrained global optimisation problems. In order to effectively solve the multi-constrained combinatorial optimisation problem such as Multidimensional Knapsack Problem (MKP), a hybrid repair operator based on its specific knowledge is designed to repair and improve the infeasible solutions. Moreover, inspired by the reproductive modes of wolf pack, with the help of binary code, a Hybrid Binary Wolf Pack Algorithm (HBWPA) is proposed. Then HBWPA was tested on problems from the OR-Library to validate and demonstrate the efficiency of the proposed algorithm. The results were compared with those obtained by other two start-of-the-art existing algorithms, modified binary particle swarm optimisation and chaotic binary swarm optimisation with time-varying acceleration coefficients. Experimental results show that the proposed algorithm not only found comparable solutions for the standard MKP of different size, but also has good computational robustness.