Mathematics – Optimization and Control
Scientific paper
2012-01-11
Mathematics
Optimization and Control
Scientific paper
Given a connected, undirected graph whose edges are labelled (or coloured), the minimum labelling spanning tree (MLST) problem seeks a spanning tree whose edges have the smallest number of distinct labels (or colours). In recent work, the MLST problem has been shown to be NP-hard and some effective heuristics have been proposed and analyzed. In this paper we present an intelligent optimization algorithm to solve the problem. It is obtained by the basic Variable Neighbourhood Search heuristic with the integration of other complements from machine learning, statistics and experimental algorithmics, in order to produce high-quality performance and to completely automate the resulting optimization strategy. We present experimental results on randomly generated graphs with different statistical properties, showing the crucial effects of the implementation, the robustness, and the empirical scalability of our intelligent algorithm. Furthermore, the computational experiments show that the proposed strategy outperforms the heuristics recommended in the literature and is able to obtain optimal or near-optimal solutions in short computational running time.
Consoli Sergio
Mladenovic Nenad
Moreno-Perez Jose Andres
No associations
LandOfFree
Solving the minimum labelling spanning tree problem using intelligent optimization does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Solving the minimum labelling spanning tree problem using intelligent optimization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Solving the minimum labelling spanning tree problem using intelligent optimization will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-604367