Abstract

In this paper, to solve disassembly sequence planning problem efficiently, Disassembly Feasibility Information Graph (DFIG) is presented firstly. Based on this graph, the problem of disassembly sequence planning is converted into a problem of searching optimal path in this directed and weighted graph. Then, an ant colony optimization algorithm is presented, integrated with part moving planner in 3D system, to build the DFIG, and search optimum solution(s). The tour of ant represents a possible product disassembly solution. The pheromone trail laid on edge by ant is related with the quality of its tour. It is by two steps to get heuristic information: calculating heuristic vector — representing the feasibility of solution — and then, calculating heuristic information-representing the quality of solution. Finally, by a case study, the well performance of the proposed method is shown.© 2006 ASME

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 call

Disclaimer: 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.