| 改进的遗传算法求解背包问题 |
| |
| 引用本文： | 牛慧兰,刘源,朱海笑,刘小慧.改进的遗传算法求解背包问题[J].电子科技,2014,27(10):67-70. |
| |
| 作者姓名： | 牛慧兰 刘源 朱海笑 刘小慧 |
| |
| 作者单位： | (兰州交通大学 交通运输学院,甘肃 兰州 730070) |
| |
| 摘 要： | 为提高遗传算法在解决背包问题时的局部搜索能力,在遗传算法中加入禁忌搜索的思想,用遗传算法做全局搜索,禁忌搜索辅助做局部搜索。文中阐述了遗传算法和禁忌搜索算法的基本思想,并给出了适用于背包问题的模型。通过具体事例测试改进的算法,其结果表明改进后的遗传算法拥有更好的性能和更快的收敛速度。
|
| 关 键 词： | 遗传算法 禁忌搜索 背包问题 收敛 |
An Improved Genetic Algorithm for the Knapsack Problem |
| |
| NIU Huilan,LIU Yuan,ZHU Haixiao,LIU Xiaohui.An Improved Genetic Algorithm for the Knapsack Problem[J].Electronic Science and Technology,2014,27(10):67-70. |
| |
| Authors: | NIU Huilan LIU Yuan ZHU Haixiao LIU Xiaohui |
| |
| Affiliation: | (School of Traffic and Transportation,Lanzhou Jiaotong University,Lanzhou 730070,China) |
| |
| Abstract: | In order to improve the local search ability of the genetic algorithm in solving the knapsack problem,the taboo search algorithm is integrated into the genetic algorithm which is used for global search,and it is used for local search. This paper elaborates the basic idea of these algorithms,and presents the model that is applied to the solution of the knapsack problem. The result of an example shows that this algorithm has better performance and faster convergence speed. |
| |
| Keywords: | genetic algorithm taboo search knapsack problem convergence |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《电子科技》浏览原始摘要信息 |
|
点击此处可从《电子科技》下载全文 |
|
