Abstract
ABSTRACT Assembly sequence planning is always a great challenge in complex product assembly. Subassembly division is a way that can validly decrease the complexity of assembly sequence planning problem. Above all, assemblies comprising parts with different connection relationships can be modelled as the weighted graph in which the weighted adjacent list is used to accomplish calculation of the subassembly division. A weighted adjacency list generation method is presented for generating the list quickly. Furthermore, according to the requirements of subassembly division and the connection relationships of actual parts, an optimized community detection algorithm based on Fast Newman algorithm is proposed. The weight assignment of different connection relationships and deviation parameters are introduced to improve the subassembly division results. Finally, the optimized algorithm is applied in the subassembly division process of a practical pumping unit, with the influence of the weight assignment and deviation parameters being analyzed in detail. The results show that the proposed algorithm has a good performance in terms of balance, stability and independence.
Sign-in/Register to access full text options 
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 callMore From: International Journal of Computer Integrated Manufacturing
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.
