责任编辑类有关论文范文,与MultiplePeoplePickingAssignmentandRoutingOptimizationBasedonGeneticAlgorithm相关毕业论文怎么写
本论文是一篇责任编辑类有关毕业论文怎么写,关于MultiplePeoplePickingAssignmentandRoutingOptimizationBasedonGeneticAlgorithm相关电大毕业论文范文。免费优秀的关于责任编辑方面论文范文资料,适合责任编辑论文写作的大学硕士及本科毕业论文开题报告范文和学术职称论文参考文献下载。
1→b/2representstheeasthalf,b/2+1→brepresentsthewesthalf;Nisthetotalnumberoflocationsinwarehouse.ThewidthofthecounterisD1,D1等于1meteranditsdepthisD3,D3等于0.5meter;ThewidthofthechannelisD2,D2等于1meter;theWidthofthemainchannelisD4,D4等于2meter.Whenanytwolocationsofpiandpjdistributeinthesamelaneway(xi等于xj),theshortestdistancebetweenthemis:
dij等于zi-zj×D1,{(1≤zi≤b/2,1≤zj≤b/2)or(b/2 Whenthetwolocationsarenotdistributedinthesamelaneway(xi≠xj),canbedividedintothefollowingthreecircumstances: Whenyi等于yj等于1: dij等于zi+zj×D1+xi-xj×D2+2D3,(1≤zi≤b/4,1≤zj≤b/4)30-zi-zj×D1+xi-xj×D2+2D3,(b/4 Whenyi等于yj等于0: dij等于zi+zj-30×D1+xi-xj×D2+2D3,(b/2 Whenyi≠yj: dij等于zi-zj×D1+xi-xj×D2+2D3+D4,{(1≤zj≤b/2,b/2 ThedistancefromI/Opointtoanylocationis: d0i等于(b/2-zi)×D1+(xi-1)×D2+2D3+D4/2,(xi∈{1,...,a},1≤zi≤b/2)(zi-b/2)×D1+(xi-1)×D2+2D3+D4/2,(xi∈{1,...,a},b/2 Theobjectivefunctionofcalculatingthetotaldistanceis: D等于mindij×xij+d1O+dNO(1) Intheformulaabove:dijindicatesthedistancebetweenanytwolocations(locationiandlocationj)inthewarehouse;d1,O(ordN,O)indicatesthedistancefromthefirst(orthelast)pickingmoditytotheI/Opoint.Because,pickerssetofffromtheI/Opoint,whentheyfinishtheirtaskstheyhavetodeliverthegoodstotheI/Opoint. Theconstraintconditionsare: xij等于1,(i≠j;j等于1,2,...N)(2) xij等于1,(i≠j;i等于1,2,...N)(3) Intheformulasabove:xijandxjiaredecisionvariables,ifthepickergofromlocationiandlocationj,xij等于1orelsexij等于0;xijandxijindicatethetotalfrequencyoflocationitolocationjandlocationjtolocationi.Whenbiningtheformulasof(2)and(3)makeanindicationofthereisonlyonewaybetweeniandjlocations,sopickersmaynotmakearepeatedpicking.2Algorithmicprocesses 1)Therequiredinformation:Makeastatisticforallthelocationsofpickinggoods,designaprograminordertocalculatetheshortestdistancesbetweenanytwogo 2)Coding:nindicatesthetotallocationnumberofthepickinggoods.Encodeallthepickinglocationswith0,1,...,n-1(eachpickinglocationhasauniquenumber). 3)Initialization:Generateminitializedarraysinthemethodofarrangingthenlocationnumberrandomly(mindicatesthenumberofthereservedindividualsineachgeneration). 4)Alternative:Whenanewgenerationemergences,abandonthedisadvantageswiththeprobabilityofpsandthenreplacetheinferiorgroupwiththeoptimalindividuals. 5)Cross:Withthecrossoverprobabilitypcselectstheindividualsfromthecurrentgeneration,andthendividedalltheselectedindividualsintotwogroupsasthetwomalesofthenextgeneration.Namethemasparent1andparent2.Selectacrossoverpointrandomlyforeachpairoftheparent.Thecrossingprocessisdesignedasfollows: father1:0,1,2,3|4,5,6,7,8,9father2:5,6,4,3|2,1,0,8,7,9?圯son1:0,1,2,3|*,*,*,*,*,*son2:5,6,4,3|*,*,*,*,*,* ?圯son1:0,1,2,3|5,6,4,8,7,9son2:5,6,4,3|0,1,2,7,8,9 Asshownabove“|”indicatesthecrosspoint;the“*”partduplicatesfromfirstelementofanotherparenttothelastone,extracttheelementswhicharedifferentfromtheformerones. 6)Variation:Withthemutationratepmselectstheindividualsfromthecurrentgeneration,anddeterminetwomutationpointsrandomlyforeachindividual(selectedasthecrossingpoint),exchangethetwoelementsatthemutationpoints,aftertheprocessofvariation,newindividualsappear.Inordertoavoidprematureconvergence,whentheevolutionnumberislargeenoughthemutationratepmwillbeincreased. 7)CalculateObjectivefunctionvalue:anyindividual,e.g.0,1,2,3,4,5,6,7,8,9,*,*,*******,canbedividedintoMone-dimensionalarraysbytheneverrepeatedM-1randomseparationpoints(M≤n).“|”representtheseparationpoints,e.g.0,1,2,3|4,5,6,7,8|9,*,*,*|******...(thenumberofpickersisM,thisstepaimtoassigntasksfortheMpickers).Inthiswaywecansplitanone-dimensionalarrayintochunksofnewarraysas[0,1,2,3],[4,5,6,7,8],[9,*,*,*],...thentakethebiggestobjectivefunctionvalueofthenewarraysastheoriginal’s.8)Select:accordingtotheobjectivefunctionvalue,sortallindividualsofeachgenerationandrese 责任编辑类有关论文范文,与MultiplePeoplePickingAssignmentandRoutingOptimizationBasedonGeneticAlgorithm相关毕业论文怎么写参考文献资料: MultiplePeoplePickingAssignmentandRoutingOptimizationBasedonGeneticAlgorithm(2)WORD版本 下载地址
本文url:http://www.sxsky.net/benkelunwen/060100288.html
有关论文范文主题研究:
关于责任编辑的论文范文集
大学生适用:
电大论文、学年论文
相关参考文献下载数量:
98
写作解决问题:
毕业论文怎么写
毕业论文开题报告:
论文提纲、论文前言
职称论文适用:
职称评定、职称评中级
所属大学生专业类别:
毕业论文怎么写
论文题目推荐度:
优秀选题
责任编辑类有关论文范文