简介:Inthispaperasimulatedannealing(SA)algorithmispresentedforthe0/1mul-tidimensionalknapsackproblem.Problem-specificknowledgeisincorporatedinthealgorithmdescriptionandevaluationofparametersinordertolookintotheperfor-manceoffinite-timeimplementationsofSA.ComputationalresultsshowthatSAper-formsmuchbetterthanageneticalgorithmintermsofsolutiontime,whilsthavingamodestlossofsolutionquality.