Disassembly Sequence Panning Based On Improved Quantum Genetic Algorithm

The increasing of end-of-life (EOL) produces have brought unprecedented pressure to the ecological resources and environment all over the world. The technologies of disassembly and remanufacturing are becoming research focussed in the world. Most EOL products cannot be reminiscence only because they cannot be disassembled well.Aiming at the EOL products, using Quantum Genetic Algorithm, this dissertation focuses on the research on disassembly modeling, the decision of the optimal disassembly sequence planning and the improvement of Quantum Genetic Algorithm. The main contents are as following:(1) Product disassembly information model is the basis of the study and is one of the main contents of disassembly sequence planning. In this thesis, a detailed analysis of assembly modeling research status is brought forward firstly, utilizing hybrid disassembly graph and precedence matrix express the relationship between components, expressing product information with disassembly information matrix. Meanwhile, the paper also presents a matrix expression product disassembly sequence method, uses precedence matrix generating extended precedence matrix, and then assign the variable elements in extended precedence matrix, we can obtain a sequence matrix.(2) Quantum genetic algorithm is an efficient optimization algorithm has been applied to solve many optimization problems. This paper fully studied the traditional quantum genetic algorithm, summed up the conventional quantum genetic limitations. On this basis, I propose quantum coding based on sequence matrix, improve the quantum genetic algorithm shortcoming that it can not control precedence relationship. The article also uses a traveling salesman problem with precedence constraints as an example, to verify the feasibility of improvements.(3) Although quantum genetic algorithm has been used in many fields, but it has not been used in the disassembly sequence planning problem solving. Based on the improved quantum genetic algorithm presented above, I propose a disassembly sequence planning problem solving methods. This paper proposes a specific operating procedures for disassembly sequence planning problem. Finally, I use a mechanical product and an electrical and electronic products as engineering examples, demonstrate the disassembly sequence planning specific solving method, and get satisfactory results.