A one-parameter genetic algorithm for the minimum labeling spanning tree problem

Authors:
Yupei Xiong;B. Golden;E. Wasil
Affiliations:
Dept. of Math., Univ. of Maryland, College Park, MD, USA;-;-
Venue:
IEEE Transactions on Evolutionary Computation
Year:
2005

Citing 0
Cited 8

An effective genetic algorithm for the minimum-label spanning tree problem

Proceedings of the 8th annual conference on Genetic and evolutionary computation
Energy-aware topology control for wireless sensor networks using memetic algorithms

Computer Communications
Greedy heuristics and evolutionary algorithms for the bounded minimum-label spanning tree problem

Proceedings of the 10th annual conference on Genetic and evolutionary computation
The labeled maximum matching problem

Computers and Operations Research
Variable neighborhood search for the cost constrained minimum label spanning tree and label constrained minimum spanning tree problems

Computers and Operations Research
The parameterized complexity of some minimum label problems

Journal of Computer and System Sciences
Comparison of heuristics for the colourful travelling salesman problem

International Journal of Metaheuristics
Multi-period street scheduling and sweeping

International Journal of Metaheuristics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given a connected, undirected graph G whose edges are labeled (or colored), the minimum labeling spanning tree (MLST) problem seeks a spanning tree on G with the minimum number of distinct labels (or colors). In recent work, the MLST problem has been shown to be NP-hard and an effective heuristic [maximum vertex covering algorithm (MVCA)] has been proposed and analyzed. We use a one-parameter genetic algorithm (GA) to solve the problem. In computational tests, the GA clearly outperforms MVCA.