RT - Journal Article
T1 - OPTIMAL DECOMPOSITION OF FINITE ELEMENT MESHES VIA K-MEDIAN METHODOLOGY AND DIFFERENT METAHEURISTICS
JF - IUST
YR - 2018
JO - IUST
VO - 8
IS - 2
UR - http://ijoce.iust.ac.ir/article-1-342-en.html
SP - 227
EP - 246
K1 - domain decomposition
K1 - Finite elements meshes
K1 - graph theory
K1 - optimization
K1 - metaheuristic algorithms
K1 - k-median
K1 - k-means++.
AB - In this paper the performance of four well-known metaheuristics consisting of Artificial Bee Colony (ABC), Biogeographic Based Optimization (BBO), Harmony Search (HS) and Teaching Learning Based Optimization (TLBO) are investigated on optimal domain decomposition for parallel computing. A clique graph is used for transforming the connectivity of a finite element model (FEM) into that of the corresponding graph, and k-median approach is employed. The performance of these methods is investigated through four FE models with different topology and number of meshes. A comparison of the numerical results using different algorithms indicates, in most cases the BBO is capable of performing better or identical using less time with equal computational effort.
LA eng
UL http://ijoce.iust.ac.ir/article-1-342-en.html
M3
ER -