Title of article
A particularapproachfortheThree-dimensionalPackingProblemwith additional constraints
Author/Authors
Ana deAlmeida ، نويسنده , , MarisaB.Figueiredo ، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2010
Pages
9
From page
1968
To page
1976
Abstract
This paperfocusesonarestrainedconcretizationofthegeneralNP-hard ContainerLoadingProblem that
arises fromarealworldapplication.Thisparticularproblemcanbeinformallydescribedas:given
differentsetsofbinsandboxes,findthepackingoftheboxesintothesmallestnumberofbinsobeying
someadditionalrestrictionsontheplacement.Themathematicalprogrammingformulationthat
appearstobettermodelthisapplicationisthe Three-dimensionalBin-PackingProblem (3D-BPP) whichis
no morethananextensionoftheclassic Bin-PackingProblem to theorthogonalpackingofsolidobjects.
We presentanalternativenon-linearformulationforthe 3D-BPP versionaswellasnewdesigned
heuristicalgorithms(CPBOXandBOXCP)fortheapproximationoftheoptimalsolutionusingboxesand
bins ofheterogeneousdimensions.Moreover,wealsopresentaheuristicspecificallydesignedtowork
under veryparticularstorageapplicationrestrictions.Thenumericalresultsindicatethatallofthese
new heuristicshavegoodperformancestandardsespeciallywhenappliedtoreplicationsofrealinput
data.
Keywords
Real problem application , Heuristic algorithms , Three-dimensional packing , Multi-criteria optimization
Journal title
Computers and Operations Research
Serial Year
2010
Journal title
Computers and Operations Research
Record number
927802
Link To Document