Improved Heuristics for the Minimum Label Spanning Tree Problem

Authors:
Yupei Xiong;B. Golden;E. Wasil
Affiliations:
Goldman, Sachs & Co, New York, NY;-;-
Venue:
IEEE Transactions on Evolutionary Computation
Year:
2006

Citing 0
Cited 3

Discrete Particle Swarm Optimization for the minimum labelling Steiner tree problem

Natural Computing: an international journal
Variable neighborhood search for the cost constrained minimum label spanning tree and label constrained minimum spanning tree problems

Computers and Operations Research
Comparison of heuristics for the colourful travelling salesman problem

International Journal of Metaheuristics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given a connected, undirected graph G whose edges are labeled, the minimum label (or labeling) spanning tree (MLST) problem seeks a spanning tree on G with the minimum number of distinct labels. Maximum vertex covering algorithm (MVCA) is a well-known heuristic for the MLST problem. It is very fast and performs reasonably well. Recently, we developed a genetic algorithm (GA) for the MLST problem. The GA and MVCA are similarly fast but the GA outperforms the MVCA. In this paper, we present four modified versions of MVCA, as well as a modified GA. These modified procedures generate better results, but are more expensive computationally. The modified GA is the best performer with respect to both accuracy and running time