發(fā)布時(shí)間：2018-05-03 17:34

  本文選題：汽車(chē)零部件 + 拆卸序列規(guī)劃��； 參考：《大連理工大學(xué)》2016年碩士論文

【摘要】：隨著汽車(chē)工業(yè)的快速發(fā)展,汽車(chē)的產(chǎn)量和保有量也迅速增加,同時(shí)廢舊汽車(chē)的數(shù)量也在增加,對(duì)廢舊汽車(chē)的回收有利于解決資源短缺和環(huán)境污染問(wèn)題。汽車(chē)拆卸序列規(guī)劃問(wèn)題是汽車(chē)回收中的重要組成部分,拆卸序列的好壞直接影響著汽車(chē)拆卸中的成本和效率,同時(shí)也影響汽車(chē)零部件回收的質(zhì)量或維修成本。本文結(jié)合在國(guó)內(nèi)外研究現(xiàn)狀的基礎(chǔ)上,對(duì)汽車(chē)零部件拆卸序列的建模和序列優(yōu)化算法進(jìn)行了研究,提出了汽車(chē)產(chǎn)品拆卸序列規(guī)劃的方法。本文通過(guò)對(duì)汽車(chē)零部件拆卸信息的分析,在拆卸與或圖的基礎(chǔ)上,利用一系列的演變規(guī)則建立了汽車(chē)產(chǎn)品拆卸網(wǎng)絡(luò)圖,用拆卸網(wǎng)絡(luò)圖來(lái)表示汽車(chē)產(chǎn)品拆卸時(shí)的所有可能序列,用關(guān)聯(lián)矩陣來(lái)表示零部件之間的約束關(guān)系,用鄰接矩陣表示拆卸過(guò)程中權(quán)重,如拆卸時(shí)間和拆卸效益,從而建立汽車(chē)零部件拆卸模型。其次,本文建立了合適的目標(biāo)函數(shù),通過(guò)引入解決最短路徑的Floyd算法,將其與汽車(chē)拆卸模型相映射,然后對(duì)賦權(quán)拆卸模型進(jìn)行了求解,得到符合要求的最優(yōu)拆卸序列,從而實(shí)現(xiàn)了Floyd算法與汽車(chē)產(chǎn)品拆卸序列規(guī)劃問(wèn)題的結(jié)合。最后,為了驗(yàn)證本文建立的拆卸模型和算法的有效性,本文應(yīng)用汽車(chē)硅油風(fēng)扇離合器進(jìn)行了驗(yàn)證,得到了三種拆卸目的下的拆卸序列,表明了拆卸模型的有效性和算法的可行性。
[Abstract]:With the rapid development of automobile industry, the output and ownership of automobiles are increasing rapidly, and the number of used and used vehicles is also increasing. The recovery of used and wasted vehicles is helpful to solve the problems of resource shortage and environmental pollution. The problem of automobile disassembly sequence planning is an important part of automobile recovery. The quality of disassembly sequence directly affects the cost and efficiency of automobile disassembly, and also affects the quality or maintenance cost of automobile parts recovery. Based on the present research situation at home and abroad, this paper studies the modeling and sequence optimization algorithm of disassembly sequence of automobile parts, and puts forward the method of disassembly sequence planning for automobile products. Based on the analysis of the disassembly information of automobile parts and components, and on the basis of disassembly and OR graph, a disassembly network diagram of automobile product is established by using a series of evolution rules. The disassembly network graph is used to represent all the possible sequences of disassembly of automobile product. The relational matrix is used to express the constraint relation between parts, and the adjacent matrix is used to express the weight of the disassembly process, such as the disassembly time and the disassembly benefit, so as to establish the disassembly model of automobile parts. Secondly, an appropriate objective function is established. By introducing the Floyd algorithm to solve the shortest path, it is mapped to the vehicle disassembly model, and then the weighted disassembly model is solved to obtain the optimal disassembly sequence that meets the requirements. Thus, the combination of Floyd algorithm and automobile product disassembly sequence planning problem is realized. Finally, in order to verify the validity of the disassembly model and algorithm established in this paper, three disassembly sequences are obtained by using silicon oil fan clutch. The validity of the disassembly model and the feasibility of the algorithm are demonstrated.
【學(xué)位授予單位】：大連理工大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2016
【分類(lèi)號(hào)】：X734.2

【相似文獻(xiàn)】

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

1 吳果林;;礦井地理網(wǎng)絡(luò)模型最短路徑的Floyd動(dòng)態(tài)優(yōu)化算法[J];煤炭技術(shù);2013年01期

2 米宏軍;盧才武;馮治東;;Floyd最短路徑算法在汝陽(yáng)露天礦選廠選址中的應(yīng)用[J];選煤技術(shù);2012年03期

3 ;[J];;年期

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

1 ;A Floyd-like Algorithm for Optimization of Mix-Valued Logical Control Networks[A];中國(guó)自動(dòng)化學(xué)會(huì)控制理論專(zhuān)業(yè)委員會(huì)B卷[C];2011年

2 胡啟敏;薛錦云;;Solving Path Problems with Component Composition[A];2006年全國(guó)理論計(jì)算機(jī)科學(xué)學(xué)術(shù)年會(huì)論文集[C];2006年

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

1 王U，

本文編號(hào)：1839435