{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,17]],"date-time":"2024-07-17T14:01:34Z","timestamp":1721224894394},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,6,17]],"date-time":"2009-06-17T00:00:00Z","timestamp":1245196800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Nat Comput"],"published-print":{"date-parts":[[2010,3]]},"DOI":"10.1007\/s11047-009-9137-9","type":"journal-article","created":{"date-parts":[[2009,6,16]],"date-time":"2009-06-16T08:53:21Z","timestamp":1245142401000},"page":"29-46","source":"Crossref","is-referenced-by-count":39,"title":["Discrete Particle Swarm Optimization for the minimum labelling Steiner tree problem"],"prefix":"10.1007","volume":"9","author":[{"given":"Sergio","family":"Consoli","sequence":"first","affiliation":[]},{"given":"Jos\u00e9 Andr\u00e9s","family":"Moreno-P\u00e9rez","sequence":"additional","affiliation":[]},{"given":"Kenneth","family":"Darby-Dowman","sequence":"additional","affiliation":[]},{"given":"Nenad","family":"Mladenovi\u0107","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,6,17]]},"reference":[{"key":"9137_CR1","unstructured":"Al-kazemi B, Mohan CK (2002) Multi-phase discrete particle swarm optimization. In: Fourth international workshop on frontiers in evolutionary algorithms, Kinsale, Ireland"},{"key":"9137_CR2","doi-asserted-by":"crossref","unstructured":"Castro-Guti\u00e9rrez JP, Landa-Silva D, Moreno-P\u00e9rez 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)","DOI":"10.1007\/978-3-642-03211-0_9"},{"key":"9137_CR3","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/0-387-23529-9_7","volume-title":"The next wave on computing, optimization, and decision technologies","author":"R Cerulli","year":"2005","unstructured":"Cerulli R, Fink A, Gentili M, Vo\u00df 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\u2013106"},{"key":"9137_CR4","first-page":"39","volume":"4","author":"R Cerulli","year":"2006","unstructured":"Cerulli R, Fink A, Gentili M, Vo\u00df S (2006) Extensions of the minimum labelling spanning tree problem. J Telecommun Inf Technol 4:39\u201345","journal-title":"J Telecommun Inf Technol"},{"issue":"5","key":"9137_CR5","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/S0020-0190(97)00127-0","volume":"63","author":"RS Chang","year":"1997","unstructured":"Chang RS, Leu SJ (1997) The minimum labelling spanning trees. Inf Process Lett 63(5):277\u2013282","journal-title":"Inf Process Lett"},{"issue":"2","key":"9137_CR6","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1016\/j.ejor.2008.03.014","volume":"196","author":"S Consoli","year":"2008","unstructured":"Consoli S, Darby-Dowman K, Mladenovi\u0107 N, Moreno-P\u00e9rez JA (2008a) Greedy randomized adaptive search and variable neighbourhood search for the minimum labelling spanning tree problem. Eur J Oper Res 196(2):440\u2013449","journal-title":"Eur J Oper Res"},{"key":"9137_CR7","first-page":"313","volume-title":"Nature inspired cooperative strategies for optimization, studies in computational intelligence","author":"S Consoli","year":"2008","unstructured":"Consoli S, Moreno-P\u00e9rez JA, Darby-Dowman K, Mladenovi\u0107 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\u2013322"},{"key":"9137_CR8","doi-asserted-by":"crossref","unstructured":"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\u201342","DOI":"10.1145\/1143997.1144003"},{"key":"9137_CR9","first-page":"1","volume":"7","author":"J Dem\u015bar","year":"2006","unstructured":"Dem\u015bar J (2006) Statistical comparison of classifiers over multiple data sets. J Mach Learn Res 7:1\u201330","journal-title":"J Mach Learn Res"},{"issue":"3","key":"9137_CR10","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1002\/(SICI)1097-0037(199910)34:3<181::AID-NET2>3.0.CO;2-Y","volume":"34","author":"C Duin","year":"1999","unstructured":"Duin C, Vo\u00df S (1999) The Pilot Method: a strategy for heuristic repetition with applications to the Steiner problem in graphs. Networks 34(3):181\u2013191","journal-title":"Networks"},{"key":"9137_CR11","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1214\/aoms\/1177731944","volume":"11","author":"M Friedman","year":"1940","unstructured":"Friedman M (1940) A comparison of alternative tests of significance for the problem of m rankings. Ann Math Stat 11:86\u201392","journal-title":"Ann Math Stat"},{"key":"9137_CR12","doi-asserted-by":"crossref","first-page":"835","DOI":"10.1137\/0132072","volume":"32","author":"MR Garey","year":"1977","unstructured":"Garey MR, Graham RL, Johnson DS (1977) The complexity of computing Steiner minimal trees. SIAM J Appl Math 32:835\u2013859","journal-title":"SIAM J Appl Math"},{"key":"9137_CR13","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1090.001.0001","volume-title":"Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence","author":"JH Holland","year":"1992","unstructured":"Holland JH (1992) Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence. The MIT Press, Cambridge"},{"key":"9137_CR14","volume-title":"Nonparametric statistical methods","author":"M Hollander","year":"1999","unstructured":"Hollander M, Wolfe DA (1999) Nonparametric statistical methods, 2nd edn. Wiley, New York","edition":"2"},{"key":"9137_CR15","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Proceedings of the 4th IEEE international conference on neural networks, Perth, Australia, pp 1942\u20131948","DOI":"10.1109\/ICNN.1995.488968"},{"key":"9137_CR16","doi-asserted-by":"crossref","unstructured":"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\u20134108","DOI":"10.1109\/ICSMC.1997.637339"},{"key":"9137_CR17","volume-title":"Swarm intelligence","author":"J Kennedy","year":"2001","unstructured":"Kennedy J, Eberhart R (2001) Swarm intelligence. Morgan Kaufmann Publishers, San Francisco"},{"issue":"2","key":"9137_CR18","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/S0020-0190(98)00034-9","volume":"66","author":"SO Krumke","year":"1998","unstructured":"Krumke SO, Wirth HC (1998) On the minimum label spanning tree problem. Inf Process Lett 66(2):81\u201385","journal-title":"Inf Process Lett"},{"key":"9137_CR19","doi-asserted-by":"crossref","unstructured":"Mart\u00ed R (2003) Multi-start methods. In: Glover F, Kochenberger G (eds) Handbook in metaheuristics. Kluwer, Dordrecht, pp 335\u2013368","DOI":"10.1007\/0-306-48056-5_12"},{"key":"9137_CR20","unstructured":"Mart\u00ednez-Garc\u00eda FJ, Moreno-P\u00e9rez 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"},{"key":"9137_CR21","doi-asserted-by":"crossref","unstructured":"Moraglio A, Di Chio C, Togelius J, Poli R (2008) Geometric particle swarm optimization. J Artif Evol Appl. doi: 10.1155\/2008\/143624","DOI":"10.1155\/2008\/143624"},{"key":"9137_CR22","unstructured":"Moreno-P\u00e9rez JA, Castro-Guti\u00e9rrez JP, Mart\u00ednez-Garc\u00eda FJ, Meli\u00e1n 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\u00e9al, Canada"},{"key":"9137_CR23","unstructured":"Nemenyi PB (1963) Distribution-free multiple comparisons. Ph.D. thesis, Princeton University, New Jersey"},{"key":"9137_CR24","doi-asserted-by":"crossref","unstructured":"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\u201396","DOI":"10.1109\/CEC.2005.1554671"},{"key":"9137_CR25","unstructured":"Pugh J, Martinoli A (2006) Discrete multi-valued particle swarm optimization. In: Proceedings of IEEE swarm intelligence symposium, vol 1, pp 103\u2013110"},{"key":"9137_CR26","unstructured":"Qu R, Xu Y, Castro-Guti\u00e9rrez JP, Landa-Silva D (2009) Particle swarm optimization for the Steiner tree in graph and delay-constrained multicast routing problems. Swarm Intelligence (submitted)"},{"key":"9137_CR27","unstructured":"Secrest BR (2001) Traveling salesman problem for surveillance mission using Particle Swarm Optimization. Master\u2019s thesis, School of Engineering and Management of the Air Force Institute of Technology"},{"key":"9137_CR28","volume-title":"Computer networks","author":"AS Tanenbaum","year":"1989","unstructured":"Tanenbaum AS (1989) Computer Networks. Prentice-Hall, Englewood Cliffs"},{"key":"9137_CR29","unstructured":"Van-Nes R (2002) Design of multimodal transport networks: a hierarchical approach. Delft University Press, Delft"},{"key":"9137_CR30","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/978-1-4757-3171-2_13","volume-title":"Advances in Steiner tree","author":"S Vo\u00df","year":"2000","unstructured":"Vo\u00df 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\u2013323"},{"issue":"6","key":"9137_CR31","doi-asserted-by":"crossref","first-page":"700","DOI":"10.1109\/TEVC.2006.877147","volume":"10","author":"Y Xiong","year":"2006","unstructured":"Xiong Y, Golden B, Wasil E (2006) Improved heuristics for the minimum labelling spanning tree problem. IEEE Trans Evol Comput 10(6):700\u2013703","journal-title":"IEEE Trans Evol Comput"},{"key":"9137_CR32","unstructured":"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\u2013324"}],"container-title":["Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-009-9137-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11047-009-9137-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-009-9137-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T23:46:04Z","timestamp":1559346364000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11047-009-9137-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6,17]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,3]]}},"alternative-id":["9137"],"URL":"https:\/\/doi.org\/10.1007\/s11047-009-9137-9","relation":{},"ISSN":["1567-7818","1572-9796"],"issn-type":[{"value":"1567-7818","type":"print"},{"value":"1572-9796","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,6,17]]}}}