發(fā)布時間：2018-06-23 16:44

  本文選題：多目標(biāo)優(yōu)化 + 置換流水車間調(diào)度��； 參考：《山東大學(xué)學(xué)報(工學(xué)版)》2017年04期

【摘要】：針對以最小化最大完工時間、最小化最大拖期和最小化總流程時間為目標(biāo)的置換流水車間調(diào)度問題(permutation flow shop scheduling problem,PFSP),基于雙變量分布估計法(bi-variable estimation of distribution algorithm,BVEDA)提出改善式雙變量分布估計算法(Improved BVEDA,IBVEDA)進(jìn)行求解。利用BVEDA中雙變量概率模型進(jìn)行區(qū)塊構(gòu)建,根據(jù)組合概率公式進(jìn)行區(qū)塊競爭和區(qū)塊挖掘,借用高質(zhì)量的區(qū)塊組合人造解,提高演化過程中解的質(zhì)量;針對算法多樣性較差的特點(diǎn),設(shè)計在組合人造解的過程中加入派工規(guī)則最短處理時間、最長處理時間和最早交貨期,將上述方法并行演化,通過top10的權(quán)重適度值總和動態(tài)調(diào)整上述方法處理的解的數(shù)量,最后利用帕累托支配篩選和保存非支配解。試驗(yàn)使用C++代碼在Taillard標(biāo)準(zhǔn)算例上測試,IBVEDA與SPGAⅡ和BVEDA比較,并繪制解的分布圖證實(shí)算法的有效性。
[Abstract]:To minimize the maximum completion time, In order to minimize the maximum tardiness and minimize the total flow time, the improved BVEDA-IBVEDA (improved BVEDA-IBVEDA) algorithm is proposed to solve the (permutation flow shop scheduling problem in the permutation flow shop scheduling problem, which is based on the bi-variable estimation of distribution algorithm (BVEDA). The improved BVEDA-IBVEDA (improved BVEDA-IBVEDA) algorithm is proposed to solve the problem. Using the bivariate probabilistic model of BVEDA to construct blocks, according to the combination probability formula, the block competition and block mining are carried out, and the high-quality artificial solution of block combination is used to improve the quality of the solution in the evolution process. The shortest processing time, the longest processing time and the earliest delivery time are added in the process of combining artificial solutions. The above methods are evolved in parallel, and the number of solutions processed by the above method is dynamically adjusted by the sum of the appropriate weight values of top10. Finally, Pareto domination is used to screen and preserve the non-dominant solutions. The C code is used to test the comparison of IBVEDA with SPGA 鈪，

本文編號：2057739