Optimal domain decomposition via p-median methodology using ACO and hybrid ACGA

Authors:
A. Kaveh;S. Shojaee
Affiliations:
Centre of Excellence for Fundamental Studies in Structural Engineering, Iran University of Science and Technology, Narmak, Tehran 16, Iran;Centre of Excellence for Fundamental Studies in Structural Engineering, Iran University of Science and Technology, Narmak, Tehran 16, Iran
Venue:
Finite Elements in Analysis and Design
Year:
2008

Citing 5
Cited 3

Partitioning sparse matrices with eigenvectors of graphs

SIAM Journal on Matrix Analysis and Applications
Ant algorithms for discrete optimization

Artificial Life
Parallel finite element and boundary element analysis: theory and applications - a bibliography (1997-1999)

Finite Elements in Analysis and Design
A hybrid graph-genetic method for domain decomposition

Finite Elements in Analysis and Design
Ant system: optimization by a colony of cooperating agents

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Distributed evolutionary multi-objective mesh-partitioning algorithm for parallel finite element computations

Computers and Structures
A distributed multilevel ant-colony approach for finite element mesh decomposition

PPAM'09 Proceedings of the 8th international conference on Parallel processing and applied mathematics: Part II
A distributed multilevel ant-colony algorithm for the multi-way graph partitioning

International Journal of Bio-Inspired Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper an efficient method is developed for decomposing large-scale finite element meshes. A weighted incidence graph is used to transform the connectivity properties of finite element models into those of graphs. A graph G"c of manageable size is obtained from the main graph model by a coarsening algorithm. The p-medians of this graph are selected using two approaches. The first algorithm uses an ant colony optimization and the second algorithm employs a hybrid ant colony together with genetic algorithm. Here, p is the number of subdomains which the finite element meshes is intended to be decomposed. Once the medians are obtained, the nodes in G"c associated with each median are selected. In an expansion process, the nodes of the subdomains in G are obtained. The capabilities of both ant colony optimization, and hybrid ant colony and genetic algorithm are evaluated using many examples of different topology.