【摘要】：科技的快速發(fā)展加快了產(chǎn)品更新?lián)Q代的步伐,由此產(chǎn)生大量廢舊機(jī)電產(chǎn)品。實(shí)現(xiàn)廢舊機(jī)電產(chǎn)品的拆卸回收再利用不僅符合綠色制造的要求,還能緩解日益緊張的資源需求局面,且為拆卸企業(yè)帶來(lái)巨大的經(jīng)濟(jì)效益。拆卸線是實(shí)現(xiàn)規(guī)�；�、自動(dòng)化拆卸作業(yè)的必然選擇,拆卸線平衡問(wèn)題的研究具有重要的理論研究意義和廣泛的實(shí)際應(yīng)用價(jià)值。傳統(tǒng)生產(chǎn)線中固定工作站節(jié)拍時(shí)間的作業(yè)方式很難實(shí)現(xiàn)生產(chǎn)線的平衡,而斗鏈生產(chǎn)組織方式具有高度的平衡性,通過(guò)理論分析與數(shù)值仿真驗(yàn)證了考慮回取速度時(shí)斗鏈系統(tǒng)依然具有平衡性。進(jìn)而建立了基于斗鏈生產(chǎn)作業(yè)方式的拆卸線平衡問(wèn)題數(shù)學(xué)模型,該模型包含多個(gè)優(yōu)化目標(biāo),不僅考慮了生產(chǎn)線的平衡特性,還需盡早拆卸需求高、有危害的零部件,并盡可能減少拆卸方向改變次數(shù),以滿足對(duì)拆卸生產(chǎn)系統(tǒng)經(jīng)濟(jì)高效、安全環(huán)保等先進(jìn)制造工藝的要求。在求解多目標(biāo)拆卸線平衡問(wèn)題時(shí),為克服傳統(tǒng)求解方法不能很好的均衡存在多個(gè)沖突的目標(biāo)、求解結(jié)果單一等不足,設(shè)計(jì)了一種基于Pareto解集的多目標(biāo)人工魚(yú)群算法。為提高人工魚(yú)的尋優(yōu)能力,采用隨機(jī)交叉操作指導(dǎo)人工魚(yú)向最優(yōu)拆卸方向覓食。通過(guò)擁擠距離不斷篩選覓食、聚群、追尾行為過(guò)程中的非劣解,實(shí)現(xiàn)了各行為結(jié)果的多樣性,并將外部檔案中的非劣解添加到算法迭代種群中,加快了算法的收斂速度。通過(guò)實(shí)例驗(yàn)證了所設(shè)計(jì)算法具有較好的收斂性與分布性,進(jìn)而對(duì)不同規(guī)模任務(wù)的算例進(jìn)行求解,得到多種平衡方案,對(duì)比已有算法結(jié)果,驗(yàn)證了所設(shè)計(jì)算法的有效性與優(yōu)越性。將所建立的模型和所設(shè)計(jì)的算法應(yīng)用于實(shí)際拆卸線中,在求解回取速度相同的3人作業(yè)的發(fā)動(dòng)機(jī)斗鏈?zhǔn)讲鹦毒€平衡問(wèn)題中得到16種平衡方案,在求解回取速度不同的5人作業(yè)的打印機(jī)斗鏈?zhǔn)讲鹦毒€平衡問(wèn)題中得到20種平衡方案,均實(shí)現(xiàn)了生產(chǎn)作業(yè)的平衡,提高了有效作業(yè)時(shí)間,為決策者提供了廣泛的決策空間。因此,本文所建立的模型和所設(shè)計(jì)的算法能夠較好的解決拆卸線平衡問(wèn)題,有效改善了線平衡問(wèn)題,具有較強(qiáng)的適用性和廣闊的應(yīng)用前景。
[Abstract]:The rapid development of science and technology has accelerated the pace of product upgrading, resulting in a large number of used mechanical and electrical products. The realization of disassembly and recycling of used mechanical and electrical products not only meets the requirements of green manufacturing, but also alleviates the increasingly tight demand for resources, and brings enormous economic benefits to disassembly enterprises. Disassembly line is the inevitable choice to realize large-scale and automatic disassembly operation. The research of disassembly line balance has important theoretical significance and extensive practical application value. In the traditional production line, it is difficult to achieve the balance of the production line with the fixed workstation beat time, but the organization mode of the bucket chain production has a high balance. The theoretical analysis and numerical simulation show that the hopper chain system is still balanced when the retrieval speed is considered. Furthermore, the mathematical model of disassembly line balance problem based on bucket chain production mode is established. The model includes several optimization objectives, which not only considers the balance characteristics of production line, but also needs to disassemble parts with high demand and harm as soon as possible. In order to meet the requirements of advanced manufacturing processes such as economy, efficiency, safety and environmental protection, the times of disassembly direction change are reduced as much as possible. In order to solve the problem of multi-objective disassembly line balance, a multi-objective artificial fish swarm algorithm based on Pareto solution set is designed in order to overcome the problems of multiple conflicting targets in the traditional method. In order to improve the optimization ability of artificial fish, the random cross operation was used to guide the artificial fish to forage in the direction of optimal disassembly. The non-inferior solutions in the process of foraging, clustering and rear-end behavior are continuously selected by crowding distance. The diversity of the results of each behavior is realized, and the non-inferior solutions in the external files are added to the iterative population of the algorithm, thus speeding up the convergence of the algorithm. The proposed algorithm is proved to be convergent and distributed by an example, and various balancing schemes are obtained by solving the examples of different scale tasks. Compared with the results of the existing algorithms, the validity and superiority of the proposed algorithm are verified. The established model and the designed algorithm are applied to the actual disassembly line, and 16 balancing schemes are obtained in solving the engine bucket chain disassembly line balance problem with the same retrieval speed. In solving the balance problem of printer bucket disassembly line with different retrieval speed, 20 kinds of balancing schemes were obtained, which realized the balance of production operation, increased the effective working time, and provided a wide range of decision-making space for decision makers. Therefore, the model and the algorithm designed in this paper can solve the problem of disassembly line balance, effectively improve the line balance problem, and have a strong applicability and broad application prospects.
【學(xué)位授予單位】：西南交通大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2017
【分類號(hào)】：TP278;TP18

