Variable neighborhood search and ant colony optimization for the rooted delay-constrained minimum spanning tree problem

Authors:
Mario Ruthmair;Günther R. Raidl
Affiliations:
Institute of Computer Graphics and Algorithms, Vienna University of Technology, Vienna, Austria;Institute of Computer Graphics and Algorithms, Vienna University of Technology, Vienna, Austria
Venue:
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part II
Year:
2010

Citing 8
Cited 5

Direct methods for sparse matrices

Direct methods for sparse matrices
MAX-MIN Ant system

Future Generation Computer Systems
The Delay-Constrained Minimum Spanning Tree Problem

ISCC '97 Proceedings of the 2nd IEEE Symposium on Computers and Communications (ISCC '97)
Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO

Proceedings of the 8th annual conference on Genetic and evolutionary computation
Modeling and solving the rooted distance-constrained minimum spanning tree problem

Computers and Operations Research
A Path Relinking Approach for Delay-Constrained Least-Cost Multicast Routing Problem

ICTAI '07 Proceedings of the 19th IEEE International Conference on Tools with Artificial Intelligence - Volume 01
A Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem

Computer Aided Systems Theory - EUROCAST 2009
A Variable Neighborhood Descent Search Algorithm for Delay-Constrained Least-Cost Multicast Routing

Learning and Intelligent Optimization

A layered graph model and an adaptive layers framework to solve delay-constrained minimum tree problems

IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Stabilized branch-and-price for the rooted delay-constrained steiner tree problem

INOC'11 Proceedings of the 5th international conference on Network optimization
A multilevel heuristic for the rooted delay-constrained minimum spanning tree problem

EUROCAST'11 Proceedings of the 13th international conference on Computer Aided Systems Theory - Volume Part I
A memetic algorithm and a solution archive for the rooted delay-constrained minimum spanning tree problem

EUROCAST'11 Proceedings of the 13th international conference on Computer Aided Systems Theory - Volume Part I
On solving the rooted delay- and delay-variation-constrained steiner tree problem

ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting networks where quality of service constraints are of concern. We present two new approaches to solve this problem heuristically following the concepts of ant colony optimization (ACO) and variable neighborhood search (VNS). The ACO uses a fast construction heuristic based on node delays and local improvement exploiting two different neighborhood structures. The VNS employs the same neighborhood structures but additionally applies various kinds of shaking moves. Experimental results indicate that both metaheuristics outperform existing approaches whereas the ACO produces mostly the best solutions.