【摘要】：目前求解置換流水車間調(diào)度問(wèn)題的智能優(yōu)化算法都是隨機(jī)型優(yōu)化方法,存在的一個(gè)問(wèn)題是解的穩(wěn)定性較差。針對(duì)該問(wèn)題,本文給出一種確定型智能優(yōu)化算法——中心引力優(yōu)化算法的求解方法。為處理基本中心引力優(yōu)化算法對(duì)初始解選擇要求高的問(wèn)題,利用低偏差序列生成初始解,提高初始解質(zhì)量;利用加速度和位置迭代方程更新解的狀態(tài);利用兩位置交換排序法進(jìn)行局部搜索,提高算法的優(yōu)化性能。采用置換流水車間調(diào)度問(wèn)題標(biāo)準(zhǔn)測(cè)試算例進(jìn)行數(shù)值實(shí)驗(yàn),并和基本中心引力優(yōu)化算法、NEH啟發(fā)式算法、微粒群優(yōu)化算法和螢火蟲算法進(jìn)行比較。結(jié)果表明該算法不僅具有更好的解的穩(wěn)定性,而且具有更高的計(jì)算精度,為置換流水車間調(diào)度問(wèn)題的求解提供了一種可行有效的方法。
[Abstract]:At present, the intelligent optimization algorithms for the replacement flow shop scheduling problem are all stochastic optimization methods, one of the problems is the poor stability of the solution. In order to solve this problem, this paper presents a definite intelligent optimization algorithm, which is called central gravity optimization algorithm. In order to deal with the problem that the selection of the initial solution is required by the basic central gravity optimization algorithm, the initial solution is generated by using the low deviation sequence to improve the quality of the initial solution, and the state of the solution is updated by the iterative equations of acceleration and position. The local search is carried out by using the two-position exchange sorting method to improve the optimization performance of the algorithm. A standard test example of permutation flow shop scheduling problem is used to carry out numerical experiments, and the numerical results are compared with basic central gravity optimization algorithm, NEH heuristic algorithm, particle swarm optimization algorithm and firefly algorithm. The results show that the algorithm not only has better stability of solution, but also has higher computational accuracy. It provides a feasible and effective method for solving the replacement flow shop scheduling problem.
【作者單位】： 上海理工大學(xué)管理學(xué)院;
【基金】：國(guó)家自然科學(xué)基金項(xiàng)目(71401106) 教育部人文社會(huì)科學(xué)研究規(guī)劃基金項(xiàng)目(16YJA630037) 上海市高原學(xué)科建設(shè)項(xiàng)目 上海市“科技創(chuàng)新行動(dòng)計(jì)劃”軟科學(xué)研究重點(diǎn)項(xiàng)目(17692109400) 上海高校青年教師培養(yǎng)資助計(jì)劃項(xiàng)目(ZZsl15018) 上海理工大學(xué)國(guó)家級(jí)培育青年基金項(xiàng)目(16HJPY-QN15) 上海理工大學(xué)博士科研啟動(dòng)經(jīng)費(fèi)項(xiàng)目(1D-15-303-005)
【分類號(hào)】：TB497;TP18

【相似文獻(xiàn)】

相關(guān)期刊論文 前10條

1 康寧,王鳳儒,劉丕娥,常會(huì)友;有交貨期的單件車間調(diào)度問(wèn)題的逆序算法[J];系統(tǒng)工程理論與實(shí)踐;1999年12期

2 馬邦雄;葉春明;;利用貓群算法求解流水車間調(diào)度問(wèn)題[J];現(xiàn)代制造工程;2014年06期

3 王柏琳;李鐵克;;等待時(shí)間受限的流水車間調(diào)度問(wèn)題的若干性質(zhì)[J];系統(tǒng)工程理論與實(shí)踐;2012年06期

4 梁德賽;吳兆福;;求解流水車間調(diào)度問(wèn)題改進(jìn)的蟻群算法研究[J];華中師范大學(xué)學(xué)報(bào)(自然科學(xué)版);2014年03期

5 周蓉;袁坤;;求解車間調(diào)度問(wèn)題的改進(jìn)型交叉配對(duì)策略[J];南昌航空大學(xué)學(xué)報(bào)(自然科學(xué)版);2011年04期

6 金超;葉春明;;基于QPSO算法的模糊流水車間調(diào)度問(wèn)題[J];計(jì)算機(jī)工程與應(yīng)用;2012年02期

7 劉烽;楊濤;游海;俎宇鵬;劉文明;;基于免疫克隆選擇算法的混合流水車間調(diào)度問(wèn)題的研究[J];計(jì)算機(jī)與網(wǎng)絡(luò);2011年21期

8 王金鵬;朱洪俊;周俊;;最優(yōu)子種群遺傳算法求解柔性流水車間調(diào)度問(wèn)題[J];計(jì)算機(jī)應(yīng)用研究;2012年02期

9 張其亮;陳永生;韓斌;;改進(jìn)的粒子群算法求解置換流水車間調(diào)度問(wèn)題[J];計(jì)算機(jī)應(yīng)用;2012年04期

10 張其亮;陳永生;;基于混合粒子群-NEH算法求解無(wú)等待柔性流水車間調(diào)度問(wèn)題[J];系統(tǒng)工程理論與實(shí)踐;2014年03期

相關(guān)博士學(xué)位論文 前2條

1 陶翼飛;面向分組加工的混合流水車間優(yōu)化調(diào)度問(wèn)題研究[D];昆明理工大學(xué);2013年

2 崔U，

本文編號(hào)：2317046