Research On Disassembly Sequence Planning Based On Improved Genetic Algorithm

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.