Comparison of Heuristics for Solving the Gmlst Problem
Given a graph G whose edges are labeled with one or more labels, the Generalized Minimum Label Spanning Tree problem seeks the spanning tree over this graph that uses the least number of labels. We provide a mathematical model for this problem and propose effective greedy heuristics and metaheuristics. We finally compare the results of these algorithms with benchmark heuristics for the related Minimum Label Spanning Tree problem.
KeywordsCombinatorial optimization computational comparison genetic algorithm greedy heuristic metaheuristic minimum label spanning tree
Unable to display preview. Download preview PDF.
- Cerulli, Raffaele, Fink, Andreas, Gentili,Monica, and Voss, Stefan (2005). Metaheuristics comparison for the minimum labelling spanning tree problem. In Golden, B, Raghavan, S, and Wasil, E, editors, The Next Wave in Computing, Optimization, and Decision Technologies, pages 93–106.Google Scholar
- Michalewicz, Z (1996). Genetic Algorithms+ Data Structures= Evolution Programs. Springer.Google Scholar
- Nummela, Jeremiah and Julstrom, Bryant A. (2006). An effective genetic algorithm for the minimum-label spanning tree problem. In GECCO ’06: Proceedings of the 8th Annual Conference on Genetic and Evolutionary Computation, pages 553–558, New York, NY, USA. ACM Press.Google Scholar
- Reinelt, G (1990). TSPLIB-A Traveling Salesman Problem Library. Inst. für Mathematik.Google Scholar
- Silberholz, John and Golden, Bruce (2007). The generalized traveling salesman problem: A new genetic algorithm approach. In Baker, E, Joseph, A, Mehrotra, A, and Trick, M, editors, Extending the Horizons: Advances in Computing, Optimization, and Decision Technology, pages 165–181.Google Scholar