Title of article
Labeling algorithmsformultipleobjectiveintegerknapsackproblems
Author/Authors
José RuiFigueira، نويسنده , , GabrielTavaresb، نويسنده , , MargaretM.Wiecekc، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2010
Pages
12
From page
700
To page
711
Abstract
The paperpresentsagenericlabelingalgorithmforfindingallnondominatedoutcomesofthemultiple
objective integerknapsackproblem(MOIKP).Thealgorithmisbasedonsolvingthemultipleobjective
shortest pathproblemonanunderlyingnetwork.Algorithmsforconstructingfournetworkmodels,
all representingtheMOIKP,arealsopresented.Eachnetworkiscomposedoflayersandeachnetwork
algorithm, workingforwardlayerbylayer,identifiesthesetofallpermanentnondominatedlabelsfor
each layer.Theeffectivenessofthealgorithmsissupportedwithnumericalresultsobtainedforrandomly
generated problemsforuptosevenobjectiveswhileexactalgorithmsreportedintheliteraturesolve
the multipleobjectivebinaryknapsackproblemwithuptothreeobjectives.Extensionsoftheapproach
to otherclassesofproblemsincludingbinaryvariables,boundedvariables,multipleconstraints,and
time-dependent objectivefunctionsarepossible.
Keywords
Multiple objective integer knapsack problem , Labeling algorithms , Shortest path problem
Journal title
Computers and Operations Research
Serial Year
2010
Journal title
Computers and Operations Research
Record number
927683
Link To Document