A hybrid heuristic for the diameter constrained minimum spanning tree problem

Authors:
Abilio Lucena;Celso C. Ribeiro;Andréa C. Santos
Affiliations:
Federal University of Rio de Janeiro, Rio de Janeiro, Brazil 22290-240;Institute of Computing, Federal University Fluminense, Niterói, Brazil 24210-240;Blaise Pascal University, LIMOS, Aubière, France 63173
Venue:
Journal of Global Optimization
Year:
2010

Citing 7
Cited 1

A tree-based algorithm for distributed mutual exclusion

ACM Transactions on Computer Systems (TOCS)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment

INFORMS Journal on Computing
Computing a diameter-constrained minimum spanning tree

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

Proceedings of the 2003 ACM symposium on Applied computing
A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees

Networks
Referee assignment in sports leagues

PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI

Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms

Journal of Global Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a hybrid GRASP and ILS based heuristic for the diameter constrained minimum spanning tree problem. The latter typically models network design applications where, under a given quality requirement, all vertices must be connected at minimum cost. An adaptation of the one time tree heuristic is used to build feasible diameter constrained spanning trees. Solutions thus obtained are then attempted to be improved through local search. Four different neighborhoods are investigated, in a scheme similar to VND. Upper bounds within 2% of optimality were obtained for problems in two test sets from the literature. Additionally, upper bounds stronger than those previously obtained in the literature are reported for OR-Library instances.