Abstract
When using graph theory for kinematic structure enumeration, the isomorphism identification of graphs is an important and complicated problem. The problem is known to be an NP-complete problem. This paper presents a mixed algorithm based on a mapping property, a genetic algorithm, and a simulated annealing algorithm for the isomorphism identification problem. A validity encoding scheme was developed by considering the mapping relationship between two graphs, and some reset measures for the crossover and mutation operators were developed based on the characteristics in which the encoding cell could not be reiterated. A simulated annealing algorithm was introduced into the mixed algorithm to prevent premature convergence in resolution, and some other measures were developed for improving the efficiency, based on the parameter selection. An example shows that the mixed algorithm is a valid algorithm for the isomorphism identification of kinematic structure graphs in mechanism design. It will be a reliable isomorphism identification algorithm for intelligent computer-aided design (CAD) and manufacturing (CAM).
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: The International Journal of Advanced Manufacturing Technology
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.
