Volume 8, Issue 2 (8-2018)
IJOCE 2018, 8(2): 227-246 |
Back to browse issues page
Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
Kaveh A, Dadras A. OPTIMAL DECOMPOSITION OF FINITE ELEMENT MESHES VIA K-MEDIAN METHODOLOGY AND DIFFERENT METAHEURISTICS. IJOCE 2018; 8 (2) :227-246
URL: http://ijoce.iust.ac.ir/article-1-342-en.html
URL: http://ijoce.iust.ac.ir/article-1-342-en.html
OPTIMAL DECOMPOSITION OF FINITE ELEMENT MESHES VIA K-MEDIAN METHODOLOGY AND DIFFERENT METAHEURISTICS
Abstract: (20702 Views)
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.
Keywords: domain decomposition, Finite elements meshes, graph theory, optimization, metaheuristic algorithms, k-median, k-means++.
Type of Study: Research |
Subject:
Optimal design
Received: 2017/08/26 | Accepted: 2017/08/26 | Published: 2017/08/26
Received: 2017/08/26 | Accepted: 2017/08/26 | Published: 2017/08/26
| Rights and permissions | |
 | This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License. |
