天堂国产午夜亚洲专区-少妇人妻综合久久蜜臀-国产成人户外露出视频在线-国产91传媒一区二区三区

當前位置:主頁 > 科技論文 > 機電工程論文 >

基于改進ICA算法的LBFFSP問題研究

發(fā)布時間:2018-12-16 04:42
【摘要】:為了解決帶有限緩沖區(qū)的柔性流水車間排產(chǎn)優(yōu)化問題(Limited-Buffer Flexible Flow-shop Scheduling Problem,LBFFSP),首先建立LBFFSP的數(shù)學模型,提出了一種改進帝國競爭算法(improved imperialist competitive algorithm,IICA)作為全局優(yōu)化算法,在標準帝國競爭算法基礎上,引入模擬退火思想,擴大算法搜索范圍,并加入離散化處理操作、改革操作、以及精英個體保留策略三處改進.為進一步提高算法搜索最優(yōu)解效率,設計了一種基于優(yōu)化目標的初始種群建立方法,并加入基于漢明距離的個體選擇機制,以提高初始種群中初始解的質量.設計仿真實驗,對算法中的參數(shù)進行分析探討,確定最佳參數(shù)值.最后通過實例測試,將IICA算法與其他算法進行對比研究,驗證了IICA算法對于解決柔性流水車間有限緩沖區(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.
【作者單位】: 沈陽建筑大學信息與控制工程學院;中國科學院沈陽自動化研究所;
【基金】:國家自然科學基金資助項目(61503259) 遼寧省科技廳項目(201602608)
【分類號】:TH165;TP18

【相似文獻】

相關碩士學位論文 前3條

1 董浩;基于改進人工蜂群算法的橋式起重機主梁優(yōu)化設計研究[D];中北大學;2016年

2 徐翠;改進極限學習機亞健康識別算法研究[D];遼寧大學;2016年

3 候聰亞;基于改進螢火蟲算法的橋式起重機主梁優(yōu)化方法研究[D];中北大學;2017年

,

本文編號:2381827

資料下載
論文發(fā)表

本文鏈接:http://sikaile.net/jixiegongchenglunwen/2381827.html


Copyright(c)文論論文網(wǎng)All Rights Reserved | 網(wǎng)站地圖 |

版權申明:資料由用戶9230e***提供,本站僅收錄摘要或目錄,作者需要刪除請E-mail郵箱bigeng88@qq.com