本文關(guān)鍵詞：基于遺傳模擬退火算法的電梯轎廂生產(chǎn)車間調(diào)度研究　出處：《廣東工業(yè)大學(xué)》2011年碩士論文　論文類型：學(xué)位論文

  更多相關(guān)文章： 車間調(diào)度 遺傳模擬退火算法 電梯轎廂 階段進(jìn)化

【摘要】：車間作業(yè)調(diào)度問題既是制造系統(tǒng)實(shí)際生產(chǎn)的重要問題,也是理論研究的難點(diǎn)之一。該問題是生產(chǎn)管理的核心問題,有效的車間作業(yè)調(diào)度方法的研究和應(yīng)用,對(duì)于制造企業(yè)提高產(chǎn)品質(zhì)量、降低生產(chǎn)成本、提高生產(chǎn)效率等方面起著至關(guān)重要的最用,越來越受到學(xué)者們的關(guān)注。 本文以中山某五金廠為背景,以電梯轎廂生產(chǎn)為研究對(duì)象,研究了電梯轎廂生產(chǎn)車間調(diào)度策略。針對(duì)電梯轎廂生產(chǎn)過程的特點(diǎn),進(jìn)行了數(shù)學(xué)抽象化描述,建立了該問題的數(shù)學(xué)模型。針對(duì)電梯轎廂生產(chǎn)車間調(diào)度問題的特性,為了避免傳統(tǒng)遺傳算法存在過早收斂及后期搜索效率低等問題,采用了階段進(jìn)化的自適應(yīng)遺傳模擬退火算法,并詳細(xì)分析了算法的設(shè)計(jì)過程。針對(duì)不同工件有不同工序數(shù)這一特點(diǎn),對(duì)傳統(tǒng)的基于工序的編碼方法進(jìn)行了改進(jìn)。運(yùn)用MATLAB編程對(duì)算例進(jìn)行了仿真,將改進(jìn)編碼方法的階段進(jìn)化的遺傳模擬退火算法求解的結(jié)果同改進(jìn)編碼方法的遺傳算法、傳統(tǒng)的階段進(jìn)化的遺傳模擬退火算法和傳統(tǒng)編碼方法的遺傳模擬退火算法進(jìn)行比較,顯示了本文改進(jìn)編碼方法的階段進(jìn)化的遺傳模擬退火算法求解調(diào)度模型的優(yōu)越性。 在電梯轎廂生產(chǎn)過程中,不同的工件有不同的工序數(shù),每一道加工工序上存在并行機(jī)且選擇不同的機(jī)器其加工時(shí)間不同,由此電梯轎廂生產(chǎn)調(diào)度問題不僅需要找到最佳的排序方案,還要選擇最合適的機(jī)器。因此在改進(jìn)編碼方法的基礎(chǔ)上采用了雙層編碼,第一層為工件安排的加工順序,第二層為選擇的機(jī)器。然后,對(duì)該編碼方法的階段進(jìn)化的遺傳模擬退火算法在電梯轎廂生產(chǎn)車間作業(yè)調(diào)度問題上的具體應(yīng)用進(jìn)行了詳細(xì)的設(shè)計(jì),主要包括：遺傳操作(選擇操作、交叉操作和變異操作)的設(shè)計(jì)、模擬退火操作的設(shè)計(jì)等等。最后,針對(duì)生產(chǎn)周期和提前/拖期懲罰的雙目標(biāo)調(diào)度模型,求解出電梯轎廂零部件生產(chǎn)的調(diào)度方案。
[Abstract]:An important issue in practical production system is not only the job shop scheduling problem, is also one of the difficulties of theoretic research. The problem is the core problem in production management, the research and application of job shop scheduling methods effectively, for manufacturing enterprises to improve product quality, reduce production cost, improve production efficiency play a crucial part, and more attention by scholars.
Based on the background of a hardware factory in Zhongshan, in the elevator car production as the research object, research on the job shop scheduling strategy of car production. According to the characteristics of elevator elevator car production process, the mathematical abstract description, established the mathematical model of the problem. According to the characteristics of the production scheduling problem of elevator students. In order to avoid the traditional genetic algorithm premature convergence and searching efficiency low, the evolutionary stage of adaptive genetic simulated annealing algorithm, and a detailed analysis of the design process of the algorithm. According to the different workpiece with the characteristics of different number of processes, the traditional encoding method based on process was improved. Simulated by MATLAB for example, the genetic algorithm with the improved encoding method of genetic simulated annealing algorithm for phase evolution will improve the encoding method of the results of the traditional genetic evolution stage The simulated annealing algorithm is compared with the traditional genetic algorithm simulated annealing algorithm, which shows the superiority of the improved genetic algorithm simulated annealing algorithm to solve the scheduling model.
In the elevator car production process, different parts have different number of processes, each process on existing parallel machines and choose different machine processing time is different, the elevator scheduling problem not only need to find the optimal ordering scheme, and choose the most suitable machine. It adopts double encoding based on improved encoding method, the processing sequence of the first layer of the workpiece arrangement, the second layer is the choice of the machine. Then, the detailed design, the specific application of genetic simulated annealing algorithm for the encoding stage of evolution method in the elevator car production workshop scheduling problem mainly include: genetic operation (selection operation, crossover and mutation) design, simulated annealing operation design and so on. Finally, according to the production cycle and the earliness / tardiness scheduling model of double objective punishment period, calculate the elevator A scheduling scheme for the production of parts and components.

