当前位置:主页 > 科技论文 > 环境工程论文 >

基于拆卸网络图的汽车零部件拆卸序列研究

发布时间:2018-05-03 17:34

  本文选题:汽车零部件 + 拆卸序列规划 ; 参考:《大连理工大学》2016年硕士论文


【摘要】:随着汽车工业的快速发展,汽车的产量和保有量也迅速增加,同时废旧汽车的数量也在增加,对废旧汽车的回收有利于解决资源短缺和环境污染问题。汽车拆卸序列规划问题是汽车回收中的重要组成部分,拆卸序列的好坏直接影响着汽车拆卸中的成本和效率,同时也影响汽车零部件回收的质量或维修成本。本文结合在国内外研究现状的基础上,对汽车零部件拆卸序列的建模和序列优化算法进行了研究,提出了汽车产品拆卸序列规划的方法。本文通过对汽车零部件拆卸信息的分析,在拆卸与或图的基础上,利用一系列的演变规则建立了汽车产品拆卸网络图,用拆卸网络图来表示汽车产品拆卸时的所有可能序列,用关联矩阵来表示零部件之间的约束关系,用邻接矩阵表示拆卸过程中权重,如拆卸时间和拆卸效益,从而建立汽车零部件拆卸模型。其次,本文建立了合适的目标函数,通过引入解决最短路径的Floyd算法,将其与汽车拆卸模型相映射,然后对赋权拆卸模型进行了求解,得到符合要求的最优拆卸序列,从而实现了Floyd算法与汽车产品拆卸序列规划问题的结合。最后,为了验证本文建立的拆卸模型和算法的有效性,本文应用汽车硅油风扇离合器进行了验证,得到了三种拆卸目的下的拆卸序列,表明了拆卸模型的有效性和算法的可行性。
[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.
【学位授予单位】:大连理工大学
【学位级别】:硕士
【学位授予年份】:2016
【分类号】:X734.2

【相似文献】

相关期刊论文 前3条

1 吴果林;;矿井地理网络模型最短路径的Floyd动态优化算法[J];煤炭技术;2013年01期

2 米宏军;卢才武;冯治东;;Floyd最短路径算法在汝阳露天矿选厂选址中的应用[J];选煤技术;2012年03期

3 ;[J];;年期

相关会议论文 前2条

1 ;A Floyd-like Algorithm for Optimization of Mix-Valued Logical Control Networks[A];中国自动化学会控制理论专业委员会B卷[C];2011年

2 胡启敏;薛锦云;;Solving Path Problems with Component Composition[A];2006年全国理论计算机科学学术年会论文集[C];2006年

相关硕士学位论文 前4条

1 王U,

本文编号:1839435


资料下载
论文发表

本文链接:https://www.wllwen.com/kejilunwen/huanjinggongchenglunwen/1839435.html


Copyright(c)文论论文网All Rights Reserved | 网站地图 |

版权申明:资料由用户fd9aa***提供,本站仅收录摘要或目录,作者需要删除请E-mail邮箱bigeng88@qq.com