| 基于改进的模拟退火算法求解0／1背包问题 |
| |
| 引用本文： | 许小勇.基于改进的模拟退火算法求解0／1背包问题[J].海南大学学报(自然科学版),2008,26(4):356-359. |
| |
| 作者姓名： | 许小勇 |
| |
| 作者单位： | 东华理工大学数学与信息科学学院,江西抚州,344000 |
| |
| 摘 要： | 提出了一种改进的具有变异和倒位算子的模拟退火算法，并将其用于求解0／1背包问题，其性能较标准模拟退火算法和贪心算法都有很大的改善．通过大量的数值实验，证明了文中改进的模拟退火算法求解背包问题的有效性和实用性．
|
| 关 键 词： | 模拟退火算法 背包问题 贪婪算法 变异算子 倒位算子 |
Solving 0/1 Knapsack Problem Based on Improved Simulated Annealing Algorithm |
| |
| XU Xiao-yong.Solving 0/1 Knapsack Problem Based on Improved Simulated Annealing Algorithm[J].Natural Science Journal of Hainan University,2008,26(4):356-359. |
| |
| Authors: | XU Xiao-yong |
| |
| Institution: | XU Xiao-yong(School of Mathematics , Information Science,East China Institute of Technology,Fuzhou 344000,China) |
| |
| Abstract: | An improved simulated annealing algorithm with mutation operator and reverse operator was proposed to solve 0/1 knapsack problem.The capability of the improved algorithm is much better than the basic simulated annealing algorithm and greedy algorithm.The practicability and effectiveness of the improved annealing algorithm solving knapsack problem has been proved by results obtained from a mass of simulation experiments. |
| |
| Keywords: | simulated annealing algorithm knapsack problem greedy algorithm mutation operator reverse operator |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
