{'fraction_non_alphanumeric': 0.011424219345011425, 'fraction_numerical': 0.0015232292460015233, 'mean_word_length': 5.7384615384615385, '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}}
A differential evolution algorithm with variable neighborhood search for multidimensional knapsack problem

This paper presents a differential evolution algorithm with a variable neighborhood search to solve the multidimensional knapsack problem. Unlike the studies employing check and repair operators, we employ some sophisticated constraint handling methods to enrich the population diversity by taking advantages of infeasible solution within a predetermined threshold. We propose to a variable neighborhood search employing different mutation strategies to generate the trial population. The proposed algorithm in fact works on a continuous domain, but these real-values are converted to 0-1 binary values by using the sigmoid function. In order to enhance the solution quality, the differential evolution algorithm with a variable neighborhood search is combined with a binary swap local search algorithm. To the best of our knowledge, this is the first reported application of the differential evolution algorithm to solve the multidimensional knapsack problem in the literature. The proposed algorithm is tested on a benchmark instances from the OR-Library. Computational results show its efficiency in solving benchmark instances and its superiority to the best performing algorithms from the literature.