本文選題：蟻群算法 + 柔性作業(yè)車(chē)間調(diào)度　； 參考：《天津大學(xué)學(xué)報(bào)(自然科學(xué)與工程技術(shù)版)》2016年09期

【摘要】：調(diào)度問(wèn)題廣泛存在于資源共享型系統(tǒng)中,大多數(shù)的調(diào)度問(wèn)題都屬于混合整數(shù)規(guī)劃問(wèn)題.大規(guī)�；旌险麛�(shù)規(guī)劃問(wèn)題是計(jì)算科學(xué)領(lǐng)域中的NP-hard經(jīng)典問(wèn)題之一,一般認(rèn)為無(wú)法用精確計(jì)算求解.生產(chǎn)調(diào)度是調(diào)度的一個(gè)重要分支,是實(shí)現(xiàn)智能制造關(guān)鍵環(huán)節(jié)之一.針對(duì)多品種變批量柔性作業(yè)車(chē)間調(diào)度問(wèn)題,以最小制造期為優(yōu)化目標(biāo),設(shè)計(jì)了一種基于Petri網(wǎng)的異步并行蟻群算法,其中:提出了一種基于Petri網(wǎng)的步可達(dá)圖構(gòu)造方法,用于蟻群算法解空間的構(gòu)造;探討了傳統(tǒng)蟻群算法搜索機(jī)制,并給出了一種基于異步仿真時(shí)鐘的蟻群并行搜索方法;仿真結(jié)果表明,多線程控制方法可以有效地避免算法的早熟收斂問(wèn)題.將所提出的算法應(yīng)用于某安防件智能制造系統(tǒng)的柔性作業(yè)車(chē)間調(diào)度中,降低了系統(tǒng)的總制造時(shí)間,獲得較好工程效果的同時(shí)驗(yàn)證了算法的有效性.
[Abstract]:Scheduling problems exist widely in resource-sharing systems, and most scheduling problems belong to mixed integer programming problems. The large-scale mixed integer programming problem is one of the classical NP-hard problems in the field of computational science. Production scheduling is an important branch of scheduling and one of the key links to realize intelligent manufacturing. Aiming at the flexible job shop scheduling problem with multiple varieties and variable batches, an asynchronous parallel ant colony algorithm based on Petri nets is designed with the minimum manufacturing period as the optimization objective. Among them, a step Datuk construction method based on Petri nets is proposed. It is used to construct the solution space of ant colony algorithm. The traditional search mechanism of ant colony algorithm is discussed, and an ant colony parallel search method based on asynchronous simulation clock is presented. The simulation results show that, Multithread control method can effectively avoid the problem of premature convergence of the algorithm. The proposed algorithm is applied to the flexible job shop scheduling of an intelligent manufacturing system for a security component, which reduces the total manufacturing time of the system, obtains better engineering results and verifies the effectiveness of the algorithm.
【作者單位】： 天津大學(xué)機(jī)械工程學(xué)院;天津大學(xué)機(jī)構(gòu)理論與裝備設(shè)計(jì)教育部重點(diǎn)實(shí)驗(yàn)室;天津市數(shù)控系統(tǒng)技術(shù)工程中心;福州大學(xué)機(jī)械工程及自動(dòng)化學(xué)院;
【基金】：國(guó)家自然科學(xué)基金資助項(xiàng)目(51475324);國(guó)家自然科學(xué)基金青年基金資助項(xiàng)目(51105269)
【分類(lèi)號(hào)】：TP18;TB497

【相似文獻(xiàn)】

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

1 ;第34卷總目次[J];上海交通大學(xué)學(xué)報(bào);2000年12期

2 ;[J];;年期

相關(guān)會(huì)議論文 前1條

1 宋琦;陳璞;;有限元分析中結(jié)構(gòu)修改的算法設(shè)計(jì)[A];北京力學(xué)會(huì)第18屆學(xué)術(shù)年會(huì)論文集[C];2012年

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

1 肖立;智能算法在對(duì)地觀測(cè)計(jì)劃制定中的應(yīng)用[D];中國(guó)科學(xué)院研究生院（空間科學(xué)與應(yīng)用研究中心）;2008年

2 楊維嘉;布局問(wèn)題求解算法與策略的研究[D];天津大學(xué);2005年

，

本文編號(hào)：1810994