计算机工程与应用Issue(9)：54-56,80,4.DOI:10.3778/j.issn.1002-8331.1112-0558
改进型遗传蚁群混合算法求解0/1背包问题
Modified genetic ant colony hybrid algorithms for solving 0/1 knapsack
摘要
Abstract
To overcome the problems of searching speed and running time of traditional genetic and ant colony hybrid algo-rithm, an improved algorithm is proposed. In this algorithm, the better part of ants, whose number is adaptively changed with iterative generation, is selected to optimization by the genetic algorithm, meanwhile, some improvements at crossover operation, mutation operation and evaluation of traditional algorithm are proposed. The simulation results show that this algorithm is improved at searching capability, convergence speed and program running time.关键词
0/1 背包问题/遗传算法/蚁群算法/混合方式/算法策略Key words
0/1 knapsack problem/genetic algorithm/ant colony algorithm/hybrid mode/algorithm strategy分类
信息技术与安全科学引用本文复制引用
王娜,向凤红,毛剑琳..改进型遗传蚁群混合算法求解0/1背包问题[J].计算机工程与应用,2013,(9):54-56,80,4.基金项目
云南省应用基础研究基金(No.2009ZC050M) （No.2009ZC050M）
云南省教育厅科学研究基金(No.08Y0093) （No.08Y0093）
