【摘要】 针对多维0-1背包问题,通过应用贪心法和二分搜索法的思想,本文提出了一种新的杂交算子———中值杂交,并且基于此算子提出了求解多维0-1背包问题的一种改进的遗传算法。最后本文通过一系列数值实验,把改进算法与传统的遗传算法以及其他最新的遗传算法进行比较,经过对求得近似解的精度及计算所需时间两方面的对比,验证了其有效性。更多还原

【Abstract】 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.更多还原