本文選題：動態(tài)調(diào)度　切入點：模擬退火算法　出處：《山東大學(xué)》2017年碩士論文　論文類型：學(xué)位論文

【摘要】：隨著全球經(jīng)濟(jì)迅速發(fā)展,制造業(yè)競爭異常激烈,生產(chǎn)方式逐漸轉(zhuǎn)向高柔性、小批量,為此必須提高快速響應(yīng)市場的能力,在保證質(zhì)量的同時盡可能的縮短產(chǎn)品周期、減少庫存,從而提升自身的核心競爭力。生產(chǎn)的環(huán)境是復(fù)雜多變的,車間在制造加工過程中存在著訂單取消、機(jī)器損壞、交貨期變更等不確定的擾動因素,因此車間制造中如何制定合理的調(diào)度方案顯得尤為重要,人們迫切需要對實際生產(chǎn)中的車間調(diào)度問題做深入和廣泛的研究來更好地指導(dǎo)生產(chǎn),車間動態(tài)調(diào)度問題越來越受到重視。許多研究顯示單一的算法難以解決復(fù)雜的調(diào)度問題,算法之間的結(jié)合有更強(qiáng)的搜索能力。論文在研究了各種算法的基礎(chǔ)上,引入局部搜索能力較強(qiáng)的模擬退火算法與遺傳算法相結(jié)合,防止算法陷入局部最優(yōu)。兩種算法優(yōu)勢互補,使得在解空間搜索的集中性和廣泛性得以平衡,彌補了各自單一算法的缺點。在算法的操作和參數(shù)上做了一定的改進(jìn),使算法更加有效,并通過對典型車間調(diào)度問題仿真實驗以及將優(yōu)化結(jié)果與其他算法所得結(jié)果進(jìn)行比較,驗證模擬退火遺傳算法的有效性�？紤]到實際生產(chǎn)復(fù)雜多變的環(huán)境、加工過程中經(jīng)常出現(xiàn)的不確定性擾動事件,針對制造企業(yè)在生產(chǎn)復(fù)雜零部件過程中可能出現(xiàn)的幾個主要的擾動事件,研究了動態(tài)環(huán)境下的車間調(diào)度問題,改進(jìn)了調(diào)度模型,設(shè)計了更符合實際要求的目標(biāo)函數(shù)。采用了事件驅(qū)動的再調(diào)度機(jī)制,結(jié)合滾動窗口技術(shù)將上一章提出的模擬退火遺傳算法在線優(yōu)化各個滾動區(qū)間內(nèi)進(jìn)行優(yōu)化調(diào)度。利用上述方法對交貨期提前、緊急插單、機(jī)器故障、工件隨機(jī)到達(dá)、部件殘品這幾個擾動事件產(chǎn)生時的具體的解決方案和流程做了詳細(xì)的闡述,并通過對實際案例進(jìn)行仿真,得出的調(diào)度方案滿足實際加工生產(chǎn)的要求,證明了所提出方法的可行性和有效性。為了更直觀的驗證上述研究成果的可行性,用Flexsim軟件對所得出的調(diào)度方案進(jìn)行模擬仿真,利用實際案例詳細(xì)介紹了仿真過程以及注意事項。對仿真結(jié)果進(jìn)行了有效的分析,對存在問題的地方提出了相應(yīng)的改進(jìn)方案,使結(jié)果更加符合實際車間調(diào)度要求。而且在前幾章對車間動態(tài)調(diào)度問題研究的基礎(chǔ)上,利用Vb.net、Matlab、SQL Server構(gòu)建了便于管理調(diào)度的車間調(diào)度系統(tǒng),對系統(tǒng)的總體結(jié)構(gòu)設(shè)計、各功能模塊的作用及實現(xiàn)流程進(jìn)行了界面展示和相應(yīng)介紹,為實際生產(chǎn)加工中調(diào)度問題的解決提供了方便的平臺。最后,總結(jié)了全文所做的工作,對車間調(diào)度的發(fā)展方向做了展望。
[Abstract]:With the rapid development of the global economy and the fierce competition in the manufacturing industry, the mode of production has gradually shifted to high flexibility and small quantities. Therefore, the ability to respond to the market quickly must be improved, and the product cycle should be kept as short as possible while the quality is guaranteed, and the inventory is reduced. The production environment is complex and changeable. During the process of manufacturing, there are uncertain disturbance factors, such as order cancellation, machine damage, change of delivery date, etc. Therefore, it is very important to make a reasonable scheduling scheme in the workshop manufacturing. People urgently need to do in-depth and extensive research on the job shop scheduling problem in actual production to better guide the production. More and more attention has been paid to the job-shop dynamic scheduling problem. Many researches show that the single algorithm is difficult to solve the complex scheduling problem, and the combination of the algorithms has stronger searching ability. The combination of simulated annealing algorithm (SA) with genetic algorithm (GA), which has strong local search ability, is introduced to prevent the algorithm from falling into local optimum. The advantages of the two algorithms complement each other and balance the centrality and extensiveness of search in solution space. Some improvements have been made in the operation and parameters of the algorithm to make the algorithm more effective. The simulation experiments of typical job-shop scheduling problems and the comparison of the optimization results with the results of other algorithms are carried out. Verify the effectiveness of the simulated annealing genetic algorithm. Considering the complex and changeable environment of actual production, the uncertain disturbance events often occur in the processing process. Aiming at some main disturbance events that may occur in the process of manufacturing complex parts, the scheduling problem in dynamic environment is studied, and the scheduling model is improved. A more practical objective function is designed, and an event-driven rescheduling mechanism is adopted. Combined with the rolling window technique, the simulated annealing genetic algorithm proposed in the previous chapter is used to optimize the optimal scheduling of each rolling interval online. The specific solution and flow of these disturbance events are described in detail, and through the simulation of actual cases, the scheduling scheme is obtained to meet the requirements of actual processing and production. The feasibility and effectiveness of the proposed method are proved. In order to verify the feasibility of the above research results more intuitively, the proposed scheduling scheme is simulated by Flexsim software. The simulation process and points for attention are introduced in detail with practical cases. The simulation results are analyzed effectively, and the corresponding improvement schemes are put forward for the existing problems. On the basis of the research on the dynamic scheduling problem of the job shop in the previous chapters, a job shop scheduling system which is convenient for management and scheduling is constructed by using VB. Net Matlab / SQL Server. The overall structure of the system is designed. The function and realization flow of each function module are displayed and introduced accordingly, which provides a convenient platform for solving the scheduling problem in actual production and processing. Finally, the work done in this paper is summarized. The development trend of job shop scheduling is prospected.
【學(xué)位授予單位】：山東大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2017
【分類號】：TP18;TB497

