Ant Colony Optimization Algorithm for the 0-1 Knapsack Problem Based on Genetic Operators

摘要：

　　0-1 knapsack problem is a typical combinatorial optimization question in the design and analysis of algorithms.The mathematical description of the knapsack problem is given in theory.The 0-1 knapsack problem is solved by ant colony optimistic algorithm that is improved by introducing genetic operators.To solve the 0-1 knapsack problem with the improved ant colony algorithm,experimental results of numerical simulations,compared with greedy algorithm and dynamic programming algorithm,have shown obvious advantages in efficiency and accuracy on the knapsack problem.

关键词： Knapsack problem Ant colony optimistic algorithm Genetic operators

作者: Zhijun Hu Rong li

作者单位: Department of Computer Science, Xinzhou Teachers University, Xinzhou, China, 034000

会议类型: 国际会议

会议名称: the 2011 International Conference on Frontiers of Manufacturing Science and Measuring Technology (第一届制造科学与检测技术国际会议(ICFMM2011))

会议地点: 重庆

会议语种:英文

页码: 973-977

在线出版日期: 2011-06-23（万方平台首次上网日期，不代表论文的发表时间）