【學(xué)位授予單位】：廣東工業(yè)大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2011
【分類號(hào)】：TH186;TP18

【參考文獻(xiàn)】

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

1 陳萍,郭金鋒;對(duì)Hopfield神經(jīng)網(wǎng)絡(luò)求解TSP的研究[J];北京郵電大學(xué)學(xué)報(bào);1999年02期

2 蔡良偉,張基宏,李霞;作業(yè)車間調(diào)度問題的多種群遺傳算法[J];電子學(xué)報(bào);2005年06期

3 戴紹利,譚躍進(jìn),汪浩;生產(chǎn)調(diào)度方法的系統(tǒng)研究[J];系統(tǒng)工程;1999年01期

4 謝勝利,董金祥,黃強(qiáng);基于遺傳算法的車間作業(yè)調(diào)度問題求解[J];計(jì)算機(jī)工程與應(yīng)用;2002年10期

5 何霆,劉飛,馬玉林,楊海;車間生產(chǎn)調(diào)度問題研究[J];機(jī)械工程學(xué)報(bào);2000年05期

6 王潮,宣國榮;人工神經(jīng)網(wǎng)絡(luò)求解TSP問題新方法[J];計(jì)算機(jī)應(yīng)用與軟件;2001年04期

7 吳悅,汪定偉;交貨期窗口下帶有附加懲罰的單機(jī)提前/拖期調(diào)度問題[J];控制理論與應(yīng)用;2000年01期

8 王凌,鄭大鐘;混合優(yōu)化策略統(tǒng)一結(jié)構(gòu)的探討[J];控制與決策;2002年01期

9 劉瑞華，，涂凍生;Fork──Join排隊(duì)網(wǎng)絡(luò)的建模與穩(wěn)定性[J];控制與決策;1994年03期

10 孫宇明;;作業(yè)車間調(diào)度問題的改進(jìn)混合遺傳算法[J];數(shù)學(xué)理論與應(yīng)用;2007年01期

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

1 李桂芬;鞠彥兵;;基于仿真和遺傳算法的車間調(diào)度優(yōu)化方法研究[A];2006中國控制與決策學(xué)術(shù)年會(huì)論文集[C];2006年

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

1 鞠全勇;智能制造系統(tǒng)生產(chǎn)計(jì)劃與車間調(diào)度的研究[D];南京航空航天大學(xué);2007年

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

1 尹作海;遺傳算法在車間調(diào)度問題中的研究與應(yīng)用[D];山東大學(xué);2009年

2 閆杰;基于混合遺傳算法的雙目標(biāo)車間作業(yè)調(diào)度研究[D];東北大學(xué)　;2009年

3 徐佳奇;基于Push與Pull相結(jié)合的電梯轎廂零件生產(chǎn)物流系統(tǒng)研究[D];上海交通大學(xué);2010年

本文編號(hào)：1408755