Heuristics for the strong generalized minimum label spanning tree problem. Issue 2 (4th March 2019)

• Record Type: Journal Article
• Authors: Cerrone, Carmine; D'Ambrosio, Ciriaco; Raiconi, Andrea
• Is Part Of: Networks. Volume 74:Issue 2(2019)
• Page Start: 148
• Page End: 160
• Publication Date: 2019-03-04
• Subjects: carousel greedy -- generalized problem -- minimum label spanning tree -- pilot method; Network analysis (Planning) -- Periodicals; 658.4032
• DOI: 10.1002/net.21882
• Languages: English
• ISSNs: 0028-3045

Abstract

Abstract: In this work we introduce and study the strong generalized minimum label spanning tree (GMLST), a novel optimization problem defined on edge‐labeled graphs. Given a label set associated to each edge of the input graph, the aim is to look for the spanning tree using the minimum number of labels. Differently from the previously introduced GMLST problem, including a given edge in the solution means that all its labels are used. We present a mathematical formulation, as well as three heuristic approaches to solve the problem. Computational results compare the performances of the proposed algorithms.