DC FieldValueLanguage
dc.contributor.authorConsoli, Sergioen
dc.contributor.authorMoreno-Pérez, José A.en
dc.contributor.authorDarby-Dowman, Kennethen
dc.contributor.authorMladenović, Nenaden
dc.date.accessioned2020-05-02T16:42:09Z-
dc.date.available2020-05-02T16:42:09Z-
dc.date.issued2010-01-01en
dc.identifier.issn1567-7818en
dc.description.abstractParticle Swarm Optimization is a population-based method inspired by the social behaviour of individuals inside swarms in nature. Solutions of the problem are modelled as members of the swarm which fly in the solution space. The improvement of the swarm is obtained from the continuous movement of the particles that constitute the swarm submitted to the effect of inertia and the attraction of the members who lead the swarm. This work focuses on a recent Discrete Particle Swarm Optimization for combinatorial optimization, called Jumping Particle Swarm Optimization. Its effectiveness is illustrated on the minimum labelling Steiner tree problem: given an undirected labelled connected graph, the aim is to find a spanning tree covering a given subset of nodes, whose edges have the smallest number of distinct labels.en
dc.publisherSpringer Link-
dc.relationE.U. Marie Curie Fellowship for Early Stage Researcher Training, Grant no. MEST-CT-2004-006724-
dc.relationSpanish Government, Grant no. TIN2005-08404-C04-03-
dc.relationCanary Government, Grant no. PI042005/044-
dc.relation.ispartofNatural Computingen
dc.subjectCombinatorial optimization | Discrete Particle Swarm Optimization | Graphs and networks | Heuristics | Minimum labelling Steiner tree problemen
dc.titleDiscrete particle swarm optimization for the minimum labelling steiner tree problemen
dc.typeArticleen
dc.identifier.doi10.1007/s11047-009-9137-9en
dc.identifier.scopus2-s2.0-77949915983en
dc.relation.firstpage29en
dc.relation.lastpage46en
dc.relation.issue1en
dc.relation.volume9en
item.fulltextNo Fulltext-
item.openairetypeArticle-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.cerifentitytypePublications-
item.grantfulltextnone-
crisitem.author.orcid0000-0001-6655-0409-
Show simple item record

SCOPUSTM   
Citations

35
checked on Nov 27, 2022

Page view(s)

29
checked on Nov 28, 2022

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.