A Distributed Multilevel Ant-Colony Approach for Finite Element Mesh Decomposition

The k-way finite element mesh (FEM) decomposition problem is an NP-complete problem, which consists of finding a decomposition of a FEM into k balanced submeshes such that the number of cut edges is minimized. The multilevel ant-colony algorithm (MACA) is quite new and promising hybrid approach for solving different type of FEM-decomposition problems. The MACA is a swarm-based algorithm and therefore inherently suitable for parallel processing on many levels. Motivated by the good performance of the MACA and the possibility to improve it's performance (computational cost and/or solution quality), in this paper we discuss the results of parallelizing the MACA on largest scale (on colony level). Explicitly, we present the distributed MACA (DMACA) approach, which is based on the idea of parallel independent runs enhanced with cooperation in form of a solution exchange among the concurrent searches. Experimental evaluation of the DMACA on a larger set of benchmark FEM-decomposition problems shows that the DMACA compared to the MACA can obtain solutions of equal quality in less computational time.

[1]  Jurij Silc,et al.  Solving the mesh-partitioning problem with an ant-colony algorithm , 2004, Parallel Comput..

[2]  Jurij Silc,et al.  A Distributed Multilevel Ant Colonies Approach , 2008, Informatica.

[3]  Andrew Lewis,et al.  A Parallel Implementation of Ant Colony Optimization , 2002, J. Parallel Distributed Comput..

[4]  Chris Walshaw,et al.  Mesh Partitioning: A Multilevel Balancing and Refinement Algorithm , 2000, SIAM J. Sci. Comput..

[5]  Ardeshir Bahreininejad,et al.  Finite element mesh partitioning using neural networks , 1996 .

[6]  Richard S. Barr,et al.  Feature Article - Reporting Computational Experiments with Parallel Algorithms: Issues, Measures, and Experts' Opinions , 1993, INFORMS J. Comput..

[7]  P. W. Grant,et al.  Using Competing Ant Colonies to Solve k-way Partitioning Problems with Foraging and Raiding Strategies , 1999, ECAL.

[8]  Thomas Stützle,et al.  Parallelization Strategies for Ant Colony Optimization , 1998, PPSN.

[9]  Saeed Shojaee,et al.  Optimal domain decomposition via p-median methodology using ACO and hybrid ACGA , 2008 .

[10]  Massimiliano Vasile,et al.  Testing approaches for global optimization of space trajectories , 2008 .

[11]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[12]  F. Wilcoxon.  Individual Comparisons by Ranking Methods , 1945 .

[13]  G. Hommel,et al.  Improvements of General Multiple Test Procedures for Redundant Systems of Hypotheses , 1988 .

[14]  Wolfgang Banzhaf,et al.  Advances in Artificial Life , 2003, Lecture Notes in Computer Science.

[15]  Thomas Bäck,et al.  Parallel Problem Solving from Nature — PPSN V , 1998, Lecture Notes in Computer Science.