flexible assembly systems 5柔性装配系统.pptx

6thWeekProgressUpdateGroupThreeSchedulingofFlexibleAssemblySystemsGroupmember:张伟娜邓饶祎曹丽娜董硕楠PhaseFive:researchprogress

6thWeekProgressUpdateContentMathematicalPrograming(Cplex)Meta-Heuristic(VNS)

6thWeekProgressUpdateMathematicalProgrammingIntroductionofOPLPointsofthemodelCplexApplication

6thWeekProgressUpdateMathematicalProgrammingIntroductionofOPLAggregateOperator:SUMQuantifier:forallRange

4thWeekProgressUpdateMathematicalProgrammingPointsoftheModelDecisionvariablesIndexDefiningConstraintObjectivefunctions

4thWeekProgressUpdateMathematicalProgrammingCplexApplicationintnbCars=...;//#ofcarsintnbOptions=...;//#ofoptionsintnbSlots=...;//#ofslotsfloata=0.4;intb=60;?rangeCars=1..nbCars;rangeOptions=1..nbOptions;rangeSlots=1..nbSlots;?intdemand[Cars]=...;intoption[Options,Cars]=...;intoptionDemand[iinOptions]=sum(jinCars)demand[j]*option[i,j];?intprotime[Cars,Options]=...;intsetime[Slots,Slots,Options]=...;?intt[sinSlots,oinOptions]=protime[s,o]+max(t[s-1,o]+setime[s-1,s,o],t[s,o-1]);//每辆车在各个机器上完成时间?intdueday[Slots];//每辆车的dueday?dvarintslot[Slots]inCars;dvarintsetup[Options,Slots]in0..1;

4thWeekProgressUpdateMathematicalProgrammingCplexApplicationminimizea*b*t[sinSlots,nbOptions]+(1-a)*(Qh+Qt);?subjectto{//#ofcars=demandforall(cinCars)sum(sinSlots)(slot[s]==c)==demand[c];?forall(oinOptions,sinSlots)setup[o,s]==option[o][slot[s]];?};

6thWeekProgressUpdateMeta-Heuristic(VNS)确定邻域{Nk}和初始解，k=1,S*=S0满足终止条件随机交换S0两个不同工件得到S求邻域Nk内最优解S'f(S')<f(S)?k=k+1k>kmaxk=1s=s'若f(S)<f(S0),则S0=S,更新最优解S*YNY输出s*YNN

6thWeekProgressUpdateMeta-Heuristic(VNS)seq_best：=Init_seq();//产生一个初始解seq_now=Disturb(seq_best);//产生一个扰动得到扰动后新解While（未达到终止