| 一种改进的模拟退火算法求解0-1背包问题 |
| |
| 引用本文： | 梁国宏,张生,黄辉,何尚录.一种改进的模拟退火算法求解0-1背包问题[J].广西民族大学学报,2007,13(3):91-93. |
| |
| 作者姓名： | 梁国宏 张生 黄辉 何尚录 |
| |
| 作者单位： | 兰州交通大学数理与软件工程学院 甘肃兰州730070 |
| |
| 基金项目： | 国家自然科学基金资助项目:40301037 |
| |
| 摘 要： | 从增强算法收敛性和减少参数依赖性的角度出发,提出应用改进的模拟退火算法求解0-1背包问题.对模拟退火算法有所改进,并有效地克服它的弱点,使其在优化性能,优化效率和可靠性方面有明显的优越性.阐明了用该算法求解0-1背包问题的具体实现过程,并通过实际数值计算和结果比较表明,该算法在求解0-1背包问题优于传统的模拟退火算法,并且得到更有效的近似解.
|
| 关 键 词： | 0-1背包问题 传统的模拟退火算法 改进的模拟退火算法 |
| 文章编号： | 1673-8462（2007）03-0091-03 |
| 修稿时间： | 2007-03-20 |
A Kind of Renewed Simulated Annealing Algorithm Solves 0-1 Knapsack Problem |
| |
| LIANG Guo-hong,ZHANG Sheng,HUANG Hui,HE Shang-lu.A Kind of Renewed Simulated Annealing Algorithm Solves 0-1 Knapsack Problem[J].Journal of Guangxi University For Nationalities(Natural Science Edition),2007,13(3):91-93. |
| |
| Authors: | LIANG Guo-hong ZHANG Sheng HUANG Hui HE Shang-lu |
| |
| Abstract: | From the viewpoint of intensifying convergence and reducing dependency of parameters,a renewed simulated annealing algorithm for solving knapsack problem is proposed.The algorithm avoids the disadvantages of traditional simulated annealing algorithm.It has superiority in performance,efficiency and reliability.The detailed realization of the algorithm for solving 0-1 knapsack problem is illustrated. |
| |
| Keywords: | 0-1 Knapsack Problem Traditional Simulated Annealing Algorithm Renewed Simulated Annealing Algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
