摘要
针对多背包问题,提出一种改进的离散混合蛙跳算法。算法中对青蛙个体采用十进制整数编码方式,应用遗传算法中的交叉操作来对个体进行更新,扩展了传统混合蛙跳算法模型。将改进的算法用于多背包问题求解,仿真实验表明了所提算法的有效性。
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 effient.
出处
《计算机与数字工程》
2011年第9期13-15,共3页
Computer & Digital Engineering
关键词
混合蛙跳算法
多背包问题
组合优化
交叉算子
shuffled frog leaping algorithm（SFLA）, multiple knapsack problem（MKP）, combinatorial optimization, crossover operation
