Font Size: a A A

Application Of Particle Swarm Optimization Algorithm Based On Simulated Annealing On Disassembly Sequence Planning

Posted on:2011-05-13Degree:MasterType:Thesis
Country:ChinaCandidate:D J YangFull Text:PDF
GTID:2132360308473333Subject:Mechanical Manufacturing and Automation
Abstract/Summary:PDF Full Text Request
Disassembly sequence planning is the first step of the recycling of the waste products,and is also the important part of the remanufacturing engineering. The purpose of DSP is to disassemble the aim product in accordance with the demand and within the shortest time,workers and tools. There are so many elements relative to the disassembly process,so it is a complicated issue that how to consider the factors,adjust the sequence properly and given the best disassembly sequence.It be used in disassembly sequence planning process which is a hybrid optimization algorithm , the particle swarm-simulated annealing optimization algorithm(PSO-SA). The disassembly weighted constraint graph (DWCG) is presented based on disassembly constraint graph. The undirected edge weight and the disassembly tools information are brought in to complete the DWCG. The advantages and disadvantages of the PSO and SA are analyzed,and flow of the PSO-SA is optimized. Redefine the update rules of the particle's position and speed and the model disturbance rules of the simulated annealing process. Giving the definition of particle fitness function,and also the algorithm details to fit the model. The method used to judge the disassembly sequence feasibility and fix it is given in this paper. Then a part of a kind of blender is analyzed using the particle swarm-simulated annealing optimization algorithm as an illustration to verify itself,and also compared with the particle swarm optimization algorithm to show its feasibility and efficiency.
Keywords/Search Tags:Disassembly sequence planning, Particle swarm optimization, Simulated annealing, Disassembly weighted constraint graph
PDF Full Text Request
Related items