Title of article
A hybridofNestedPartition,BinaryAntSystem,andLinearProgrammingforthe multidimensional knapsackproblem
Author/Authors
S. Al-Shihabi، نويسنده , , S.?lafsson، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2010
Pages
9
From page
247
To page
255
Abstract
This workpresentsahybridalgorithmofNestedPartition(NP),BinaryAntSystem(BAS),andLinear
Programming (LP)tosolvethemultidimensionalknapsackproblem(MKP).ThehybridNP+BAS+LPalgo-
rithm takesadvantageoftheglobalsearchstrategiesoftheNPalgorithm;theabilityofBAStoquickly
generate goodsolutionsandincorporatesinformationobtainedfromsolvingaLPrelaxationoftheMKPto
help guidethesearch.Itthusincorporatesboththelowerbounds(LB),foundbytheBAS,andtheupper
bounds (UB),foundbysolvingtherelaxedLP,intothesearchbyembeddingbothintheNPframework.
An adjustablecomputationbudgetisimplementedwherethenumberofsamplesincreasesiftheLB
and theUBpointtodifferentpromisingsubregions.Theproposedhybridiscomparedtostate-of-the-art
solution techniquesandisfoundtobeoneofthebestalgorithmsintermsofthequalityofsolutions
obtained andCPUtimerequirements.
Keywords
Nested Partition , Binary ant system , Multidimensional knapsack , Linear programming , Combinatorial optimization
Journal title
Computers and Operations Research
Serial Year
2010
Journal title
Computers and Operations Research
Record number
927640
Link To Document