Title of article
A squeakywheeloptimisationmethodologyfortwo-dimensionalstrippacking
Author/Authors
Edmund K.Burke، نويسنده , , MatthewR.Hyde ، نويسنده , , GrahamKendall، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2011
Pages
10
From page
1035
To page
1044
Abstract
The two-dimensionalstrippackingproblemoccursinindustriessuchasmetal,wood,glass,paper,and
textiles.Theprobleminvolvescuttingshapesfromalargerstocksheetorrollofmaterial,while
minimisingwaste.Thisisawellstudiedproblemforwhichmanyheuristicmethodologiesareavailablein
the literature,rangingfromthebasic‘one-pass’best-fitheuristic,tothestateoftheartReactiveGRASP
and SVC(SubKP)iterativeprocedures.Thecontributionofthispaperistopresentamuchsimplerbut
equallycompetitiveiterativepackingmethodologybasedonsqueakywheeloptimisation.Aftereach
completepacking(iteration),apenaltyisappliedtopiecesthatdirectlydecreasedthesolutionquality.
Thesepenaltiesinformthepackinginthenextiteration,sothattheoffendingpiecesarepackedearlier.
This methodologyisdeterministicandveryeasytoimplement,andcanobtainsomebestresultson
benchmarkinstancesfromtheliterature.
Keywords
Genetic heuristic algorithm , Scheduling , Sum-of-processing time based learning effect , Release time
Journal title
Computers and Operations Research
Serial Year
2011
Journal title
Computers and Operations Research
Record number
927922
Link To Document