Title of article :
A heuristicforretrievingcontainersfromayard
Author/Authors :
YusinLee ، نويسنده , , Yen-JuLee، نويسنده ,
Issue Information :
ماهنامه با شماره پیاپی سال 2010
Abstract :
This paperpresentsathree-phaseheuristictosolveforanoptimizedworkingplanforacranetoretrieve
all thecontainersfromagivenyardaccordingtoagivenorder.Theoptimizationgoalistominimizethe
numberofcontainermovements,aswellasthecrane’sworkingtime.Aftergeneratinganinitialfeasible
movementsequence,thesecondphasereducesthelengthofthesequencebyrepeatedlyformulating
and generatingabinaryintegerprogram.Withanothermixedintegerprogram,phasethreereducesthe
crane’s workingtimebyadjustingthemovementsequencethroughiterations.Numericaltestingresults
show thattheheuristicisabletosolveinstanceswithmorethan700containers,whichiswithinthe
range ofreal-worldapplications.Moreover,thenumberofmovementsapproachesthelowerboundin
mostcases,andtheresultingmovementsequenceisefficient.
Keywords :
Neighborhood search , container terminal , Container retrieval , Integer programming
Journal title :
Computers and Operations Research
Journal title :
Computers and Operations Research
