Brunel University Research Archive (BURA) >
College of Engineering, Design and Physical Sciences >
Dept of Mathematics >
Dept of Mathematics Research Papers >

Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/3560

Title: Variable neighbourhood search for the minimum labelling Steiner tree problem
Authors: Consoli, S
Darby-Dowman, K
Mladenović, N
Moreno-Pérez, JA
Keywords: Metaheuristics; Combinatorial optimization; Minimum labelling Steiner tree problem; Variable neighbourhood search; Graphs
Publication Date: 2009
Publisher: Springer
Citation: Annals of Operations Research. 172(1): 71-96, Jan 2009
Abstract: We present a study on heuristic solution approaches to the minimum labelling Steiner tree problem, an NP-hard graph problem related to the minimum labelling spanning tree problem. Given an undirected labelled connected graph, the aim is to find a spanning tree covering a given subset of nodes of the graph, whose edges have the smallest number of distinct labels. Such a model may be used to represent many real world problems in telecommunications and multimodal transportation networks. Several metaheuristics are proposed and evaluated. The approaches are compared to the widely adopted Pilot Method and it is shown that the Variable Neighbourhood Search that we propose is the most effective metaheuristic for the problem, obtaining high quality solutions in short computational running times
URI: http://www.springerlink.com/content/0314645h68733745/
http://bura.brunel.ac.uk/handle/2438/3560
ISSN: 0254-5330
Appears in Collections:Mathematical Science
Computer Science
Dept of Mathematics Research Papers

Files in This Item:

File Description SizeFormat
Fulltext.pdf372.22 kBAdobe PDFView/Open

Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.