节点文献
基于改进遗传算法的拆卸序列规划
Research on Disassembly Sequence Planning Based on Improved Genetic Algorithm
【作者】 周琦;
【导师】 李明富;
【作者基本信息】 湘潭大学 , 机械工程(专业学位), 2015, 硕士
【摘要】 在当下,科学技术的迅猛发展使得产品更新和换代的周期变得越来越短。对进入生命终端的产品进行零件的回收再利用和材料的回收可以有效地减少环境污染以及节省资源。要想实现产品的回收首先要对产品进行拆卸,产品拆卸的研究最重要的工作就是关于拆卸序列规划的探讨。拆卸序列规划是指为了尽可能减少拆卸所需成本,在符合拆卸产品零件可行的拆卸基础上,找出最优零件拆卸序列。本文结合国内外专家的研究成果,在拆卸序列问题上做出了进一步分析,提出了一种以改进遗传算法为基础的拆卸序列规划研究思路。主要内容如下:首先,总结了拆卸序列规划问题中常用拆卸信息建模方法,本文采用以混合图模型为基础建立产品拆卸信息的模型,该产品中混合图模型由稳定连接矩阵、拆卸优先约束矩阵以及信息矩阵构成,其中稳定连接矩阵能描述零件间的紧固连接关系。稳定连接矩阵和拆卸优先约束矩阵包含了产品中零件间装配关系以及优先约束关系,拆卸信息矩阵包含着拆卸方法及拆卸工具等拆卸根本要素。其次,介绍初始可行拆卸序列生成的主要方法,基于定向搜索策略在产品拆卸信息模型中的连接矩阵和拆卸优先约束矩阵所描述的零件间约束关系的引导下,通过在Matlab上编程实现满足约束关系的初始序列的生成。最后,建立以拆卸时间为评价标准的产品拆卸序列规划适应度函数,并在传统遗传算法的基础上引进二叉树算法进行初始序列的优化,由此改进了遗传算法的查找和搜寻能力,最后将算法运用于实例虎钳装配体,通过对虎钳装配体建模和数据提取最终验证了算法的可行性。
【Abstract】 At present,the rapid development of the science and technology makes the upgrade of products faster and faster,Recycling and recycling of parts of life of terminal products can effectively reduce environmental pollution and save resources.The premise of the recovery is to disassemble the product,and the main task of the product dismantlement is disassembly sequence planning.Disassembly sequence planning means that in order to minimize the cost of demolition,find out the optimal disassembly sequence on the basis of the parts of the product can be disassembled.In this paper,based on the achievements of domestic and foreign experts in the disassembly sequence made a further analysis of the problem,put forward a kind of improve Genetic Algorithm based on disassembly sequence planning research. The main contents are as follows:By summarizing the disassembly sequence planning information modeling methods which commonly used in the demolition. we use a hybrid model-based chart to establish product disassembly information model, The hybrid graph model of the products is composed of connection matrix,precedence constraint matrix and the information matrix. The connection matrix and disassembly priority restriction matrix contains the assembly relation and precedence constraints between the parts of product. the disassembly information matrix contains the basic information about disassembly such as dismantling method and tools.It also introduces the main methods of initial feasible disassembly sequence generation, based on the constraint relationship among parts which described by the connection matrix and disassembly priority restriction matrix, to generate the initial sequence meet the geometric constraints through the Matlab.Finally,to establish a fitness function of product disassembly sequence planning,then introduce the binomial tree model to Genetic Algorithm,the initial disassembly sequence can begin to assess thus improve the search capacity.Then the algorithm is applied to the instance,and to verify the algorithm can be used.