{'fraction_non_alphanumeric': 0.020673813169984685, 'fraction_numerical': 0.0015313935681470138, 'mean_word_length': 5.567839195979899, '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}}
Competitive decision algorithm for multidimensional knapsack problem

The multidimensional knapsack problem (MKP) is a classified NP-hard optimization problem, which is a generalisation of the 0–1 simple knapsack problem(KP). It consists in selecting a subset of given items in such a way that the total profit of the selected items is maximized while a set of knapsack constraints are satisfied.The MKP is resource allocation model that is one of the most well-known integer programming problems. It often appears in decision making and programming, resource distribution, loading, and so on. For solving this problem, many algorithms such as simulated annealing, genetic algorithm, ant colony algorithm, and other heuristic algorithms have been proposed by scholars. Based on some properties of multidimensional knapsack problem, a competitive decision algorithm(CDA) for MKP is proposed. Competitive decision algorithm is a new optimization algorithm based on the analysis of the mechanism of natural competitions and the principle of decision. It uses the characteristics that competition builds optimization and the result of competition hinges on decision. We use this algorithm to solve many test instances of multidimensional knapsack problems and computational result results in good performances.