An Improved Genetic Algorithm for the Multidimensional 0-1 Knapsack Problem
求解多维0-1背包问题的一种改进的遗传算法

This paper proposes a new crossover operator which is called median crossover. It is designed by using the ideas of the greedy algorithm and the 2- division search algorithm, and aims at the multidimensional 0-1 knapsack problem. Based on this median crossover operator, the paper also presents an improved genetic algorithm for solving the multidimensional 0-1 knapsack problem. Furthermore, the efficiency of the presented method is investigated by comparing it with the traditional simple genetic algorithm and other latest methods, in respect of the accuracy of an approximate solution and the processing time through series of numerical experiments.