Discrete particle swarm optimization for the minimum labelling steiner tree problem

Natural Computing

Volumn 9, Issue 1, 2010, Pages 29-46

  Consoli, Sergio ^a   Moreno Pérez, José Andrés ^b   Darby Dowman, Kenneth ^a   Mladenović, Nenad ^a  

^a BRUNEL UNIVERSITY   (United Kingdom)

^b UNIVERSIDAD DE LA LAGUNA   (Spain)

Author keywords

Combinatorial optimization; Discrete Particle Swarm Optimization; Graphs and networks; Heuristics; Minimum labelling Steiner tree problem

Indexed keywords

ALGORITHM; ARTICLE; COMPUTER NETWORK; DATA MINING; DISCRETE PARTICLE SWARM OPTIMIZATION; GEOMETRY; INFORMATION PROCESSING; JUMPING PARTICLE SWARM OPTIMIZATION; METHODOLOGY; MINIMUM LABELLING STEINER TREE PROBLEM; PARTICLE SWARM OPTIMIZATION; PROBLEM SOLVING; SOCIAL BEHAVIOR; SOCIAL ENVIRONMENT;

EID: 77949915983     PISSN: 15677818     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11047-009-9137-9     Document Type: Article

References (32)

1. Al-kazemi B, Mohan CK (2002) Multi-phase discrete particle swarm optimization. In: Fourth international workshop on frontiers in evolutionary algorithms, Kinsale, Ireland
2. Castro-Gutiérrez JP, Landa-Silva D, Moreno-Pérez JA (2008) Exploring feasible and infeasible regions in the vehicle routing problem with time windows using a multi-objective particle swarm optimization approach. In: Proceedings of international workshop on nature inspired cooperatives strategies for optimization (NICSO 2008)
3. Cerulli R, Fink A, Gentili M, Vo S (2005) Metaheuristics comparison for the minimum labelling spanning tree problem. In: Golden BL, Raghavan S, Wasil EA (eds) The next wave on computing, optimization, and decision technologies. Springer-Verlag, New York, pp 93-106
4. R Cerulli A Fink M Gentili S Vo 2006 Extensions of the minimum labelling spanning tree problem J Telecommun Inf Technol 4 39 45
5. RS Chang SJ Leu 1997 The minimum labelling spanning trees Inf Process Lett 63 5 277 282 10.1016/S0020-0190(97)00127-0 1475342
6. S Consoli K Darby-Dowman N Mladenović JA Moreno-Pérez 2008 Greedy randomized adaptive search and variable neighbourhood search for the minimum labelling spanning tree problem Eur J Oper Res 196 2 440 449 10.1016/j.ejor.2008.03.014
7. Consoli S, Moreno-Pérez JA, Darby-Dowman K, Mladenović N (2008b) Discrete particle swarm optimization for the minimum labelling Steiner tree problem. In: Krasnogor N, Nicosia G, Pavone M, Pelta D (eds) Nature inspired cooperative strategies for optimization, studies in computational intelligence, vol 129. Springer-Verlag, New York, pp 313-322
8. Correa ES, Freitas AA, Johnson CG (2006) A new discrete particle swarm algorithm applied to attribute selection in a bioinformatic data set. In: Proceedings of GECCO 2006, pp 35-42
9. J Demśar 2006 Statistical comparison of classifiers over multiple data sets J Mach Learn Res 7 1 30 2274360
10. C Duin S Vo 1999 The Pilot Method: a strategy for heuristic repetition with applications to the Steiner problem in graphs Networks 34 3 181 191 0980.90094 10.1002/(SICI)1097-0037(199910)34:3<181::AID-NET2>3.0.CO;2-Y 1715566
11. M Friedman 1940 A comparison of alternative tests of significance for the problem of m rankings Ann Math Stat 11 86 92 0063.01455 10.1214/aoms/1177731944
12. MR Garey RL Graham DS Johnson 1977 The complexity of computing Steiner minimal trees SIAM J Appl Math 32 835 859 0399.05023 10.1137/0132072 443427
13. Holland JH (1992) Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence. The MIT Press, Cambridge
14. Hollander M, Wolfe DA (1999) Nonparametric statistical methods, 2nd edn. Wiley, New York
15. Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Proceedings of the 4th IEEE international conference on neural networks, Perth, Australia, pp 1942-1948
16. Kennedy J, Eberhart R (1997) A discrete binary version of the particle swarm algorithm. In: IEEE conference on systems, man, and cybernetics, vol 5, pp 4104-4108
17. Kennedy J, Eberhart R (2001) Swarm intelligence. Morgan Kaufmann Publishers, San Francisco
18. SO Krumke HC Wirth 1998 On the minimum label spanning tree problem Inf Process Lett 66 2 81 85 0938.90064 10.1016/S0020-0190(98)00034-9 1627278
19. Martí R (2003) Multi-start methods. In: Glover F, Kochenberger G (eds) Handbook in metaheuristics. Kluwer, Dordrecht, pp 335-368
20. Martínez-García FJ, Moreno-Pérez JA (2008) Jumping frogs optimization: a new swarm method for discrete optimization. Technical Report DEIOC 3/2008, Department of Statistics, O.R. and Computing, University of La Laguna, Tenerife, Spain
21. Moraglio A, Di Chio C, Togelius J, Poli R (2008) Geometric particle swarm optimization. J Artif Evol Appl. doi: 10.1155/2008/143624
22. Moreno-Pérez JA, Castro-Gutiérrez JP, Martínez- García FJ, Melián B, Moreno-Vega JM, Ramos J (2007) Discrete Particle Swarm Optimization for the p-median problem. In: Proceedings of the 7th metaheuristics international conference, Montréal, Canada
23. Nemenyi PB (1963) Distribution-free multiple comparisons. Ph.D. thesis, Princeton University, New Jersey
24. Pampara G, Franken N, Engelbrecht AP (2005) Combining Particle Swarm Optimisation with angle modulation to solve binary problems. In: Proceedings of the IEEE congress on evolutionary computing, vol 1, pp 89-96
25. Pugh J, Martinoli A (2006) Discrete multi-valued particle swarm optimization. In: Proceedings of IEEE swarm intelligence symposium, vol 1, pp 103-110
26. Qu R, Xu Y, Castro-Gutiérrez JP, Landa-Silva D (2009) Particle swarm optimization for the Steiner tree in graph and delay-constrained multicast routing problems. Swarm Intelligence (submitted)
27. Secrest BR (2001) Traveling salesman problem for surveillance mission using Particle Swarm Optimization. Master's thesis, School of Engineering and Management of the Air Force Institute of Technology
28. Tanenbaum AS (1989) Computer Networks. Prentice-Hall, Englewood Cliffs
29. Van-Nes R (2002) Design of multimodal transport networks: a hierarchical approach. Delft University Press, Delft
30. Vo S (2000) Modern heuristic search methods for the Steiner tree problem in graphs. In: Du DZ, Smith JM, Rubinstein JH (eds) Advances in Steiner tree. Kluwer, Boston, pp 283-323
31. Y Xiong B Golden E Wasil 2006 Improved heuristics for the minimum labelling spanning tree problem IEEE Trans Evol Comput 10 6 700 703 10.1109/TEVC.2006.877147 (Pubitemid 46445558)
32. Yang S, Wang M, Jiao L (2004) A Quantum Particle Swarm Optimization. In: Proceedings of CEC2004, the congress on evolutionary computing, vol 1, pp 320-324