Show simple item record

dc.contributor.authorBlum, Christian
dc.contributor.authorBlesa Aguilera, Maria Josep
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics
dc.identifier.citationBlum, C., Blesa, M. "Combining ant colony optimization with dynamic programming for solving the k-cardinality tree problem". 2005.
dc.description.abstractResearch efforts in metaheuristics have shown that an intelligent incorporation of more classical optimization techniques in metaheuristics can be very beneficial. In this paper, we combine the metaheuristic ant colony optimization with dynamic programming for the application to the extsf{NP}-hard $k$-cardinality tree problem. Given an undirected graph $G$ with node and/or edge weights, the problem consists of finding a tree in $G$ with exactly $k$ edges such that the sum of the weights is minimal. In a standard ant colony optimization algorithm, ants construct trees with exactly $k$ edges. In our algorithm, ants may construct trees that have more than $k$ edges, in which case we use a recent dynamic programming algorithm to find---in polynomial time---the best $k$-cardinality tree embedded in the bigger tree constructed by the ants. We show that our hybrid algorithm improves over the standard ant colony optimization algorithm and, for node-weighted grid graph instances, is a current state-of-the-art method.
dc.format.extent9 p.
dc.subjectÀrees temàtiques de la UPC::Informàtica::Informàtica teòrica
dc.subject.otherAnt colony optimization
dc.subject.otherDynamic programming
dc.subject.otherk-cardinality tree problem
dc.titleCombining ant colony optimization with dynamic programming for solving the k-cardinality tree problem
dc.typeExternal research report
dc.rights.accessOpen Access
dc.description.versionPostprint (published version)
local.citation.authorBlum, C.; Blesa, M.

Files in this item


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