The Researching And Planning Disassembly Process Of Mechanical And Electronic Products Based On Intelligent Optimization Algorithm

With increasingly rapid pace of life,the level of life is higher.The upgrading of products is becoming more and more quickly,so we must take into account the recycling and reuse waste products,especially the annual processing of large amounts of electronic waste.However,the disassembly is the premise of recycling,and the research on the mechanical and electrical products can greatly save the cost and improve the efficiency of disassembly.Disassembly process planning of mechanical and electrical products is a key in the research of product disassembly and recycling.Disassembly sequence planning problem belongs to NP-complete mathematical model,with the increase of product complexity,it is very complex and difficult to plan the disassembly process.In this paper,we use the intelligent optimization algorithm to solve the disassembly sequence planning problem of complex mechanical and electrical products.The main research contents of this paper include the following three aspects:(1)First,The article introduce the related research on disassembly information model,including the concept and types of disassembly,disassembly information products,disassembly information model classification.Based on the analysis of existing models,I Improved disassembly information model.When we disassembly information matrix,It is include disassembly object,constraint type,disassembly direction,disassembly tool and disassembly cost.The new matrix greatly enriches the information of the model.In order to be able to read the computer,we carried out the digital information processing.These measures lay the foundation for the next intelligent algorithm to solve the disassembly sequence.(2)Introduced the characteristics of intelligent optimization algorithm,introduced the principle and mathematical model of ant colony algorithm,For the lack of ant colony algorithm,I increase the path constraints,includedthe updating rule of local pheromone concentration,Proposed an improved ant colony algorithm based on disassembly precedence constraint matrix,coding using MATLAB,This method is verified with a certain type of washing machine.It proves the feasibility of the improved ant colony algorithm(3)This article introduces the principle and mathematical model of standard genetic algorithm,research and application of disassembly sequence planning.Aiming at the shortcomings of premature convergence and local search,I have improved the genetic algorithm,the genetic algorithm and the general process,proposes an adaptive genetic algorithm based on disassembly precedence matrix.Using MATLAB algorithm for the specific coding and calculation for an example of a washing machine.It achieved good results,also proved the feasibility and effectiveness of the improved algorithm.The results of ant colony algorithm and genetic algorithm are analyzed and compared.(4)On the evaluation of disassembly scheme,I put forward the multi index evaluation system based on the ideal formula,considering the technical,economic and environmental impact of product disassembly,I establish a evaluation index system of disassembly sequence.Analysis of a few feasible disassembly sequences and multi index evaluation to disassembly sequence with comprehensive index optimization.It provides a feasible and effective method for the evaluation of disassembly sequence.