责任编辑类有关论文范文,与MultiplePeoplePickingAssignmentandRoutingOptimizationBasedonGeneticAlgorithm相关毕业论文怎么写
本论文是一篇责任编辑类有关毕业论文怎么写,关于MultiplePeoplePickingAssignmentandRoutingOptimizationBasedonGeneticAlgorithm相关电大毕业论文范文。免费优秀的关于责任编辑方面论文范文资料,适合责任编辑论文写作的大学硕士及本科毕业论文开题报告范文和学术职称论文参考文献下载。
rvethetopcindividuals.9)Repeatthestepsfromthe4thtothe8thdescribedabove,untilitreachesthemaxgeneration(genmax).
10)Theend:OutputtheMsubarraysofthepopulationofthefinalgeneration,meanwhileexporttheobjectivefunctionvaluesofeachindividual.
3Thesimulationexperimentandresult
1)Supposethatinacertainperiodoftime,distributioncenterreceives20customerorders,thetotaltypesofgoodsinthe20ordersaccountsfor50whichlocatedinthefollowlocations:(1,1,10),(1,1,12),(1,1,15),(1,0,16),(1,0,18),(1,0,19),(1,0,20),(2,1,11),(2,1,13),(2,1,14),(2,0,15),(2,0,16),(2,0,18),(2,0,21),(3,1,8),(3,1,15),(3,0,16),(3,0,17),(3,0,21),(3,0,22),(3,0,23),(4,1,12),(4,1,14),(4,0,17),(4,0,18),(4,0,23),(4,0,24),(5,1,12),(5,1,13),(5,1,14),(5,0,15),(5,0,17),(5,0,18),(6,1,9),(6,1,10),(6,1,11),(6,1,14),(6,0,16),(6,0,17),(6,0,20),(6,0,22),(7,1,10),(7,0,16),(7,0,21),(8,1,10),(8,1,12),(8,1,15),(8,0,19),(9,0,16),(10,0,16);
2)Cordthe50locationswith0~49decimalnumbers.
3)ImporttheLocationinformationintotheprogram,Setupparametersasfollows:N等于100;M等于2,M等于3orM等于4;pc等于0.9;pm等于0.1;c等于40;genmax等于200.
WhenM等于2,theoptimalpathis:
[4,3,2,1,8,9,10,11,12,16,17,23,24,29,30,31,34,35,36,37,42,45,46,47,48,49,50],[5,6,7,15,14,13,22,21,20,19,18,28,27,26,25,33,32,41,40,39,38,44,43];Theshortestwalkingdistance:S等于518meters.
WhenM等于3,theoptimalpathis:
[7,6,5,1,2,3,4,15,14,13,8,9,10,11,12,16,17,22,21,20,19,18,23,24],[28,27,26,25,33,32,29,30,31,41,40,39,38],[44,43,48,49,50,45,46,47,42,34,35,36,37];Theshortestwalkingdistance:S等于306meters.
WhenM等于4,theoptimalpathis:
[31,30,29,23,24,17,16,12,11,10,9,8,4,3,2,1],[28,27,26,25,18,19,20,21,22,15,14,13,5,6,7],[50,49,48,43,44,38,39,40,41,33,32],[45,46,47,42,34,35,36,37];Theshortestwalkingdistance:S等于189meters.
4TheTag
Thispapertakesartificialpickingoperationsina(下转第57页)(上接第27页)certaindistributioncenterwhichhasdouble-areawarehouseasthestudyingobject.Establishesthemathematicalmodel,designsaheuristicalgorithmbasedonthegeicalgorithm,andobtainsagoodresult.However,thereisstillmuchroomforimprovement,theactualprocessoforder-pickingprocessismuchmoreplicatedthantheestablishedmathematicalmodel,therearemanyrestrictions,forexample,thepickingcartsmaybecapacityconstrained,workingefficiencyofdifferentworkerscannotbethesame,fewofthewarehousehasainerraticgeometricfigure,onlytakingthepickertraveldistanceasthemeasurestandardsisnotaccurateenough.Intheprocessoforder-batching,thesubmissionofcustomerordersisadynamicprocesswhichshouldalsobeconsideredwhencalculatingtheoptimalpath.Inaddition,thealgorithmitselfalsohassomedisadvantages,howtoexpeditetheconvergencerate,avoidthelocalconvergenceandmakeaneasycalculationalsoneedsfurtherstudy.【References】
[1]Drury,J..Towardsmoreefficientorderpicking[J].IMMmonograph,No.1.Cranfield,UK:TheInstituteofMaterialsManagements,1988.
[2]Sahni,S.&Gonzalez,T.L..P-pleteapproximationproblems[J].JournaloftheAssociationofComputerMachinery,1976(23):555-565.
[3]CHANFelixT.S,CHANH.K.ImprovingtheProductivityofOrderPickingofaManual-pickandMulti-levelRackDistributionWarehousethroughtheImplementationofClassbasedStorage[J].ExpertSystemswithApplications,2011(38):2686-2700.
[4]DeKker,R.,deKoster,R.,VanKalleveen,H.,&Roodbergen,K.J.Improvingorder-pickingresponsetimeatAnkor’swarehouseInerfaces[J].2004,34(4):303-313.
[5]Le-Duc,T.,&deKoster,R..Traveldistanceestimatedandstoragezoneoptimizationina2-blockclass-basedstoragestrategywarehouse[J].InternationalJournalofProductionResearch,2005,43(17):3561-3581.
[6]LiShizhen,DuWenhong.Theclusteringanalysisoftheorder-batchingpickingmodelbasedonheuristicalgorithm[J].Packagingengineering,2008(12):5-9.
[7]LiYanru.Orderpickingreal-timeschedulingproblembasedongeicalgorithm[J].Packagingengineering,2011,32(13):97-101.
[8]LiZhen,HuQingdong.Researchonartificialpickingrouteoptimizationbasedonnichegeicalgorithm[J].Logisticstechnology,2011(6):95-98.
[9]WangHong,FuZhuo.Researchondouble-areawarehousepickingrouteoptimizationbasedongeicalgorithm[J].ComputerengineeringandApplications,2009,45(6):224-228.
[责任编辑:丁艳]
责任编辑类有关论文范文,与MultiplePeoplePickingAssignmentandRoutingOptimizationBasedonGeneticAlgorithm相关毕业论文怎么写参考文献资料:
MultiplePeoplePickingAssignmentandRoutingOptimizationBasedonGeneticAlgorithm(3)WORD版本 下载地址