| 基于改进模拟退火的遗传算法求解0-1背包问题 |
| |
| 引用本文： | 张盛意,蔡之华,占志刚.基于改进模拟退火的遗传算法求解0-1背包问题[J].微电子学与计算机,2011,28(2):61-64. |
| |
| 作者姓名： | 张盛意 蔡之华 占志刚 |
| |
| 作者单位： | 中国地质大学(武汉) 计算机学院,武汉,湖北,430074 |
| |
| 摘 要： | 引入改进的模拟退火思想来改进遗传算法.本算法结合了遗传算法和模拟退火算法的优点,并有效地克服了各自的弱点,使其在优化性能、优化效率和可靠性方面具有明显的优越性.运用本算法求解不同种群规模的0-1背包问题,数值试验结果表明,算法既具有较快的收敛速度,又能够收敛到最优解,优于遗传算法和模拟退火算法.
|
| 关 键 词： | 0-1背包 遗传算法 模拟退火 |
Solving 0-1 Knapsack Problem Based on Genetic Algorithm with Improved Simulated Annealing |
| |
| ZHANG Sheng-yi,CAI Zhi-hua,ZHAN Zhi-gang.Solving 0-1 Knapsack Problem Based on Genetic Algorithm with Improved Simulated Annealing[J].Microelectronics & Computer,2011,28(2):61-64. |
| |
| Authors: | ZHANG Sheng-yi CAI Zhi-hua ZHAN Zhi-gang |
| |
| Institution: | (School of Computer,China University of Geoscience,Wuhan 430074,China) |
| |
| Abstract: | The paper brings in simulated annealing to improve the performance of genetic algorithms.The algorithm combines the advantages and avoids the disadvantages of genetic algorithm and simulated annealing algorithm.It has superiority in performance,efficiency and reliability.This algorithm is used to solve 0-1 knapsack problem on different scaled datasets,and the results is better than either genetic algorithm or simulated annealing algorithm. |
| |
| Keywords: | 0-1 knapsack problem Genetic Algorithms Simulated Annealing |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
