# A Memetic Algorithm and a Solution Archive for the Rooted Delay-Constrained Minimum Spanning Tree Problem

@inproceedings{Ruthmair2011AMA, title={A Memetic Algorithm and a Solution Archive for the Rooted Delay-Constrained Minimum Spanning Tree Problem}, author={Mario Ruthmair and G{\"u}nther R. Raidl}, booktitle={EUROCAST}, year={2011} }

We present a memetic algorithm for a combinatorial optimization problem called rooted delay-constrained minimum spanning tree problem arising for example in centralized broadcasting networks where quality of service constraints are of concern. The memetic algorithm is based on a specialized solution representation and a simple and effective decoding mechanism. Solutions are locally improved by a variable neighborhood descent in two neighborhood structures. Furthermore, to tackle the problem of…

## 9 Citations

### Distributed local search based on a parallel neighborhood exploration for the rooted distance constrained mínimum spanning-tree problem

- Computer Science
- 2019

A distributed strategy to solve the RDCMST problem from a local search, which performs a parallel exploration of the neighborhood and is capable of handling instances of tens of thousands of vertices in a reasonable amount of time is constructed.

### A Genetic Algorithm in Combination with a Solution Archive for Solving the Generalized Vehicle Routing Problem with Stochastic Demands

- Computer ScienceTransp. Sci.
- 2018

This work presents a steady-state genetic algorithm enhanced by a complete trie-based solution archive for solving the generalized vehicle routing problem with stochastic demands using a preventive…

### On Solving Constrained Tree Problems and an Adaptive Layers Framework

- Computer Science
- 2012

Several heuristic approaches for the rooted delay-constrained minimum spanning tree (RDCMST) problem in which all nodes in a graph have to be connected to a fixed root node while the total delay on the paths from the root to any other node has to be within a given delay-bound are designed.

### Enhancing an Evolutionary Algorithm with a Solution Archive to Reconstruct Cross Cut Shredded Text Documents

- Computer Science
- 2012

In this thesis a method for improving existing metaheuristics for the Reconstruction of Cross-Cut Shredded Text Documents (RCCSTD) problem is presented. For this purpose a memetic algorithm is…

### Metaheuristics for the Districting and Routing Problem for Security Control

- Business, Computer Science
- 2016

The Districting and Routing Problem for Security Control is introduced and modeled as a combinatorial optimization problem and an efficient method for checking the feasibility of a given route is presented.

### Arc Routing with Electric Vehicles

- Engineering
- 2019

Concerns about greenhouse gas emissions and government regulations foster the use of electric vehicles. Several recently published articles study the use of electric vehicles (EVs) in node-routing…

### Arc Routing with Electric Vehicles: Dynamic Charging and Speed-Dependent Energy Consumption

- EngineeringTransportation Science
- 2022

Concerns about greenhouse gas emissions and government regulations foster the use of electric vehicles. Several recently published articles study the use of electric vehicles (EVs) in node-routing…

### Hybrid Metaheuristics

- MedicineArtificial Intelligence: Foundations, Theory, and Algorithms
- 2016

One that the authors will refer to to break the boredom in reading is choosing hybrid metaheuristics as the reading material.

### A Bibliography of Papers in Lecture Notes in Computer Science (2012): Volumes 6121{7125

- Mathematics
- 2012

(∆ + 1) [1577]. (ρ,G) [266]. (r|p) [781]. 1 [1022]. 1 [1342]. 2 [27, 1294, 1138, 432, 1028, 281, 758, 272, 1440, 546, 861, 867, 1352, 578, 561]. 3 [579, 1293, 1381, 176, 1355, 1623, 1294, 1012, 1358,…

## References

SHOWING 1-10 OF 20 REFERENCES

### A Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem

- Computer ScienceEUROCAST
- 2009

A construction heuristic based on Kruskal's algorithm for finding a minimum cost spanning tree which eliminates some drawbacks of existing heuristic methods and seems to be a better starting point for subsequent improvement methods.

### Variable Neighborhood Search and Ant Colony Optimization for the Rooted Delay-Constrained Minimum Spanning Tree Problem

- Computer SciencePPSN
- 2010

Two new approaches to solve the rooted delay-constrained minimum spanning tree problem heuristically following the concepts of ant colony optimization and variable neighborhood search are presented.

### Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO

- BusinessGECCO '06
- 2006

We consider the Bounded Diameter Minimum Spanning Tree problem and describe four neighbourhood searches for it. They are used as local improvement strategies within a variable neighbourhood search…

### A hybrid scatter search meta-heuristic for delay-constrained multicast routing problems

- Business, Computer ScienceApplied Intelligence
- 2010

This paper investigates the first hybrid scatter search and path relinking meta-heuristic for the Delay-Constrained Least-Cost (DCLC) multicast routing problem and explores two improvement strategies: tabu search and variable neighborhood search, to intensify the search in the proposed scatter search algorithm.

### Enhancing Genetic Algorithms by a Trie-Based Complete Solution Archive

- Computer ScienceEvoCOP
- 2010

A complete solution archive based on a special binary trie structure for GAs with binary representations that efficiently stores all evaluated solutions during the heuristic search is proposed.

### Stabilized Branch-and-Price for the Rooted Delay-Constrained Steiner Tree Problem

- Computer ScienceINOC
- 2011

Various possibilities to speed-up the solution of the rooted delay-constrained Steiner tree problem by stabilization techniques are studied and the best among the resulting stabilized branch-and-price variants outperforms so-far proposed methods.

### An efficient delay-constrained minimum spanning tree heuristic

- Computer Science, Business
- 1996

This work proposes an efficient heuristic to solve the problem of constructing broadcast trees for real-time traffic with delay constraints in networks with asymmetric link loads as a delay-constrained minimum spanning tree (DCMST) problem in directed networks and proves that this problem is NP-complete.

### Modeling and solving the rooted distance-constrained minimum spanning tree problem

- Computer ScienceComput. Oper. Res.
- 2008

### A GRASP approach for the delay-constrained multicast routing problem

- Computer Science
- 2009

This paper investigates a GRASP (Greedy Randomized Adaptive Search Procedure) approach with VNS (Variable Neighborhood Search) as the local search strategy for the Delay-Constrained Least-Cost (DCLC) multicast routing problems.

### A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems

- Computer ScienceIPCO
- 2011

We present a layered graph model for delay-constrained minimum tree problems with a polynomial number of constraints which can be solved well for instances with low- to medium-sized sets of…