计算机与数字工程2011，Vol.39Issue(9)：13-15,3.
求解多背包问题的混合蛙跳算法
Shuffled Frog Leaping Algorithm for Solving Multiple Knapsack Problem
马竹根 1舒少华2
作者信息
- 1. 怀化学院计算机科学与技术系 怀化418008
- 2. 中方县职业中等专业学校 怀化418000
- 折叠
摘要
Abstract
A Discrete Shuffled Frog Leaping Algorithm is proposed to solve the Multiple Knapsack Problem. The algorithm adopts integer coded scheme and a new method of individual production by crossover operation to extend the traditional model of Shuffled Frog Leaping Algorithm. The experimental results show that the proposed algorithm is effective and ef-fient.关键词
混合蛙跳算法/多背包问题/组合优化/交叉算子Key words
shuffled frog leaping algorithm(SFLA)/multiple knapsack problem(MKP)/combinatorial optimization,crossover operation分类
信息技术与安全科学引用本文复制引用
马竹根,舒少华..求解多背包问题的混合蛙跳算法[J].计算机与数字工程,2011,39(9):13-15,3.
