دوره 8، شماره 2 - ( 5-1397 )
جلد 8 شماره 2 صفحات 246-227 |
برگشت به فهرست نسخه ها
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-fa.html
URL: http://ijoce.iust.ac.ir/article-1-342-fa.html
OPTIMAL DECOMPOSITION OF FINITE ELEMENT MESHES VIA K-MEDIAN METHODOLOGY AND DIFFERENT METAHEURISTICS. عنوان نشریه. 1397; 8 (2) :227-246
OPTIMAL DECOMPOSITION OF FINITE ELEMENT MESHES VIA K-MEDIAN METHODOLOGY AND DIFFERENT METAHEURISTICS
چکیده: (19901 مشاهده)
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.
نوع مطالعه: پژوهشي |
موضوع مقاله:
Optimal design
دریافت: 1396/6/4 | پذیرش: 1396/6/4 | انتشار: 1396/6/4
دریافت: 1396/6/4 | پذیرش: 1396/6/4 | انتشار: 1396/6/4
| بازنشر اطلاعات | |
 | این مقاله تحت شرایط Creative Commons Attribution-NonCommercial 4.0 International License قابل بازنشر است. |
