Font Size: a A A

Research On Product Disassembly Sequence Planning Based On Genetic Bat Algorithm

Posted on:2019-02-09Degree:MasterType:Thesis
Country:ChinaCandidate:Z Y ZhuFull Text:PDF
GTID:2428330542499723Subject:Mechanical engineering industrial engineering
Abstract/Summary:PDF Full Text Request
The disassembly and recycling of products is one of the most important problems in Green Design.And the disassembly sequence planning(DSP)is the main engine of the product disassembly system.The optimal or approximate optimal disassembly sequence can reduce the cost and time of disassembly.Based on the research of DSP and its characteristics,a new hybrid algorithm combining genetic algorithm and bat algorithm is proposed to solve the DSP problem.The specific content of the work is as follows:(1)The method of disassembly information modeling in disassembly sequence planning is summarized,and a model of product disassembly information graph is built with mixed graph model.The mixed graph model is composed of stable connection matrix,disassembly priority constraint matrix and information matrix,in which the stable connection matrix can describe the fastening connection between parts.The stable connection matrix and the disassembly priority constraint matrix include the assembly relationship and the priority constraint relation in the product,and the disassembly information matrix contains disassembly methods and disassembly tools.(2)The fitness function of the product disassembly sequence planning is set up with the disassembly time,the replacement times of disassembly tools,the replacement times of disassembly direction and the recovery income as the evaluation standard,which provides a certain evaluation criterion for the production of the optimal or approximately optimal disassembly sequence.(3)In view of the shortcomings of the traditional bat algorithm,the genetic algorithm is introduced by introducing the crossover and mutation mechanism in the genetic algorithm,and a program for solving the disassembly sequence planning algorithm is compiled based on the Python language.This paper redefines the encoding method of bats position and speed and the related operations in the algorithm,and studies the application steps of the genetic bat algorithm in the disassembly sequence planning.Comparison experiments show that the genetic bat algorithm is superior to the traditional bat algorithm and the genetic algorithm in solving the DSP problem.(4)Through the analysis of the disassembly theory and the introduction of the algorithm,the Disassembly Sequence Planning Software(DSPS)is initially developed,and the user graphical interface(Graphical User Interface,GUI)is created by PyQt(a multi platform Toolkit),which is a graphical display of the computer exercises.The user interface.The disassembly sequence analysis system is used to analyze the disassembly information of disassembly products to produce the optimal or approximately optimal disassembly sequence.The system provides some reference value for designers and improves the efficiency and accuracy of the disassembly sequence planning.
Keywords/Search Tags:disassembly sequence planning, fitness function, selective disassembly, genetic algorithm, bat algorithm
PDF Full Text Request
Related items