An exact algorithm for k-cardinality degree constrained clustered minimum spanning tree problem
01 Nov 2017-Vol. 263, Iss: 4, pp 042112
About: This article is published in Microelectronics Systems Education.The article was published on 2017-11-01 and is currently open access. It has received 2 citations till now. The article focuses on the topics: Cardinality (SQL statements) & Minimum spanning tree.
Citations
More filters
11 Dec 2008
TL;DR: In this paper, a new tabu-search-based approximate solution method that does not iteratively solve minimum spanning tree problems is proposed, which provides a good performance in terms of accuracy over those of existing methods for relatively high cardinality k.
Abstract: This paper considers k-minimum spanning tree
problems. An existing solution algorithm based on tabu search, which was proposed by Katagiri et al., includes an iterative solving procedure of minimum spanning tree (MST) problems for subgraphs to obtain a local optimal solution of k-minimum spanning tree problems. This article provides a new tabu-searchbased approximate solution method that does not iteratively solve minimum spanning tree problems. Results of numerical experiments show that the proposed method provides a good performance in terms of accuracy over those of existing methods for relatively high cardinality k.
8 citations
TL;DR: The optimization routing algorithm proposed in this study for use in green communication in underground mines can effectively reduce the network energy consumption and extend the lifetimes of networks.
Abstract: With the long-term dependence of humans on ore-based energy, underground mines are utilized around the world, and underground mining is often dangerous. Therefore, many underground mines have established networks that manage and acquire information from sensor nodes deployed on miners and in other places. Since the power supplies of many mobile sensor nodes are batteries, green communication is an effective approach of reducing the energy consumption of a network and extending its longevity. To reduce the energy consumption of networks, all factors that negatively influence the lifetime should be considered. The degree constraint minimum spanning tree (DCMST) is introduced in this study to consider all the heterogeneous factors and assign weights for the next step of the evaluation. Then, a genetic algorithm (GA) is introduced to cluster sensor nodes in the network and balance energy consumption according to several heterogeneous factors and routing paths from DCMST. Based on a comparison of the simulation results, the optimization routing algorithm proposed in this study for use in green communication in underground mines can effectively reduce the network energy consumption and extend the lifetimes of networks.
4 citations
Cites methods from "An exact algorithm for k-cardinalit..."
...black-box optimization techniques, an encoding method was used to initialize a tree [20]....
[...]
References
More filters
01 Feb 1956
TL;DR: Kurosh and Levitzki as discussed by the authors, on the radical of a general ring and three problems concerning nil rings, Bull Amer Math Soc vol 49 (1943) pp 913-919 10 -, On the structure of algebraic algebras and related rings.
Abstract: 7 A Kurosh, Ringtheoretische Probleme die mit dem Burnsideschen Problem uber periodische Gruppen in Zussammenhang stehen, Bull Acad Sei URSS, Ser Math vol 5 (1941) pp 233-240 8 J Levitzki, On the radical of a general ring, Bull Amer Math Soc vol 49 (1943) pp 462^66 9 -, On three problems concerning nil rings, Bull Amer Math Soc vol 49 (1943) pp 913-919 10 -, On the structure of algebraic algebras and related rings, Trans Amer Math Soc vol 74 (1953) pp 384-409
5,104 citations
TL;DR: In this paper, the basic problem of interconnecting a given set of terminals with a shortest possible network of direct links is considered, and a set of simple and practical procedures are given for solving this problem both graphically and computationally.
Abstract: The basic problem considered is that of interconnecting a given set of terminals with a shortest possible network of direct links Simple and practical procedures are given for solving this problem both graphically and computationally It develops that these procedures also provide solutions for a much broader class of problems, containing other examples of practical interest
4,395 citations
1,419 citations
01 Mar 2009
TL;DR: The proposed ABC algorithm is a new metaheuristic approach inspired by intelligent foraging behavior of honeybee swarm that obtained better quality solutions in shorter time and was compared against the best approaches reported in the literature.
Abstract: Given an undirected, connected, weighted graph, the leaf-constrained minimum spanning tree (LCMST) problem seeks on this graph a spanning tree of minimum weight among all the spanning trees of the graph that have at least @? leaves. In this paper, we have proposed an artificial bee colony (ABC) algorithm for the LCMST problem. The ABC algorithm is a new metaheuristic approach inspired by intelligent foraging behavior of honeybee swarm. We have compared the performance of our ABC approach against the best approaches reported in the literature. Computational results demonstrate the superiority of the new ABC approach over all the other approaches. The new approach obtained better quality solutions in shorter time.
422 citations
TL;DR: A primal and a dual heuristic procedure and a branch-and-bound algorithm are proposed to construct a DCMST, which is formulated as a linear 0–1 integer programming problem.
210 citations