Abstract

In order to realize automation and intelligence of product disassembly process in a virtual maintenance environment, an improved max–min ant system based methodology for product disassembly sequence planning was proposed. The feasibility graph for product disassembly process was defined and the mathematic model of product disassembly sequence planning problem was set up. Thus, the problem of product disassembly sequence planning was transformed into the problem of searching optimal path on a feasibility graph. Moreover, an improved max–min ant system based on the strategy of sorting elite ants was presented and the flowchart of the improved algorithm was designed. Finally, by simulation examples, the robustness and outperforming others of the improved algorithm were verified.

Full Text
Paper version not known

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.