Martin Gruber
ABSTRACT
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. There exist various exact and metaheuristic approaches addressing this problem, whereas fast construction heuristics are primarily based on Prim's minimum spanning tree algorithm and fail to produce reasonable solutions in particular on large Euclidean instances.
A method based on hierarchical clustering to guide the construction process of a diameter constrained tree is presented. Solutions obtained are further refined using a greedy randomized adaptive search procedure. Based on the idea of clustering we also designed a new neighborhood search for this problem. Especially on large Euclidean instances with a tight diameter bound the results are excellent. In this case the solution quality can also compete with that of a leading metaheuristic, whereas the computation only needs a fraction of the time.
- L. Gouveia, T. L. Magnanti, and C. Requejo. A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees. Networks, 44(4):254--265, 2004. Google Scholar
Digital Library
- M. Gruber and G. R. Raidl. (Meta-)heuristic separation of jump cuts in a branch &cut approach for the bounded diameter minimum spanning tree problem, 2008. submitted to a special issue on Matheuristics of Operations Research/Computer Science Interface Series, SpringerGoogle Scholar
- M. Gruber and G. R. Raidl. Cluster-based (meta-)heuristics for the Euclidean bounded diameter minimum spanning tree problem. In A. Quesada-Arencibia et al., editors, Extended Abstracts of the Twelfth International Conference on Computer Aided Systems Theory (EUROCAST 2009), pages 228--231,Gran Canaria, Spain, 2009Google ScholarDigital Library
- M. Gruber, J. van Hemert, and G. R. Raidl. Neighborhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO. In M. Keijzer et al., editors, Proc. of the Genetic and Evolutionary Computation Conference 2006, volume 2, pages 1187--1194, 2006 Google ScholarDigital Library
- A. Jain, M. Murty, and P.J.Flynn. Data clustering: a review. ACM Computing Surveys (CSUR), 31:264--323, 1999 Google ScholarDigital Library
- B. A. Julstrom. Greedy heuristics for the bounded diameter minimum spanning tree problem. Journal of Experimental Algorithmics (JEA), 14:1.1:1--1.1:14, February 2009 Google ScholarDigital Library
- R. C. Prim. Shortest connection networks and some generalizations. Bell System Technical Journal, 36:1389--1401, 1957Google ScholarCross Ref
- G. R. Raidl and B. A. Julstrom. Greedy heuristics and an evolutionary algorithm for the bounded-diameter minimum spanning tree problem. In G. Lamont et al., editors, Proc. of the ACM Symposium on Applied Computing, pages 747--752. ACM Press, 2003 Google ScholarDigital Library
- K. Raymond. A tree-based algorithm for distributed mutual exclusion. ACM Transactions on Computer Systems, 7(1):61--77, 1989 Google ScholarDigital Library
- M. Resende and C. Ribeiro. Greedy randomized adaptive search procedures. In F. Glover and G. Kochenberger, editors, Handbook of Metaheuristics, pages 219--249. Kluwer Academic Publishers, 2003Google ScholarCross Ref
- A. Singh and A. K. Gupta. Improved heuristics for the bounded-diameter minimum spanning tree problem. Soft Computing - A Fusion of Foundations, Methodologies and Applications, 11(10):911--921, 2007 Google ScholarDigital Library
Index Terms
- Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on euclidean instances
Recommendations
New Heuristic Approaches for the Bounded-Diameter Minimum Spanning Tree Problem
<P>Given a bound, the bounded-diameter minimum spanning tree (BDMST) problem seeks a spanning tree of minimum total weight with a diameter not exceeding the given diameter bound. Depending on the tightness of the bound, optimal solutions have different ...
New Heuristic Approaches for the Bounded-Diameter Minimum Spanning Tree Problem
<P>Given a bound, the bounded-diameter minimum spanning tree BDMST problem seeks a spanning tree of minimum total weight with a diameter not exceeding the given diameter bound. Depending on the tightness of the bound, optimal solutions have different ...
Greedy heuristics and an evolutionary algorithm for the bounded-diameter minimum spanning tree problem
SAC '03: Proceedings of the 2003 ACM symposium on Applied computingGiven a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path between two vertices contains more than D edges. This problem is NP-hard for 4 ...
Comments