Please use this identifier to cite or link to this item: http://buratest.brunel.ac.uk/handle/2438/3560
Full metadata record
DC FieldValueLanguage
dc.contributor.authorConsoli, S-
dc.contributor.authorDarby-Dowman, K-
dc.contributor.authorMladenović, N-
dc.contributor.authorMoreno-Pérez, JA-
dc.coverage.spatial26en
dc.date.accessioned2009-07-31T11:54:09Z-
dc.date.available2009-07-31T11:54:09Z-
dc.date.issued2009-
dc.identifier.citationAnnals of Operations Research. 172(1): 71-96, Jan 2009en
dc.identifier.issn0254-5330-
dc.identifier.urihttp://www.springerlink.com/content/0314645h68733745/en
dc.identifier.urihttp://bura.brunel.ac.uk/handle/2438/3560-
dc.description.abstractWe 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 timesen
dc.format.extent381150 bytes-
dc.format.mimetypeapplication/pdf-
dc.language.isoen-
dc.publisherSpringeren
dc.subjectMetaheuristics; Combinatorial optimization; Minimum labelling Steiner tree problem; Variable neighbourhood search; Graphsen
dc.titleVariable neighbourhood search for the minimum labelling Steiner tree problemen
dc.typeResearch Paperen
Appears in Collections:Computer Science
Dept of Mathematics Research Papers
Mathematical Sciences

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.