计算机工程与应用Issue(14)：70-72,3.DOI:10.3778/j.issn.1002-8331.1208-0450
多选择背包问题的元胞萤火虫算法
Cellular artificial glowworm swarm optimization algorithm for multiple-choice knapsack problem.
摘要
Abstract
In order to solve the multiple-choice knapsack problem, based on the principles of cellular automata and artificial glowworm swarm optimization algorithm, this paper presents a novel cellular artificial glowworm swarm optimization algorithm for multiple-choice knapsack problem. Cellular and its neighbor are introduced into the algorithm to maintain the swarm’s diver-sity and the algorithm uses evolutionary rule of cellular in local optimization to avoid local optima. Simulated tests of multiple-choice knapsack problem and comparisons with other algorithms show the algorithm is feasible and effective and the algorithm has strong global optimization ability.关键词
萤火虫算法/元胞自动机/多选择背包问题/优化Key words
artificial glowworm swarm optimization algorithm/cellular automata/multiple-choice knapsack problem/optimization分类
信息技术与安全科学引用本文复制引用
程魁,马良,刘勇..多选择背包问题的元胞萤火虫算法[J].计算机工程与应用,2013,(14):70-72,3.基金项目
国家自然科学基金（No.70871081）；上海市研究生创新基金项目（No.JWCXSL1202）。 （）
