基于改進(jìn)ICA算法的LBFFSP問題研究
發(fā)布時(shí)間：2018-12-16 04:42
【摘要】：為了解決帶有限緩沖區(qū)的柔性流水車間排產(chǎn)優(yōu)化問題(Limited-Buffer Flexible Flow-shop Scheduling Problem,LBFFSP),首先建立LBFFSP的數(shù)學(xué)模型,提出了一種改進(jìn)帝國競(jìng)爭(zhēng)算法(improved imperialist competitive algorithm,IICA)作為全局優(yōu)化算法,在標(biāo)準(zhǔn)帝國競(jìng)爭(zhēng)算法基礎(chǔ)上,引入模擬退火思想,擴(kuò)大算法搜索范圍,并加入離散化處理操作、改革操作、以及精英個(gè)體保留策略三處改進(jìn).為進(jìn)一步提高算法搜索最優(yōu)解效率,設(shè)計(jì)了一種基于優(yōu)化目標(biāo)的初始種群建立方法,并加入基于漢明距離的個(gè)體選擇機(jī)制,以提高初始種群中初始解的質(zhì)量.設(shè)計(jì)仿真實(shí)驗(yàn),對(duì)算法中的參數(shù)進(jìn)行分析探討,確定最佳參數(shù)值.最后通過實(shí)例測(cè)試,將IICA算法與其他算法進(jìn)行對(duì)比研究,驗(yàn)證了IICA算法對(duì)于解決柔性流水車間有限緩沖區(qū)的排產(chǎn)優(yōu)化問題的有效性.
[Abstract]:In order to solve the problem of flexible flow shop scheduling optimization (Limited-Buffer Flexible Flow-shop Scheduling Problem,LBFFSP) with finite buffer zone, the mathematical model of LBFFSP is first established, and an improved imperial competition algorithm (improved imperialist competitive algorithm, is proposed. IICA) as a global optimization algorithm, based on the standard imperial competition algorithm, the simulated annealing algorithm is introduced, the search scope of the algorithm is expanded, and three improvements are introduced, such as discretization operation, reform operation, and elite individual retention strategy. In order to improve the efficiency of searching the optimal solution, a method of establishing the initial population based on the optimization objective is designed, and an individual selection mechanism based on hamming distance is added to improve the quality of the initial solution in the initial population. Design the simulation experiment, analyze the parameters in the algorithm, and determine the best parameter value. Finally, the IICA algorithm is compared with other algorithms through an example test, which verifies the effectiveness of the IICA algorithm in solving the scheduling optimization problem of flexible workshop limited buffer.
【作者單位】： 沈陽建筑大學(xué)信息與控制工程學(xué)院;中國科學(xué)院沈陽自動(dòng)化研究所;
【基金】：國家自然科學(xué)基金資助項(xiàng)目(61503259) 遼寧省科技廳項(xiàng)目(201602608)
【分類號(hào)】：TH165;TP18
本文編號(hào)：2381827
[Abstract]:In order to solve the problem of flexible flow shop scheduling optimization (Limited-Buffer Flexible Flow-shop Scheduling Problem,LBFFSP) with finite buffer zone, the mathematical model of LBFFSP is first established, and an improved imperial competition algorithm (improved imperialist competitive algorithm, is proposed. IICA) as a global optimization algorithm, based on the standard imperial competition algorithm, the simulated annealing algorithm is introduced, the search scope of the algorithm is expanded, and three improvements are introduced, such as discretization operation, reform operation, and elite individual retention strategy. In order to improve the efficiency of searching the optimal solution, a method of establishing the initial population based on the optimization objective is designed, and an individual selection mechanism based on hamming distance is added to improve the quality of the initial solution in the initial population. Design the simulation experiment, analyze the parameters in the algorithm, and determine the best parameter value. Finally, the IICA algorithm is compared with other algorithms through an example test, which verifies the effectiveness of the IICA algorithm in solving the scheduling optimization problem of flexible workshop limited buffer.
【作者單位】： 沈陽建筑大學(xué)信息與控制工程學(xué)院;中國科學(xué)院沈陽自動(dòng)化研究所;
【基金】：國家自然科學(xué)基金資助項(xiàng)目(61503259) 遼寧省科技廳項(xiàng)目(201602608)
【分類號(hào)】：TH165;TP18
【相似文獻(xiàn)】
相關(guān)碩士學(xué)位論文 前3條
1 董浩;基于改進(jìn)人工蜂群算法的橋式起重機(jī)主梁優(yōu)化設(shè)計(jì)研究[D];中北大學(xué);2016年
2 徐翠;改進(jìn)極限學(xué)習(xí)機(jī)亞健康識(shí)別算法研究[D];遼寧大學(xué);2016年
3 候聰亞;基于改進(jìn)螢火蟲算法的橋式起重機(jī)主梁優(yōu)化方法研究[D];中北大學(xué);2017年
，本文編號(hào)：2381827
本文鏈接：http://sikaile.net/jixiegongchenglunwen/2381827.html
最近更新
教材專著
