Title of article
Tabu searchwithpathrelinkingforanintegrated production–distributionproblem
Author/Authors
V.A. Armentano ، نويسنده , , A.L.Shiguemoto، نويسنده , , Arne Lokketangen، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2011
Pages
11
From page
1199
To page
1209
Abstract
This paperdealswiththeproblemofintegratingproductionanddistributionplanningoverperiodsofa
finite horizon.Weconsideracapacity-constrainedplantthatproducesanumberofitemsdistributedbya
fleetofhomogenousvehiclestocustomerswithknowndemandforeachitemineachperiod.The
productionplanningdefinestheamountofeachitemproducedineveryperiod,whilethedistribution
planningdefineswhencustomersshouldbevisited,theamountofeachitemthatshouldbedeliveredto
customers,andthevehicleroutes.Theobjectiveistominimizeproductionandinventorycostsatthe
plant,inventorycostsatthecustomersanddistributioncosts.Weproposetwotabusearchvariantsfor
this problem,onethatinvolvesconstructionandashort-termmemory,andonethatincorporatesalonger
term memoryusedtointegrateapathrelinkingproceduretothefirstvariant.Theproposedtabusearch
variantsaretestedongeneratedinstanceswithuptotenitemsandoninstancesfromtheliterature
involvingasingleitem.
Keywords
Supply chain management , Production–distribution problem , Tabu search , Path relinking
Journal title
Computers and Operations Research
Serial Year
2011
Journal title
Computers and Operations Research
Record number
927938
Link To Document