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

Document Type : Article

Authors

1 Centre of Excellence for Fundamental Studies in Structural Engineering, Iran University of ‎Science and Technology, Narmak, Tehran, P.O. Box 16846-13114, Iran‎

2 School of Civil Engineering, Iran University of Science and Technology, Narmak, Tehran, P.O. Box 16846-13114, Iran

Abstract

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 so-called 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.
 

Keywords

Main Subjects


References
1. Farhat, C. A simple and ecient automatic FE mesh
domain decomposer", Comput. Struct., 28, pp. 579-
602 (1988).
2. Farhat, C. and Lesoinne, M. Automatic partitioning
of unstructured meshes for the parallel solution of
problems in computational mechanics", Int. J. Numer
Methods Eng., 36, pp. 745-764 (1993).
3. Khan, A.I, and Topping, B.H.V. Sub-domain generation
for parallel nite element analysis", Proc. Civil
Comp., B.H.V. Topping, Ed., Edinburgh, UK (1993).
4. Kaveh, A., Optimal Structural Analysis, John Wiley
(Research Studies Press), 2nd Edn., Chichester, UK
(2006).
5. Kaveh, A., Computational Structural Analysis and
Finite Element Methods, Springer Press, Switzerland
(2014).
6. Kaveh, A. and Roosta, G.R. Domain decomposition
for nite element analysis", Communs Numer Methods
Eng., 13, pp. 61-71 (1997).
7. Kaveh, A. and Shojaee, S. Optimal domain decomposition
via p-median methodology using ACO and
hybrid ACGA", Finite Elem Anal Des., 44, pp. 505-
512 (2008).
8. Kaveh, A. and Shara , P. Ant colony optimization for
nding medians of weighted graphs", Int. J. Computer-
Aided Eng. Softw., 25, pp. 102-120 (2008).
9. Christo des, N. and Beasley, J.E. A tree search
algorithm for the p-median problem", Europ J Oper
Res., 10, pp. 196-204 (1982).
10. Kariv, O. and Hakimi, S.L. An algorithmic approach
to network location problems", SIAM J. Appl. Math.,
37, pp. 539-560 (1979).
11. Osman, I. and Christo des, N. Capacitated clustering
problems by hybrid simulated annealing and tabu
search", Int. Trans. Oper. Res., 1(3), pp. 317-336
(1994).
12. Charikar, M., Guha, S., Tardos, E., and Shmoys, D.B.
A constant-factor approximation algorithm for the kmedian
problem", Proceedings of the 31st Annual ACM
Symposium on Theory of Computing, pp. 1-10 (1999).
13. Osman, A., Erhan, E., and Zvi, D. An ecient genetic
algorithm for the p-median problem", Ann. Oper. Res.,
122, pp. 21-42 (2003).
14. Castro, V.E. and Vela Zquez, R.T. Hybrid genetic
algorithm for solving the p-median problem", Lecture
Notes in Computer Science, paper presented at Selected
papers from the Second Asia-Paci c Conference
on Simulated Evolution and Learning on Simulated
Evolution and Learning, 1585, pp. 19-25 (1998).
15. Maniezzo, V., Mingozzi, A., and Baldacci, R. A bionomic
approach to the capacitated p-median problem",
J. Heurist., 4, pp. 263-280 (1998).
16. McKendal, A.R. and Shang, J. Hybrid ant systems for
the dynamic facility layout problem", Comput. Oper.
Res., 33, pp. 790-803 (2006).
A. Kaveh and V.R. Mahdavi/Scientia Iranica, Transactions A: Civil Engineering 25 (2018) 2480{2487 2487
17. Levanova, T.V. and Loresh, M. Algorithms of ant
system and simulated annealing for the p-median
problem", Auto Remote Control., 65, pp. 431-438
(2004).
18. Kaveh, A. and Mahdavi, V.R. Optimal domain decomposition
using colliding bodies optimization and
k-median method", Finite Elem. Anal. Des., 98, pp.
41-49 (2015).
19. Kaveh, A. and Mahdavi, V.R. Optimal design of truss
structures using a new optimization algorithm based
on global sensitivity analysis", Struct. Eng. Mech.,
Techno Press, 60(6), pp. 1093-1117 (2016).
20. Jackson, L.E., Rouskas, G.N. and Stallmann, F.M.
The directional p-median problem; de nitions, complexity,
and algorithms", Europ. J. Oper. Res., 179,
pp. 1097-1108 (2007).
21. Zhai, Q., Yang, J. and Zhao, Y. Space-partition
method for the variance-based sensitivity analysis",
Optimal Partition Scheme and Comparative Study,
Reliab Eng Syst Safety, 131, pp. 66-82 (2014).