【相似文獻(xiàn)】

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

1 曾三友;蔡振華;張青;康立山;;一種評(píng)估近似Pareto前沿多樣性的方法[J];軟件學(xué)報(bào);2008年06期

2 周瑾;謝唯;;綜合使用序列分析和Pareto圖對(duì)工序集合的截取(英文)[J];上海第二工業(yè)大學(xué)學(xué)報(bào);2008年03期

3 ;Design of high performance multilayer microwave absorbers using fast Pareto genetic algorithm[J];Science in China(Series E:Technological Sciences);2009年09期

4 蔡瑞;齊佳音;;基于改進(jìn)的Pareto/NBD模型預(yù)測(cè)博客用戶在線行為[J];統(tǒng)計(jì)與信息論壇;2013年06期

5 張崗?fù)?姜曉兵;王書(shū)振;;網(wǎng)絡(luò)最大流Pareto擴(kuò)充研究[J];電子科技大學(xué)學(xué)報(bào);2006年01期

6 董紅斌;黃厚寬;何軍;侯薇;穆成坡;;一種混合策略的Pareto演化規(guī)劃[J];模式識(shí)別與人工智能;2006年06期

7 周秀玲;孫承意;;Pareto-MEC算法及其收斂性分析[J];計(jì)算機(jī)工程;2007年10期

8 宋冠英;李海楠;鄒玉靜;;一種基于Pareto解集的無(wú)約束條件的多目標(biāo)粒子群算法[J];機(jī)械工程師;2008年05期

9 陶媛;吳耿鋒;胡珉;;基于Pareto的多目標(biāo)進(jìn)化免疫算法[J];計(jì)算機(jī)應(yīng)用研究;2009年05期

10 ;Diversity of Pareto front: A multiobjective genetic algorithm based on dominating information[J];Journal of Control Theory and Applications;2010年02期

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

1 ;A Pareto-Based Differential Evolution Algorithm for Multi-objective Optimization Problems[A];Proceedings of 2010 Chinese Control and Decision Conference[C];2010年

2 周秀玲;孫承意;;Pareto-MEC算法的收斂性分析[A];2005年中國(guó)智能自動(dòng)化會(huì)議論文集[C];2005年

3 ;Multiobjective Optimization with Competitive Coevolutionary Genetic Algorithms[A];第二十九屆中國(guó)控制會(huì)議論文集[C];2010年

4 ;Study on New Coordination Mechanisms of Generalized Supply Chains with Loss-averse Agents[A];2009中國(guó)控制與決策會(huì)議論文集（3）[C];2009年

5 樊鐵成;馬孜;;Pareto前沿在航線優(yōu)化中的應(yīng)用[A];第16屆中國(guó)過(guò)程控制學(xué)術(shù)年會(huì)暨第4屆全國(guó)故障診斷與安全性學(xué)術(shù)會(huì)議論文集[C];2005年

6 徐安察;湯銀才;;Pareto分布下屏蔽數(shù)據(jù)的貝葉斯統(tǒng)計(jì)分析及其應(yīng)用[A];技術(shù)融合創(chuàng)新·可靠服務(wù)企業(yè)·安全產(chǎn)品制勝——2013年全國(guó)機(jī)械行業(yè)可靠性技術(shù)學(xué)術(shù)交流會(huì)暨第四屆可靠性工程分會(huì)第五次全體委員大會(huì)論文集[C];2013年

7 陳銀美;石連栓;;一種改進(jìn)的求解均勻分布Pareto解集的多目標(biāo)遺傳算法[A];中國(guó)運(yùn)籌學(xué)會(huì)第十屆學(xué)術(shù)交流會(huì)論文集[C];2010年

8 韓松;魏權(quán)齡;;非參數(shù)DEA模型最優(yōu)解的(弱)Pareto性質(zhì)研究[A];中國(guó)運(yùn)籌學(xué)會(huì)第七屆學(xué)術(shù)交流會(huì)論文集（上卷）[C];2004年

9 樊鐵成;馬孜;羅勛杰;;Pareto遺傳算法在集裝箱配載優(yōu)化中的應(yīng)用[A];第二十四屆中國(guó)控制會(huì)議論文集（下冊(cè)）[C];2005年

10 呂萍;李晴;宋吟秋;;考慮運(yùn)營(yíng)成本的公路Pareto有效BOT合同[A];中國(guó)系統(tǒng)工程學(xué)會(huì)第十八屆學(xué)術(shù)年會(huì)論文集——A02管理科學(xué)[C];2014年

，

本文編號(hào)：2168925