本文關(guān)鍵詞：柔性路徑下基于混合粒子群算法的跨單元調(diào)度方法　出處：《北京理工大學(xué)》2011年碩士論文　論文類(lèi)型：學(xué)位論文

  更多相關(guān)文章： 單元制造 跨單元 柔性路徑 車(chē)間調(diào)度 混合粒子群算法

【摘要】：跨單元調(diào)度是在單元制造的基礎(chǔ)上發(fā)展起來(lái)的,通常在單元制造系統(tǒng)中包含兩個(gè)或多個(gè)生產(chǎn)單元。在實(shí)際生產(chǎn)過(guò)程中,由于單元內(nèi)生產(chǎn)工藝的局限性,存在某些零件需要兩個(gè)或多個(gè)單元相互協(xié)作才能加工完成的情況,本文將那些需要跨單元生產(chǎn)的零件稱為異常零件。并根據(jù)生產(chǎn)調(diào)度的實(shí)際情況,對(duì)存在柔性路徑的跨單元調(diào)度問(wèn)題進(jìn)行了研究與實(shí)現(xiàn)。 本文首先介紹了單元制造系統(tǒng)和跨單元調(diào)度問(wèn)題,并且通過(guò)分析單元調(diào)度問(wèn)題國(guó)內(nèi)外研究現(xiàn)狀,提出了本文研究的重點(diǎn)柔性路徑下的跨單元調(diào)度問(wèn)題。 然后對(duì)柔性路徑下的跨單元調(diào)度問(wèn)題進(jìn)行分析和建模,與目前研究的跨單元調(diào)度問(wèn)題相比,本文提出了異常零件在跨單元生產(chǎn)時(shí)存在多條工藝路線,從而產(chǎn)生了路徑選擇的問(wèn)題,本文針對(duì)跨單元調(diào)度問(wèn)題中柔性路徑進(jìn)行了描述。 接下來(lái)本文詳細(xì)介紹了基于禁忌搜索的混合粒子群調(diào)度算法,介紹了用混合粒子群算法求解該調(diào)度問(wèn)題的原因,并提出了通過(guò)關(guān)鍵路徑來(lái)求解禁忌搜索中的鄰域解。通過(guò)仿真實(shí)驗(yàn)比較混合粒子群算法和基本粒子群算法在求解該調(diào)度問(wèn)題時(shí)的最優(yōu)值偏差率、CPU時(shí)間和機(jī)器負(fù)載,實(shí)驗(yàn)結(jié)果表明混合粒子群算法能夠有效的解決柔性路徑下的跨單元調(diào)度問(wèn)題,與基本粒子群算法相比,效率顯著提高。 最后,介紹了車(chē)間智能排產(chǎn)系統(tǒng)軟件的開(kāi)發(fā),詳細(xì)介紹了該系統(tǒng)中的分廠月計(jì)劃設(shè)置模塊的功能及詳細(xì)設(shè)計(jì)方案。
[Abstract]:Cross-cell scheduling is developed on the basis of cell manufacturing, usually contains two or more production units in the cell manufacturing system. In the actual production process, due to the limitations of the production process within the unit. Some parts need two or more units to cooperate with each other to complete the processing. In this paper, the parts that need cross-unit production are called abnormal parts, and according to the actual situation of production scheduling. The cross-cell scheduling problem with flexible paths is studied and implemented. This paper first introduces the cell manufacturing system and the cross-cell scheduling problem, and by analyzing the status quo of the cell scheduling problem at home and abroad, puts forward the cross-cell scheduling problem under the flexible path. Then, the cross-cell scheduling problem under flexible path is analyzed and modeled. Compared with the cross-cell scheduling problem studied at present, this paper proposes that there are many process routes in cross-cell production of abnormal parts. This paper describes the flexible path in cross-cell scheduling problem. Then, this paper introduces the Tabu search based hybrid particle swarm optimization algorithm in detail, and introduces the reasons why the hybrid particle swarm optimization algorithm is used to solve the scheduling problem. A critical path is proposed to solve the neighborhood solution in Tabu search. The optimal deviation rate of the hybrid particle swarm optimization algorithm and the basic particle swarm optimization algorithm in solving the scheduling problem is compared by simulation experiments. The experimental results show that the hybrid particle swarm optimization algorithm can effectively solve the cross-cell scheduling problem in flexible paths. Compared with the basic particle swarm optimization algorithm, the efficiency of the hybrid particle swarm optimization algorithm is significantly improved. Finally, the software development of workshop intelligent production scheduling system is introduced, and the function and detailed design scheme of the monthly planning module in the system are introduced in detail.
【學(xué)位授予單位】：北京理工大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2011
【分類(lèi)號(hào)】：TH165

【參考文獻(xiàn)】

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

1 苑麗紅,崔廣才;基于遺傳算法的柔性車(chē)間批量調(diào)度研究[J];長(zhǎng)春理工大學(xué)學(xué)報(bào);2005年03期

2 徐俊剛,戴國(guó)忠,王宏安;生產(chǎn)調(diào)度理論和方法研究綜述[J];計(jì)算機(jī)研究與發(fā)展;2004年02期

3 周泓;譚小衛(wèi);師瑞峰;;一種啟發(fā)式算法求解批量計(jì)劃和排序集成問(wèn)題[J];計(jì)算機(jī)工程與應(yīng)用;2006年20期

4 趙霽,王建國(guó);一種基于仿真模式的生產(chǎn)調(diào)度管理方法[J];計(jì)算機(jī)工程;2004年24期

5 吳曉丹,王云峰,朱昭賢,李杰;單元制造系統(tǒng)集成建模研究[J];計(jì)算機(jī)集成制造系統(tǒng)-CIMS;2000年02期

6 趙春霞,楊靜宇,王樹(shù)國(guó),蔡鶴皋,LiYF;基于多AGENT的機(jī)器人裝配系統(tǒng)結(jié)構(gòu)[J];系統(tǒng)仿真學(xué)報(bào);2000年03期

7 饒運(yùn)清,謝暢,李淑霞;基于多Agent的Job Shop調(diào)度方法研究[J];中國(guó)機(jī)械工程;2004年10期

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

1 賈兆紅;粒子群優(yōu)化算法在柔性作業(yè)車(chē)間調(diào)度中的應(yīng)用研究[D];中國(guó)科學(xué)技術(shù)大學(xué);2008年

2 張國(guó)輝;柔性作業(yè)車(chē)間調(diào)度方法研究[D];華中科技大學(xué);2009年

3 李新宇;工藝規(guī)劃與車(chē)間調(diào)度集成問(wèn)題的求解方法研究[D];華中科技大學(xué);2009年

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

1 劉林炬;引入禁忌搜索的雙種群粒子群算法及其應(yīng)用研究[D];江南大學(xué);2008年

，

本文編號(hào)：1420618