Abstract
Disassembly Sequence planning is the important module of virtual maintenance. Its foundational task is to test the disassemblability of parts, find out all the feasible disassembly sequences of targeted parts and search for the near-optimal disassembly sequence. In the paper, the spherical algorithm is used to test the disassemblability of parts. And then the disassembly direction of parts is determined by rules which are the simplified version of Gaussian map approach. Thus the near-optimal disassembly sequence is found out by optimizing all feasible disassembly sequences of targeted parts by ant colony algorithm. The simulation result of the sequence optimization proves to be the same with manual calculation considering comprehensive cost of the change of disassembly tools and disassembly directions. The set of approaches can be reference for disassembly sequence planning of large-scale mechanical products.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
