| 混合遗传算法求解0-1背包问题尝试 |
| |
| 引用本文： | 董清潭. 混合遗传算法求解0-1背包问题尝试[J]. 天津理工大学学报, 2005, 21(2): 76-79 |
| |
| 作者姓名： | 董清潭 |
| |
| 作者单位： | 中共天津市委党校,计算机教研部,天津,300191 |
| |
| 摘 要： | 遗传算法是一种基于自然选择和遗传机制的搜索算法．为解决著名的0-1背包问题，尝试混合使用一点杂交与多点杂交以及将传统的算法与遗传算法相结合的方法，对经典遗传算法进行改进，并在实验中获得了更佳近似解．
|
| 关 键 词： | 遗传算法 自然选择 遗传机制 搜索算法 背包问题 递归回溯法 |
| 文章编号： | 1673-095X(2005)02-0076-04 |
| 修稿时间： | 2004-10-09 |
Mixing use methods of the genetic algorithm to solve 0-1''''s knapsack problem |
| |
| DONG Qing-tan. Mixing use methods of the genetic algorithm to solve 0-1''''s knapsack problem[J]. Journal of Tianjin University of Technology, 2005, 21(2): 76-79 |
| |
| Authors: | DONG Qing-tan |
| |
| Abstract: | The genetic algorithm is based on the search algorithm of natural selection and genetic mechanism. This paper attempted to discussi the way in solving famous 0-1's knapsack problem, and improved the classics genetic algorithms by mixing use methods of singlepoint-crossover and multipoint-crossover as well as combining tradition algorithms with genetic algorithm in order to gain the better approximate solution about the problem. |
| |
| Keywords: | genetic algorithm selection reproduction crossover mutation mixed genetic algorithm parallel genetic algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
