Optimal Domain-Partitioning Algorithm for Real-Life Transportation Networks and Finite Element Meshes
نویسندگان
چکیده
For large-scale engineering problems, it has been generally accepted that domain-partitioning algorithms are highly desirable for general-purpose finite element analysis (FEA). This paper presents a heuristic numerical algorithm can efficiently partition any transportation network (or mesh) into specified number of subdomains (usually depending on the parallel processors available computer), which will result in “minimising total system BOUNDARY nodes” (as primary criterion) and achieve “balancing work loads” amongst secondary criterion). The proposed seven-step (with enhancement features) is based common sense observation. current following novelty features: (i) complicated graph theories NOT needed (ii) unified treatments networks (using line elements) (FE) meshes triangular, tetrahedral, brick be performed through transforming original FE pseudo-transportation only uses elements. Several examples, including real-life triangular/brick/tetrahedral used (under MATLAB computer environments) to explain, validate compare algorithm’s performance with popular METIS software.
منابع مشابه
Hybrid Surface Partitioning of Finite Element Meshes
A hybrid automatic and interactive scheme is developed for partitioning the surfaces of mechanical parts represented by finite element meshes on the basis of geometric discontinuity. Given a finite element surface mesh M in three dimensions, the algorithm firstly finds a partition of M into k subregions k M M ,..., 1 on the basis of 1 G discontinuities in an automatic manner. Secondly, an inter...
متن کاملOPTIMAL DECOMPOSITION OF FINITE ELEMENT MESHES VIA K-MEDIAN METHODOLOGY AND DIFFERENT METAHEURISTICS
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 cor...
متن کاملSpectral Partitioning Works: Planar Graphs and Finite Element Meshes
Spectral partitioning methods use the Fiedler vector—the eigenvector of the second-smallest eigenvalue of the Laplacian matrix—to find a small separator of a graph. These methods are important components of many scientific numerical algorithms and have been demonstrated by experiment to work extremely well. In this paper, we show that spectral partitioning methods work well on bounded-degree pl...
متن کاملA Multilevel k–way Partitioning Algorithm for Finite Element Meshes using Competing Ant Colonies
The self–organizing properties of ant colonies are employed to tackle the classical combinatorial optimization problem of graph partitioning. Structural information from the graph is mapped onto an environment upon which a number of colonies compete for resources. Using Genetic Programming, a Foraging Strategy is evolved which when executed by the ants in each colony leads to a restructuring of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Designs
سال: 2023
ISSN: ['2411-9660']
DOI: https://doi.org/10.3390/designs7040082