Please use this identifier to cite or link to this item:
|Title:||Heuristics based on greedy randomized adaptive search and variable neighbourhood search for the minimum labelling spanning tree problem|
|Keywords:||Metaheuristics;Combinatorial optimization;Minimum labelling spanning tree;Variable neighbourhood search;Greedy randomized adaptive search procedure|
|Citation:||Department of Mathematical Sciences Technical Reports, TR/01/07, May 2007|
|Abstract:||This paper studies heuristics for the minimum labelling spanning tree (MLST) problem. The purpose is to find a spanning tree using edges that are as similar as possible. Given an undirected labelled connected graph, the minimum labelling spanning tree problem seeks a spanning tree whose edges have the smallest number of distinct labels. This problem has been shown to be NP-complete. A Greedy Randomized Adaptive Search Procedure (GRASP) and different versions of Variable Neighbourhood Search (VNS) are proposed. They are compared with other algorithms recommended in the literature: the Modified Genetic Algorithm and the Pilot Method. Nonparametric statistical tests show that the heuristics based on GRASP and VNS outperform the other algorithms tested. Furthermore, a comparison with the results provided by an exact approach shows that we may quickly obtain optimal or near-optimal solutions with the proposed heuristics.|
|Appears in Collections:||Dept of Mathematics Research Papers|
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.