文化基因算法在多约束背包问题中的应用.pdfVIP

26 4 计 算 技 术 与 自 动 化 Vol26, No4 2 00 7 12 Computing Technology and utomation Dec. 2 0 0 7 : 1003- 6199(2007) 04- 0061- 03 刘漫丹 ( , 200237) : 文化基因算法是一种启发式算法, 与一些经典数学方法相比, 更适于求解多约 背包问题文 化基因算法是一种基于种群的全局搜索和基于 个体的局部启发式搜索的结合体, 针对多约 问题, 提出采 用贪婪策略通过违反度排序的方法处理多约 条件, 全局搜索采用遗传算法,局部搜索采用模拟退火策略, 解决具有多约 条件的0- 1背包问题通过对几 个实例的求解,表明文化基因算法与标准遗传算法相比, 具有更优的搜索性能 :文化基因算法; 背包问题;遗传算法 :TP301 : A Memetic Algorithm for the Multidimensional Knapsack Problems LIU Mandan (College of Information Science and Technology, East China University of Science and Technology, Shanghai 200237, China) Abstract: Memetic algorithm is one of heuristic algorithms, it is more appropriate for multidimensional knapsack problems than some classical mathematical methods. It is a combination of global search based on populations and local search based on indi viduals. To the multidimensional problems, one approach is proposed using greedy strategy by sorting the degree of contravention, genetic algorithm is used for global search and simulated annealing is used for local search. T he result of solving multidimensional 0 - 1 knapsack problems by memetic algorithm indicates that memetic algorithm can obtain better search performance than normal genetic algorithm. Key words:memetic algorithm; knapsack problems; genetic algorithm , 1 , , NP 2 , , , : ,, n , c ( i = 1, 2, ,