| 一个基于混合蛙跳算法的0/1背包问题算法 |
| |
| 引用本文： | 陈亮.一个基于混合蛙跳算法的0/1背包问题算法[J].洛阳工业高等专科学校学报,2011,21(2). |
| |
| 作者姓名： | 陈亮 |
| |
| 作者单位： | 泰山职业技术学院信息工程系,山东泰安,271000 |
| |
| 摘 要： | 混合蛙跳算法是一种全新的基于群体智能的后启发式计算技术,具有高效的计算性能和优良的全局搜索能力。描述了0/1背包问题的数学模型,阐述了混合蛙跳算法的基本理论,在全局信息交换过程中加入变异操作,改进了混合蛙跳算法,并将该算法应用到0/1背包问题的求解,在实例上的运行结果表明本文方法的可行性和有效性。
|
| 关 键 词： | 背包问题 混合蛙跳算法 |
A SFLA Application in Resolving 0/1 Knapsack Problem |
| |
| CHENG Liang.A SFLA Application in Resolving 0/1 Knapsack Problem[J].Journal of Luoyang Technology College,2011,21(2). |
| |
| Authors: | CHENG Liang |
| |
| Institution: | CHEN Liang(Taishan Vocational Technology College,Taian 271000,China) |
| |
| Abstract: | SFLA is a new post-heuristic computing technology based on group intelligence with highly active calculated performance and search capability.This text presents the mathematical model of 0/1 knapsack problem,expounds the basic procedure of SFLA,then improves the performance of SFLA by using mutation in global information exchange process,and applies the method to resolve 0/1knapsack problem.Practices have proved this method feasible and effective. |
| |
| Keywords: | knapsack problem SFLA |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
