Simulated Annealing for the 0/1 Multidimensional Knapsack Problem

(整期优先)网络出版时间:2007-04-14
/ 1
Inthispaperasimulatedannealing(SA)algorithmispresentedforthe0/1mul-tidimensionalknapsackproblem.Problem-specificknowledgeisincorporatedinthealgorithmdescriptionandevaluationofparametersinordertolookintotheperfor-manceoffinite-timeimplementationsofSA.ComputationalresultsshowthatSAper-formsmuchbetterthanageneticalgorithmintermsofsolutiontime,whilsthavingamodestlossofsolutionquality.