改进的粒子群算法求解置换流水车间调度问题

《改进的粒子群算法求解置换流水车间调度问题》由会员上传分享，免费在线阅读，更多相关内容在教育资源-天天文库。

1、改进的粒子群算法求解置换流水车间调度问题摘要:针对置换流水车间调度问题，提出了一种改进的粒子群算法进行求解。改进算法引入了判断粒子群早熟的方法，并在发现粒子群早熟后采用逆转策略对种群最优粒子进行变异，利用模拟退火思想概率接收新的最优粒子。种群最优粒子的改变会引导粒子群跳出局部极值的约束，从而克服粒子群的早熟状态。通过对置换流水车间调度问题中car系列和rec系列部分基准数据的测试，证明了该算法的有效性。关键词:粒子群算法；多样性；局部收敛；置换流水车间调度improvedparticleswarmoptimizationforpermutationflowshopschedulingp

2、roblemzhangqi.liang1,2*，chenyong.sheng1，hanbin21.collegeofelectronicandinformationengineering,tongjiuniversity,shanghai200331,china；2.collegeofelectricityandinformationengineering,jiangsuuniversityofscienceandtechnology,zhangjiagangjiangsu215600,chinaabstract:tosolvepermutationflowshopsch

3、edulingproblem,animprovedparticleswarmoptimizationwasproposed.improvedalgorithmintroducedamethodtojudgetheprematuritystateoftheparticleswarm,andusedreversionstrategytomutatethebestparticleaftertheparticleswarmbeingtrappedinprematureconvergence,simulatedannealingmethodwasusedtoacceptthenewparticle

4、.themutationforbestparticlecanguidetheparticleswarmtoescapefromthelocalbestvalue’slimitandovercometheparticles’prematurestagnation.thesimulationresultsbasedoncarandrec’benchmarksofpermutationflowshopschedulingproblemprovedtheeffectivenessoftheproposedalgorithm.tosolvepermutationflowshopscheduling

5、problem,animprovedparticleswarmoptimizationwasproposed.improvedalgorithmintroducedamethodtojudgetheprematurestateoftheparticleswarm,andusedreversionstrategytomutatethebestparticleaftertheparticleswarmbeingtrappedinprematureconvergence,andusedsimulatedannealingmethodtoacceptthenewparticle.themutat

6、ionforbestparticlecanguidetheparticleswarmtoescapefromthelocalbestvalueslimitandovercometheparticlesprematurestagnation.thesimulationresultsbasedoncarandrecbenchmarksofpermutationflowshopschedulingproblemprovetheeffectivenessoftheproposedalgorithm.keywords:particleswarmoptimization(pso);divers

7、ity;localconvergence;permutationflowshopscheduling0引言置换流水车间调度问题(permutationflowshopschedulingproblem，pfsp)是一类经典的加工调度问题。该问题通常被描述为n个工件在m台不同的机器上加工，每个工件有m道工序，每道工序都要在不同的机器上加工，每个工件在机器上的加工顺序相同，每台机器一次在某一时刻只能加工一个工件，每台机器加工的各工