Disassembly Sequence Optimization Based On Contact Connection And Interference

For the purpose of resource and energy saving and environmental protection,the product should be fully and effectively utilized and updated or safely dispose after the end of the life.At present,the increasingly complex mechanical product structure and materials,research on disassembly sequence planning is under increasing challenge.Establishment of reasonable disassembly model and algorithm for disassembly sequence is the key to solve the problem.A series of method to generate,evaluate and optimize product disassembly sequences in large scale has been proposed based on the research home and abroad.Research contents of this thesis are as follows:1.In order to quickly and effectively get disassembly knowledge,build knowledge base based on connection element and collect and organize all kinds of disassembly knowledge in order to provide data guarantee for the decision-making process under different conditions.2.The disassembly model has been proposed based on the relationship of liaison and interference in the light of the characteristics of disassembly,which is different from that based on minimum disassembly unit.It is based on the fact that the essence of disassembly is removing relationships,rather than the separation of minimum parts.The Liaison and interference graph has been established and described by matrix based on the relationship of connection and interference.Then disassembly path generation will be converted to that searching for optimal path considering interference in disassembly path graph.3.Algorithm of identifying and generating subassemblies was proposed based on graph models and judgment matrices after analysing contacts,connections and interferences between the parts in the assembly and corresponding models and matrices for solving the problem of "combinatorial explosion" in DSP effectively.Elements in subassembly collection can be added utilizing graph models and can be decreased utilizing judgment matrices after analysing contacts,connections and interferences between the parts in the assembly and corresponding models and matrices.Potential subassembly collection has been generated retrieving the graph models in terms of criteria of subassembly recognition.The assemblies will be excluded that don't conform to principles of continuity,stability and feasibility in terms of matrix determination formula.4.Genetic algorithm good at global search and simulated annealing algorithm good at local search have been combined properly for DSP.Operation and parameter selection have been analysed according to the features of DSP,and then the process is given.At last the case shows the feasibility and good search capability of this algorithm,especially suitable for complex product.Disassembly sequence optimization based on contact,connection and interference provides feasibility for actual production and with the development of artificial intelligence,and computer hardware and software technology,research on disassembly sequence planning will become integrated and develop further.