Show simple item record

dc.contributor.authorBlum, Christian
dc.contributor.authorBlesa Aguilera, Maria Josep
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.date.accessioned2016-11-29T10:40:53Z
dc.date.available2016-11-29T10:40:53Z
dc.date.issued2003-01
dc.identifier.citationBlum, C., Blesa, M. "Metaheuristics for the edge-weighted K-cardinality tree problem". 2003.
dc.identifier.urihttp://hdl.handle.net/2117/97393
dc.description.abstractMetaheuristics are successful algorithmic concepts to tackle extit{NP}-hard combinatorial optimization problems. In this paper we deal with metaheuristics for the K-cardinality tree (KCT) problem in edge-weighted graphs. This problem has several applications, which justify the need for efficient methods to obtain good solutions. There are already metaheuristic approaches to tackle the KCT problem to be found in the literature. However, there is a lack of benchmark problem instances and therefore also a lack of comparison between these approaches. Moreover, studies comparing metaheuristic approaches -- for whatever combinatorial optimization problem -- often suffer from the fact that they compare results obtained on different processors, on program code implemented in different programming languages and based on different data structures. In contrast to these studies, we aim for a fair comparison of three different metaheuristic approaches. We compare these approaches on a carefully chosen set of benchmark instances characterized by several distinguishing features. Our results show, that due to the different characteristics of different areas of the problem instance space none of our metaheuristic approaches can be identified as the best metaheuristic approach. It is rather the case that each approach has its advantages for certain areas of the problem instance space.
dc.format.extent40 p.
dc.language.isoeng
dc.relation.ispartofseriesLSI-03-1-R
dc.subjectÀrees temàtiques de la UPC::Informàtica::Informàtica teòrica
dc.subject.otherMetaheuristics
dc.subject.otherCombinatorial optimization
dc.subject.otherKCT
dc.subject.otherK-Cardinality tree Problem
dc.subject.otherAnt colony optimization
dc.subject.otherEvolutionary computation
dc.subject.otherTabu search
dc.subject.otherSpanning trees
dc.titleMetaheuristics for the edge-weighted K-cardinality tree problem
dc.typeExternal research report
dc.rights.accessOpen Access
local.identifier.drac1904646
dc.description.versionPostprint (published version)
local.citation.authorBlum, C.; Blesa, M.


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder