Simulated Annealing for the 0/1 Multidimensional Knapsack Problem  

作　　者：Fubin Qian Rui Ding 

机构地区：[1]School of Management, University of Science ＆ Technology of Suzhou, Suzhou 215008, China [2]Institute of Economics, Molde University College, Molde 6411, Norway [3]School of Mathematical Science, Soochow University, Suzhou 215006, China

出　　处：《Numerical Mathematics A Journal of Chinese Universities(English Series)》2007年第4期320-327,共8页

基　　金：This work was supported by the National Natural Science Foundation of China （No. 10201026, 10672111）.

摘　　要：In this paper a simulated annealing(SA)algorithm is presented for the 0/1 mul- tidimensional knapsack problem.Problem-specific knowledge is incorporated in the algorithm description and evaluation of parameters in order to look into the perfor- mance of finite-time implementations of SA.Computational results show that SA per- forms much better than a genetic algorithm in terms of solution time,whilst having a modest loss of solution quality.In this paper a simulated annealing （SA） algorithm is presented for the 0/1 multidimensional knapsack problem. Problem-specific knowledge is incorporated in the algorithm description and evaluation of parameters in order to look into the performance of finite-time implementations of SA. Computational results show that SA performs much better than a genetic algorithm in terms of solution time, whilst having a modest loss of solution quality.

关 键 词：模拟退火 运算法则 静态冷却表 执行时间 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]