摘要
提出了一种改进的具有变异和倒位算子的模拟退火算法,并将其用于求解0/1背包问题,其性能较标准模拟退火算法和贪心算法都有很大的改善.通过大量的数值实验,证明了文中改进的模拟退火算法求解背包问题的有效性和实用性.
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.
出处
《海南大学学报（自然科学版）》
CAS
2008年第4期356-359,共4页
Natural Science Journal of Hainan University
关键词
模拟退火算法
背包问题
贪婪算法
变异算子
倒位算子
simulated annealing algorithm
knapsack problem
greedy algorithm
mutation operator
reverse operator
