optimal domain decomposition using the global sensitivity analysis-based metaheuristic algorithm

In this paper, an efficient approach is presented for finding optimal domain decomposition in conjunction with k-median method. using the clique graph, the connectivity properties of finite element meshes is represented. in order to divide the nodes of the graph or the meshes of the finite element model into k subdomains, k-median approach is employed. for optimal subdomaining, a recently developed metaheuristic algorithm socalled global sensitivity analysis based (gsab), is utilized. the performance of the proposed method is investigated through three finite element models for minimize the cost of k-median problem. a comparison of the numerical results obtained using the proposed method with standard colliding bodies optimization (cbo) and particle swarm optimization (pso) algorithms indicates that the proposed technique is capable of locating more promising solutions using less computational efforts.