Please use this identifier to cite or link to this item:
Title: Discrete Particle Swarm Optimization for the minimum labelling Steiner tree problem
Authors: Consoli, S
Moreno-Pérez, J A
Darby-Dowman, K
Mladenović, N
Keywords: Combinatorial optimization;Discrete Particle Swarm Optimization;Heuristics;Minimum labelling Steiner tree problem;Graphs and Networks
Issue Date: 2008
Abstract: Particle Swarm Optimization is an evolutionary 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 evolution is obtained from the continuous movement of the particles that constitute the swarm submitted to the effect of the 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.
Appears in Collections:Publications
Dept of Mathematics Research Papers
Mathematical Sciences

Files in This Item:
File Description SizeFormat 
NCJ08.pdf220.85 kBAdobe PDFView/Open

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