In this paper, thek-median of a graph is used to decompose the domain (mesh) of the continuous two- and three-dimensional finite element models. The problem ofk-median is stated as an optimization problem and is solved by utilizing eight robust meta-heuristic algorithms. The Artificial Bee Colony algorithm (ABC), Cyclical Parthenogenesis algorithm (CPA), Cuckoo Search algorithm (CS), Teaching-Learning Based Optimization algorithm (TLBO), Tug of War Optimization algorithm (TWO), Water Evaporation Optimization algorithm (WEO), Ray Optimization algorithm (RO), and Vibrating Particles System algorithm (VPS) constitute the set of algorithms that are employed in the present study. In order to tune the parameters of the meta-heuristics, the Taguchi method is used. The efficiency and robustness of the algorithms are investigated through two- and three- dimensional finite element models. Communicated by Marat Z Dosaev.
