Greedy heuristics and an evolutionary algorithm for the bounded-diameter minimum spanning tree problem

Raidl, Günther R.; Julstrom, Bryant A.

doi:10.1145/952532.952678

Cited by 68 publications

(90 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…So isFeasible() can be modified to deal with other types of constraints. Because of this the Pred-Crossover can be applied to other spanning tree problems such as the Degree-constrained minimum spanning tree (DegMST) problem [30] [16] and the Bounded-Diameter Minimum Spanning Tree Problem (BDMST) [24].…”

Section: Constraintsmentioning

confidence: 99%

An edge-based crossover for the capacitated minimum spanning tree problem

Lacerda¹,

Medeiros²

2016

Anais Do 7. Congresso Brasileiro De Redes Neurais

View full text Add to dashboard Cite

Abstract-This work describes a Genetic Algorithm for the Capacitated Minimum Spanning Tree (CMST) problem that appears in Telecommunications. We suggest a new crossover operator, applied directly on the tree (phenotype) instead of on the chromosome. Without needing repairing techniques, this crossover is capable to produce feasible trees and presents excellent locality and heritability besides other properties that misses in many other tree representations. The new crossover proved to be effective when compared with the Genetic Algorithm of Raidl and Drexel (on benchmark data sets), which presented better performance than various classical methods of the literature. Another characteristic of the new crossover is its flexibility for adaptation in problems with constraints, as for instance, the Degree-Constrained Minimum Spanning Tree Problem.

show abstract

Section: Constraintsmentioning

confidence: 99%

An edge-based crossover for the capacitated minimum spanning tree problem

Lacerda¹,

Medeiros²

2016

Anais Do 7. Congresso Brasileiro De Redes Neurais

View full text Add to dashboard Cite

show abstract

“…significantly less than 100 nodes when dealing with complete graphs. For larger instances, metaheuristics have been developed, including evolutionary algorithms [5,6], a variable neighborhood search, and an ant colony optimization [7] which is currently the leading metaheuristic to obtain high-quality solutions. In contrast to the large variety of metaheuristic approaches the number of simple and fast construction heuristics applicable to very large instances is limited.…”

Section: Previous Workmentioning

confidence: 99%

Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering–Based (Meta–)Heuristics

Grůber

Raidl

2009

Computer Aided Systems Theory - EUROCAST 2009

Self Cite

View full text Add to dashboard Cite

Abstract. The bounded diameter minimum spanning tree problem is an N P-hard combinatorial optimization problem arising in particular in network design. 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. In this work we present a method based on hierarchical clustering to guide the construction process of a diameter constrained tree. Solutions obtained are further refined using a greedy randomized adaptive search procedure. 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.

show abstract

“…Multicriteria spanning tree problem is the most studied special case of a multicriteria network design problem. For example, Deo et al [7], Raidl and Julstorm [22], and Ravi et al [23] present heuristics/approximation algorithms for solving degree/diameter-constrained spanning trees. Zhou and Gen [25], Knowles and Corne [15] and Kumar et al [20] use multiobjective evolutionary algorithm (MOEA) to obtain multiple solutions simultaneously for bi-objective spanning tree problems.…”

Section: Communication Network Design -A Reviewmentioning

confidence: 99%

Multiobjective network design for realistic traffic models

Banerjee

Kumar

2007

Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation

View full text Add to dashboard Cite

Network topology design problems find application in several real life scenarios. However, most designs in the past either optimize for a single criterion like delay or assume simplistic traffic models like Poisson. Such assumptions make the solutions inapplicable in the practical world.In this paper, we formulate and solve a multiobjective network topology design problem for a realistic Internet traffic model which is assumed to be self similar. We optimize for the average packet delivery delay and network layout cost to construct realistic network topologies. We present a multiobjective evolutionary algorithm (MOEA) to obtain the diverse near-optimal network topologies. For fair comparison, we design a multiobjective deterministic heuristic based on branch exchange -we call the heuristic Pareto Branch Exchange (PBE). We empirically show that the MOEA used performs well for real networks of various sizes, and generated topologies are quite different with significantly larger delays for the self similar traffic model.

show abstract

Greedy heuristics and an evolutionary algorithm for the bounded-diameter minimum spanning tree problem

Cited by 68 publications

References 8 publications

An edge-based crossover for the capacitated minimum spanning tree problem

An edge-based crossover for the capacitated minimum spanning tree problem

Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering–Based (Meta–)Heuristics

Multiobjective network design for realistic traffic models

Contact Info

Product

Resources

About