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

Authors:
Arindam Khaled;Bryant A. Julstrom
Affiliations:
St. Cloud State University, Saint Cloud, MN, USA;St. Cloud State University, Saint Cloud, MN, USA
Venue:
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Year:
2008

Citing 5
Cited 0

A study of permutation crossover operators on the traveling salesman problem

Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
The minimum labeling spanning trees

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

Proceedings of the 8th annual conference on Genetic and evolutionary computation
A one-parameter genetic algorithm for the minimum labeling spanning tree problem

IEEE Transactions on Evolutionary Computation
Local search for the minimum label spanning tree problem with bounded color classes

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given an edge-labeled, connected, undirected graph G and a bound r1, the bounded minimum-label spanning tree problem seeks a spanning tree on G whose edges carry the fewest possible labels and in which no label appears more than r times. Two greedy heuristics for the unbounded version of the problem are adapted to the bounded version. Two genetic algorithms for the problem encode labeled spanning trees as permutations of G's edges. A simple GA performs poorly, but the addition of local search enables consistently good results.