Discrete Particle Swarm Optimization for the minimum labelling Steiner tree problem

Particle 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.

[1]  Russell C. Eberhart,et al.  A discrete binary version of the particle swarm algorithm , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.

[2]  Julian Togelius,et al.  Geometric particle swarm optimization , 2008 .

[3]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[4]  Stefan Voß,et al.  Metaheuristics Comparison for the Minimum Labelling Spanning Tree Problem , 2005 .

[5]  Mauro Birattari,et al.  Swarm Intelligence , 2012, Lecture Notes in Computer Science.

[6]  José Andrés Moreno Pérez,et al.  Exploring Feasible and Infeasible Regions in the Vehicle Routing Problem with Time Windows Using a Multi-objective Particle Swarm Optimization Approach , 2009 .

[7]  Chunguang Zhou,et al.  Fuzzy discrete particle swarm optimization for solving traveling salesman problem , 2004, The Fourth International Conference onComputer and Information Technology, 2004. CIT '04..

[8]  Nenad Mladenovic,et al.  Discrete Particle Swarm Optimization for the Minimum Labelling Steiner Tree Problem , 2007, NICSO.

[9]  Nenad Mladenovic,et al.  Greedy Randomized Adaptive Search and Variable Neighbourhood Search for the minimum labelling spanning tree problem , 2009, Eur. J. Oper. Res..

[10]  Cees Duin,et al.  The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs , 1999, Networks.

[11]  Bruce L. Golden,et al.  Improved Heuristics for the Minimum Label Spanning Tree Problem , 2006, IEEE Transactions on Evolutionary Computation.

[12]  Sven Oliver Krumke,et al.  On the Minimum Label Spanning Tree Problem , 1998, Inf. Process. Lett..

[13]  Douglas A. Wolfe,et al.  Nonparametric Statistical Methods , 1973 .

[14]  Ruay-Shiung Chang,et al.  The Minimum Labeling Spanning Trees , 1997, Inf. Process. Lett..

[15]  Chilukuri K. Mohan,et al.  Multi-phase Discrete Particle Swarm Optimization , 2002, JCIS.

[16]  David S. Johnson,et al.  The Complexity of Computing Steiner Minimal Trees , 1977 .

[17]  Shuyuan Yang,et al.  A quantum particle swarm optimization , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[18]  Stefan Voß,et al.  Modern Heuristic Search Methods for the Steiner Tree Problem in Graphs , 2000 .

[19]  C. Borror.  Nonparametric Statistical Methods, 2nd, Ed. , 2001 .

[20]  Rafael Martí.  Multi-Start Methods , 2003, Handbook of Metaheuristics.

[21]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[22]  Janez Demsar,et al.  Statistical Comparisons of Classifiers over Multiple Data Sets , 2006, J. Mach. Learn. Res..

[23]  Raffaele Cerulli,et al.  Extensions of the minimum labelling spanning tree problem , 2006 .

[24]  D. Wolfe,et al.  Nonparametric Statistical Methods. , 1974 .

[25]  José A. Moreno-Pérez,et al.  Exploring Feasible and Infeasible Regions in the Vehicle Routing Problem with Time Windows Using a Multi-objective Particle Swarm Optimization Approach , 2008, NICSO.

[26]  N. Franken,et al.  Combining particle swarm optimisation with angle modulation to solve binary problems , 2005, 2005 IEEE Congress on Evolutionary Computation.

[27]  M. Friedman.  A Comparison of Alternative Tests of Significance for the Problem of $m$ Rankings , 1940 .

[28]  Alcherio Martinoli,et al.  Discrete Multi-Valued Particle Swarm Optimization , 2006 .

[29]  S. Voss,et al.  The pilot method; a strategie of heuristic repetition with application to the Steiner problem in graphs , 1996 .

[30]  R. van Nes,et al.  Design of multimodal transport networks: A hierarchical approach , 2002 .

[31]  Alex Alves Freitas,et al.  A new discrete particle swarm algorithm applied to attribute selection in a bioinformatics data set , 2006, GECCO.