Title of article
An efficientheuristicalgorithmforarbitraryshapedrectilinearblock packingproblem
Author/Authors
Duanbing Chen، نويسنده , , JingfaLiu، نويسنده , , Yanfu Yang، نويسنده , , MingshengShang a، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2010
Pages
7
From page
1068
To page
1074
Abstract
Arbitrary shapedrectilinearblockpackingproblemisaproblemofpackingaseriesofrectilinearblocks
into alargerrectangularcontainer,wherearbitraryshapedrectilinearblockisapolygonalblockwhose
interior angleiseither901 or 2701. Thisprobleminvolvesmanyindustrialapplications,suchasVLSI
design, timbercutting,textileindustryandlayoutofnewspaper.Manyalgorithmsbasedondifferent
strategieshavebeenpresentedtosolveit.Inthispaper,weproposedanefficientheuristicalgorithm
which isbasedonprinciplesofcorner-occupyingactionandcavingdegreedescribingthequalityof
packing action.Theproposedalgorithmistestedonsixinstancesfromliteraturesandtheresultsare
rather satisfying.Thecomputationalresultsdemonstratethattheproposedalgorithmisratherefficient
for solvingthearbitraryshapedrectilinearblockpackingproblem.
Keywords
Rectilinear block packing , Heuristic algorithm , Caving degree , Corner-occupying action
Journal title
Computers and Operations Research
Serial Year
2010
Journal title
Computers and Operations Research
Record number
927715
Link To Document