{'fraction_non_alphanumeric': 0.036036036036036036, 'fraction_numerical': 0.008008008008008008, 'mean_word_length': 5.7114093959731544, '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}}
On the adoption of Metaheuristics for Solving 0–1 Knapsack Problems

0-1 knapsack problem is a classical Non-deterministic Polynomial Hard (NP-Hard) problem in combinatorial optimization. It has a wide range of applications in real life, such as the distribution of goods in logistics companies, capital calculation, storage, and distribution, etc. This paper studies the adoption of three meta-heuristic approaches for solving the 0–1 knapsack problem. A novel quantum-inspired Tabu Search (QTS) that combines a classical Tabu Search (TS) and Quantum-inspired Evolutionary Algorithm (QEA), Ant Colony swarm intelligence Algorithm (ACO), and Genetic Algorithm (GA) with augmented fitness function. Based on empirical analysis of computer simulations and comparative demonstrations, we show that applying such metaheuristic results in high efficiency in terms of the quality of obtained solutions, computational time, and robustness when dealing with the underlying 0–1 knapsack optimization problem.