Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bahreininejad, A., Topping, B.H.V., Khan, A.I.: Finite Element Mesh Partitioning Using Neural Networks. Adv. Eng. Softw. 27, 103–115 (1996)
Barr, R., Hickman, B.: Reporting Computational Experiments with Parallel Algorithms: Issues, Measures, and Experts’ Opinion. ORSA J. Comput. 5, 2–18 (1993)
Bergmann, B., Hommel, G.: Improvements of General Multiple Test Procedures for Redundant Systems of Hypotheses. In: Bauer, P., Hommel, G., Sonnemann, E. (eds.) Multiple Hypothesenprfung–Multiple Hypotheses Testing, pp. 100–115. Springer, Berlin (1988)
Graph Partitioning – Graph Collection. Visited (October 2009), http://wwwcs.uni-paderborn.de/cs/ag-monien/RESEARCH/PART/graphs.html
Kadłuczka, P., Wala, K.: Tabu Search and Genetic Algorithms for the Generalized Graph Partitioning Problem. Control Cybern. 24, 459–476 (1995)
Kaveh, A., Shojaee, S.: Optimal Domain Decomposition via p-median Methodology Using ACO and Hybrid ACGA. Finite Anal. Elem. Des. 44, 505–512 (2008)
Kernighan, B.W., Lin, S.: An Efficient Heuristic Procedure for Partitioning Graph. Bell Sys. Tech. J. 49, 291–307 (1970)
Korošec, P., Šilc, J., Robič, B.: Solving the Mesh-partitioning Problem with an Ant-colony Algorithm. Parallel Comput. 30, 785–801 (2004)
Langham, A.E., Grant, P.W.: Using Competing Ant Colonies to Solve k-way Partitioning Problems with Foraging and Raiding Strategies. In: Floreano, D., Mondada, F. (eds.) ECAL 1999. LNCS, vol. 1674, pp. 621–625. Springer, Heidelberg (1999)
Randall, M., Lewis, A.: A Parallel Implementation of Ant Colony Optimization. J. Parallel Distr. Com. 62, 1421–1432 (2002)
Stützle, T.: Parallelization Strategies for Ant Colony Optimization. In: Eiben, A.E., Bäck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol. 1498, pp. 722–741. Springer, Heidelberg (1998)
Taškova, K., Korošec, P., Šilc, J.: A Distributed Multilevel Ant Colonies Approach. Informatica 32, 307–317 (2008)
The Graph Partitioning Archive (visited October 2009), http://staffweb.cms.gre.ac.uk/~c.walshaw/partition/
Vasile, M., Minisci, E., Locatelli, M.: Testing Approaches for Global Optimization of Space Trajectories. In: Filipič, B., Šilc, J. (eds.) Bioinspired Optimization Methods and their Applications, pp. 81–91. Jožef Stefan Institute, Ljubljana (2008)
Walshaw, C., Cross, M.: Mesh Partitioning: A Multilevel Balancing and Refinement Algorithm. SIAM J. Sci. Comput. 22, 63–80 (2001)
Wilcoxon, F.: Individual Comparisons by Ranking Methods. Biometrics Bull. 1, 80–83 (1945)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Taškova, K., Korošec, P., Šilc, J. (2010). A Distributed Multilevel Ant-Colony Approach for Finite Element Mesh Decomposition. In: Wyrzykowski, R., Dongarra, J., Karczewski, K., Wasniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2009. Lecture Notes in Computer Science, vol 6068. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14403-5_42
Download citation
DOI: https://doi.org/10.1007/978-3-642-14403-5_42
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14402-8
Online ISBN: 978-3-642-14403-5
eBook Packages: Computer ScienceComputer Science (R0)