Abstract
In recent years, more and more research has been conducted in close collaboration with manufacturers to design robust and profitable dismantling systems. Thus, engineers and designers of new products have to consider constraints and disassembly specifications during the design phase of products not only in the context of the end of life but more precisely in the product life cycle. Consequently, optimization of disassembly process of complex products is essential in the case of preventive maintenance. In Fact, Disassembly Sequence Plan (DSP), which is among the combinatorial problems with hard constraints in practical engineering, becomes an NP-hard problem. In this research work, an automated DSP process based on a metaheuristic method named “Ant Colony Optimization” is developed. Beginning with a Computer Aided Design (CAD) model, a collision analysis is performed to identify all possible interferences during the components’ motion and then an interference matrix is generated to identify dynamically the disassembly parts and to ensure the feasibility of disassembly operations. The novelty of the developed approach is presented in the introduction of new criteria such as the maintainability of the usury component with several other criteria as volume, tools change and disassembly directions change. Finally, to highlight the performance of the developed approach, an implemented tool is developed and an industrial case is studied. The obtained results prove the satisfactory side of these criteria to identify a feasible DSP in a record time.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.