改進的粒子群算法求解置換流水車間調(diào)度問題

《改進的粒子群算法求解置換流水車間調(diào)度問題》由會員上傳分享，免費在線閱讀，更多相關內(nèi)容在教育資源-天天文庫。

1、改進的粒子群算法求解置換流水車間調(diào)度問題摘要:針對置換流水車間調(diào)度問題，提出了一種改進的粒子群算法進行求解。改進算法引入了判斷粒子群早熟的方法，并在發(fā)現(xiàn)粒子群早熟后采用逆轉(zhuǎn)策略對種群最優(yōu)粒子進行變異，利用模擬退火思想概率接收新的最優(yōu)粒子。種群最優(yōu)粒子的改變會引導粒子群跳出局部極值的約束，從而克服粒子群的早熟狀態(tài)。通過對置換流水車間調(diào)度問題中car系列和rec系列部分基準數(shù)據(jù)的測試，證明了該算法的有效性。關鍵詞:粒子群算法；多樣性；局部收斂；置換流水車間調(diào)度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引言置換流水車間調(diào)度問題(permutationflowshopschedulingproblem，pfsp)是一類經(jīng)典的加工調(diào)度問題。該問題通常被描述為n個工件在m臺不同的機器上加工，每個工件有m道工序，每道工序都要在不同的機器上加工，每個工件在機器上的加工順序相同，每臺機器一次在某一時刻只能加工一個工件，每臺機器加工的各工