Model local search oriented optimal matching method for shortest paths set
Neng Wan · Computer Integrated Manufacturing Systems · 2012
To realize local search of Boundary Representation(B-Rep) model,a method converted attribute graph local structure comparison into attribute graph shortest paths set optimal matching was proposed.To obtain shortest paths set of the attribute graph,an algorithm named All Shortest Paths generation based on Floyd-Warshall(ASP Floyd-Warshall) was presented.For realize optimal matching of shortest paths set between query models and candidate models,an Discrete Particle Swarm Optimization for Shortest Paths Optimal Matching(DPSO-SPOM) was given,which included definition of corresponding basic operation rules,fitness function,termination conditions and algorithm steps.The experimental results demonstrate that ASP Floyd-Warshall algorithm and DPSO-SPOM algorithm could solve problems that how to obtain the local structure correspondence between models and how to calculate distance between local structures,thus supported the local search of models effectively.