您好,欢迎访问三七文档
当前位置:首页 > 行业资料 > 交通运输 > 优化物流中心配送方案的遗传算法
200344:100026788(2003)0420076206,(,100044):,,,L:;;:U11:AGeneticAlgorithmforOptimizingDistributionProjectofLogisticCenterHEGuo2xian,LIUKai(SchoolofCommunicationandTransportation,NorthJiaotongUniversity,Beijing100044,China)Abstract:Undersupplychainmanagement,moreandmorecompanyadoptpullviewinsteadofpushviewtoservethemarketwithresponsiveness,forthisreason,thequantityoftime2sensitivegoodswhichneedtransportationthroughlogisticsystemisrising,logisticcenterplayanimportantroleinlo2gisticsystem,itneedtakingtheresponsetimethatcustomersdesireintoconsideration,Inthispaper,wesuggestamethodwhichcantakebothtransportationtimeandloadingconstraintconditionintocon2sideration,andgeneticalgorithmisproposedtogetoptimumsolution,Anexampleofdistributionpro2jectiscalculatedbytheproposedcomputerprogram,whichindicatesthatthismethodisfeasibleandef2fective.Keywords:geneticalgorithm;logisticcenter;distribution:2001212214:(1969-),,,,,1,(push)(pull),JIT(justintime)L,(manufacturer)(cus2tomer),(customerdesiredtime).(logisticcenter),L,,,L,,,L2,,,,©1995-2005TsinghuaTongfangOpticalDiscCo.,Ltd.Allrightsreserved.,Z,n,m,(1)Zminf=6mj=16ni=1xij(Di-Ti)6mj=16ni=1xij(1),xij=1,ij;0,ij.;Dii;Tii.(2)6ni=1xijwiFWj,j=1,2,,m6ni=1xijviFVj,j=1,2,,m(2),vii;wii;Vjj;Wjj.,,(3)Pxij=0viVj-6ni=1xijviwiWj-6ni=1xijwi,j=1,2,,m(3),1,m=1,021,m1,(combinatorialoptimizationproblem),,,Z3,021,,,,,Z3.1mn,ii,jj,,021,,,,Z,,021,0-m,(4)V=(x1,x2,x3,,xn)(4),xi=k,ik(1FkFm)0,iZV,(chromosome),(gene)Z3.2,,Z,774©1995-2005TsinghuaTongfangOpticalDiscCo.,Ltd.Allrightsreserved.(),Z,Znm,;,;,,Z,pop[i].gene[j]:=0,pop[i].leftw[j]:=Wjpop[i].leftv[j]:=Vj,:1i:=1;2j:=1;3pop[i].gene[j]:=j;j:=j+1;4jm,3,i:=i+1;5in,2,Z,:1i:=1;2k:=1;31-nrg,rt;4pop[i].gene[rg]0,2,wrgpop[i].leftw[rt]vrgpop[i].leftv[rt],2;5rgrtpop[i].gene[rg]:=rt,pop[i].leftw[rt]:=pop[i].leftw[rt]-wrg,pop[i].leftv[rt]:=pop[i].leftv[rt]-vrg;k:=k+1;6kn,3,i:=i+1;7in,2;.:1i:=1;2k:=1;3j:=1;4pop[i].gene[j]=0,wjFpop[i].leftw[k]vjFpop[i].leftv[k],,:pop[i].gene[j]:=k;pop[i].leftw[k]:=pop[i].leftw[k]-wj,pop[i].leftv[k]:=pop[i].leftv[k]-vj;j:=j+1;j:=j+1;5jn,4,k:=k+1;6km,3,i:=i+1;7im3n,2,.Z:pop[i]i;pop[i].gene[j]ij;pop[i].leftw[k]ik;pop[i].leftv[k]ikZ3.3(fitnessfunction),(reproduction),;,,(5):ff=C-f(5),ff;C;fZ8720034©1995-2005TsinghuaTongfangOpticalDiscCo.,Ltd.Allrightsreserved.,(reproduction),LGoldberg,(6)fi=afi+beval(Vi)=fi6mni=1fi,i=1,2,,mn(6),fii;a,b;mnZa=-1;b=365,(6)qiZq0=0qi=6ij=1eval(Vj),i=1,2,,mn3.4(crossover),,.,,,,;,,,,,L(mutation),,,L:0-1r,A,rA,,,,L3.5,,.1,,N;Best_chromosome();m3n;ContinueL4,,15,,12,,L(0,0,1,2,0,2,0,0,0,1,1,1,0,0,2)::0(T),2(m3);:0(T),4(m3)f=19ö7=2.71(D);Tc10(s).2,f,NL974©1995-2005TsinghuaTongfangOpticalDiscCo.,Ltd.Allrightsreserved.11(T)(m3)(D)(D)(T)(m3)(D)(D)1227192311723211310356234342112142432841211655321621343124642106143113273211315121198321482(T)(m3)(T)(m3)1101228100820034©1995-2005TsinghuaTongfangOpticalDiscCo.,Ltd.Allrightsreserved.25,,,,;(remainingtransportationtime)(outboundtransportationtime),,,,;,,,Best_chromosome,L:[1]SunilChopra,PeterMeindl.Supplychainmanagement[M].:,2001.[2],.[M].:.1999.[3],,.[J].,2001,23(5):567-571.[4],,.[J].,2001,36(2):210-215.[5],.[J].,2001,21(4):32-28.[6],,.[J].,2001,19(1):69-75.(69)[6]GuyDesaulniers,JuneLavigne,FrancoisSoumis.Multi2depotvehicleschedulingproblemswithtimewindowsandwaitingcosts[J].EuropeanJournalofOperationalResearch,1998,111(3):479-494.[7]Kim,Jung2Ug;Kim,Yeong2Dae.Adecompositionapproachtoamulti2periodvehicleschedulingproblem[J],Omega1999,27(4):421-430.[8]ParkYang2Byung.Asolutionofthebicriteriavehicleschedulingproblemswithtimeandarea2dependenttravelspeeds[J].Computers&IndustrialEngineering,2000,38(1):173-187.[9].[J].,1999,19(1):27-33.[10].[J].,1999,17(2):66-71.[11],.[J].,1995,30(4):376-382.184©1995-2005TsinghuaTongfangOpticalDiscCo.,Ltd.Allrightsreserved.
本文标题:优化物流中心配送方案的遗传算法
链接地址:https://www.777doc.com/doc-748724 .html