【相似文獻(xiàn)】

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

1 陶春華,馬光文,涂揚舉,徐剛,左幸;實碼退火遺傳算法在廠內(nèi)經(jīng)濟(jì)運行中的應(yīng)用[J];四川大學(xué)學(xué)報(工程科學(xué)版);2005年06期

2 周平;;集裝箱裝箱優(yōu)化研究[J];港口科技;2007年10期

3 汪鵬君;陸金剛;曾曉洋;;基于整體退火遺傳算法的低功耗最佳極性搜索[J];計算機(jī)輔助設(shè)計與圖形學(xué)學(xué)報;2008年01期

4 謝經(jīng)明;徐小鳳;陳冰;陳幼平;艾武;;基于模擬退火遺傳算法的電動汽車網(wǎng)絡(luò)優(yōu)化調(diào)度[J];中國機(jī)械工程;2007年14期

5 苗玉彬,劉成良,趙爽,滕弘飛;一種基于人機(jī)交互的退火遺傳算法[J];上海交通大學(xué)學(xué)報;2003年11期

6 謝云峰;黃美發(fā);鐘艷如;匡兵;;基于模擬退火遺傳算法的拆卸路徑規(guī)劃[J];機(jī)械工程師;2007年01期

7 湯暉;李潤;許倫輝;黃艷國;;基于貪心退火遺傳算法的車輛圖像分割研究[J];交通與計算機(jī);2007年04期

8 鄒玲,石冰心;網(wǎng)絡(luò)劃分優(yōu)化的退火遺傳算法[J];華中理工大學(xué)學(xué)報;1999年03期

9 劉占軍;;基于模擬退火遺傳算法汽車覆蓋件彈復(fù)量優(yōu)化診斷研究[J];塑性工程學(xué)報;2007年02期

10 艾寶利;武昌;;裝備維修資源優(yōu)化中的模擬退火遺傳算法[J];火力與指揮控制;2010年01期

相關(guān)會議論文 前3條

1 胡家君;郭靜波;陸文娟;;一種應(yīng)用于配電網(wǎng)電力線通信資源分配的模擬退火遺傳算法[A];2007年中國智能自動化會議論文集[C];2007年

2 張煜東;吳樂南;;一種改進(jìn)的分布式模擬退火遺傳算法用于圖像插值[A];第三屆和諧人機(jī)環(huán)境聯(lián)合學(xué)術(shù)會議（HHME2007）論文集[C];2007年

3 劉從新;吉培榮;曾維魯;;整體退火遺傳算法用于FIR濾波器的頻率采樣設(shè)計[A];中國儀器儀表學(xué)會第五屆青年學(xué)術(shù)會議論文集[C];2003年

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

1 苗玉彬;逆攝動法和人機(jī)交互退火遺傳算法及其應(yīng)用[D];大連理工大學(xué);2001年

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

1 張姍姍;SAGA的研究及其在灰色預(yù)測與多目標(biāo)庫存優(yōu)化中的應(yīng)用[D];華南理工大學(xué);2015年

2 張勝良;基于接觸聯(lián)接干涉關(guān)系的拆卸序列優(yōu)化[D];浙江工業(yè)大學(xué);2016年

3 劉q，

本文編號：1611761