{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:17:49Z","timestamp":1740107869693,"version":"3.37.3"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"17","license":[{"start":{"date-parts":[[2016,11,11]],"date-time":"2016-11-11T00:00:00Z","timestamp":1478822400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Eusko Jaurlaritza (ES)","award":["BID3A"],"award-info":[{"award-number":["BID3A"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2017,9]]},"DOI":"10.1007\/s00500-016-2436-z","type":"journal-article","created":{"date-parts":[[2016,11,11]],"date-time":"2016-11-11T01:55:04Z","timestamp":1478829304000},"page":"4939-4952","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A simulation-based quantitative analysis on the topological heritability of Dandelion-encoded meta-heuristics for tree optimization problems"],"prefix":"10.1007","volume":"21","author":[{"given":"Cristina","family":"Perfecto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miren Nekane","family":"Bilbao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1260-9775","authenticated-orcid":false,"given":"Javier","family":"Del Ser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Armando","family":"Ferro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,11,11]]},"reference":[{"issue":"8","key":"2436_CR1","doi-asserted-by":"publisher","first-page":"767","DOI":"10.1016\/S0305-0548(00)00007-1","volume":"28","author":"FC Bazlama\u00e7","year":"2001","unstructured":"Bazlama\u00e7 FC, Hindi SK (2001) Minimum-weight spanning tree algorithms: a survey and empirical study. Comput Oper Res 28(8):767\u2013785. doi: 10.1016\/S0305-0548(00)00007-1","journal-title":"Comput Oper Res"},{"key":"2436_CR2","unstructured":"B\u00e4ck T, Hoffmeister F, Schwefel HP (1991) A survey of evolution strategies. In: Proceedings of the fourth international conference on genetic algorithms. Morgan Kaufmann"},{"key":"2436_CR3","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195099713.001.0001","volume-title":"Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms","author":"T B\u00e4ck","year":"1996","unstructured":"B\u00e4ck T (1996) Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms. Oxford University Press, Oxford"},{"key":"2436_CR4","first-page":"37","volume":"3","author":"O Bor\u016fvka","year":"1926","unstructured":"Bor\u016fvka O (1926) On a minimal problem. Pr\u00e1ce Moravsk\u00e9 Pridovedeck\u00e9 Spolecnosti 3:37\u201358","journal-title":"Pr\u00e1ce Moravsk\u00e9 Pridovedeck\u00e9 Spolecnosti"},{"key":"2436_CR5","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/11533719_27","volume":"3595","author":"S Caminiti","year":"2005","unstructured":"Caminiti S, Petreschi R (2005) String coding of trees with locality and heritability. Lect Notes Comput Sci 3595:251\u2013262. doi: 10.1007\/11533719_27","journal-title":"Lect Notes Comput Sci"},{"key":"2436_CR6","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1007\/978-3-642-01970-8_60","volume":"5544","author":"S Caminiti","year":"2009","unstructured":"Caminiti S, Petreschi R (2009) Parallel algorithms for Dandelion-Like codes. Lect Notes Comput Sci 5544:611\u2013620. doi: 10.1007\/978-3-642-01970-8_60","journal-title":"Lect Notes Comput Sci"},{"key":"2436_CR7","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/j.physa.2014.09.060","volume":"419","author":"MA Djauhari","year":"2015","unstructured":"Djauhari MA, Gan SL (2015) Optimality problem of network topology in stocks market analysis. Physica A 419:108\u2013114. doi: 10.1016\/j.physa.2014.09.060","journal-title":"Physica A"},{"issue":"10","key":"2436_CR8","doi-asserted-by":"publisher","first-page":"4491","DOI":"10.1073\/pnas.0914402107","volume":"107","author":"R Durrett","year":"2010","unstructured":"Durrett R (2010) Some features of the spread of epidemics and information on a random graph. Proc Natl Acad Sci USA 107(10):4491\u20134498. doi: 10.1073\/pnas.0914402107","journal-title":"Proc Natl Acad Sci USA"},{"issue":"1","key":"2436_CR9","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/0097-3165(86)90004-X","volume":"42","author":"\u00d6 E\u011fecio\u011flu","year":"1986","unstructured":"E\u011fecio\u011flu \u00d6, Remmel JB (1986) Bijections for Cayley trees, spanning trees, and their q-analogues. J Comb Theory A 42(1):15\u201330. doi: 10.1016\/0097-3165(86)90004-X","journal-title":"J Comb Theory A"},{"issue":"2","key":"2436_CR10","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1177\/003754970107600201","volume":"76","author":"ZW Geem","year":"2001","unstructured":"Geem ZW, Kim JH, Loganathan GV (2001) A new heuristic optimization algorithm: harmony search. Simulation 76(2):60\u201368. doi: 10.1177\/003754970107600201","journal-title":"Simulation"},{"key":"2436_CR11","volume-title":"Genetic algorithms and engineering optimization","author":"M Gen","year":"2000","unstructured":"Gen M, Cheng R (2000) Genetic algorithms and engineering optimization. Wiley, Hoboken"},{"key":"2436_CR12","first-page":"343","volume-title":"GECCO\u201901 Proceedings of the 3rd annual conference on genetic and evolutionary computation","author":"J Gottlieb","year":"2001","unstructured":"Gottlieb J, Julstrom BA, Raidl GR, Rothlauf F (2001) Pr\u00fcfer numbers: a poor representation of spanning trees for evolutionary search. In: Spector L (ed) GECCO\u201901 Proceedings of the 3rd annual conference on genetic and evolutionary computation. Morgan Kaufmann Publishers Inc, San Francisco, pp 343\u2013350"},{"key":"2436_CR13","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"JB Kruskal","year":"1956","unstructured":"Kruskal JB (1956) On the shortest spanning subtree of a graph and the travelling salesman problem. Proc Am Math Soc 7:48\u201350. doi: 10.1090\/S0002-9939-1956-0078686-7","journal-title":"Proc Am Math Soc"},{"key":"2436_CR14","doi-asserted-by":"publisher","unstructured":"Landa-Torres I, Manjarres D, Gil-L\u00f3pez S et\u00a0al (2012) A preliminary approach to near-optimal multi-hop capacitated network design using grouping-Dandelion encoded heuristics. In: International workshop on computer aided modeling and design of communication links and networks (CAMAD), Proceedings of IEEE 17th IEEE, Barcelona, pp 85\u201389. doi: 10.1109\/CAMAD.2012.6335385","DOI":"10.1109\/CAMAD.2012.6335385"},{"key":"2436_CR15","first-page":"379","volume-title":"World congress on computational intelligence","author":"C Palmer","year":"1994","unstructured":"Palmer C, Kershenbaum A (1994) Representing trees in genetic algorithms. World congress on computational intelligence. Proceedings of the First IEEE. IEEE, Orlando FL, pp 379\u2013384"},{"issue":"2","key":"2436_CR16","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1109\/TEVC.2006.871249","volume":"10","author":"T Paulden","year":"2006","unstructured":"Paulden T, Smith DK (2006) From the Dandelion code to the rainbow code: a class of bijective spanning tree representations with linear complexity and bounded locality. IEEE Trans Evol Comput 10(2):108\u2013123. doi: 10.1109\/TEVC.2006.871249","journal-title":"IEEE Trans Evol Comput"},{"key":"2436_CR17","doi-asserted-by":"publisher","unstructured":"Paulden T, Smith DK (2006b) Recent advances in the study of the Dandelion code, happy code, and blob code spanning tree representations. In: International conference on evolutionary computation, Proceedings of IEEE. IEEE, Vancouver BC, pp 2111\u20132118. doi: 10.1109\/CEC.2006.1688567","DOI":"10.1109\/CEC.2006.1688567"},{"key":"2436_CR18","doi-asserted-by":"publisher","unstructured":"Perez-Bellido AM, Salcedo-Sanz S, Ortiz-Garcia EG et al (2009) A Dandelion-encoded evolutionary algorithm for the delay-constrained capacitated minimum spanning tree problem. Comput Commun 32(1):154\u2013158. doi: 10.1016\/j.comcom.2008.09.030","DOI":"10.1016\/j.comcom.2008.09.030"},{"key":"2436_CR19","doi-asserted-by":"publisher","unstructured":"Perfecto C, Bilbao MN, Del Ser J et\u00a0al (2015) On the heritability of Dandelion-encoded harmony search heuristics for tree optimization problems. In: International symposium on innovations in intelligent systems and applications, Proceedings of IEEE. IEEE, Madrid, pp 1\u20138. doi: 10.1109\/INISTA.2015.7276763","DOI":"10.1109\/INISTA.2015.7276763"},{"key":"2436_CR20","doi-asserted-by":"publisher","unstructured":"Perfecto C, Bilbao MN, Del Ser J et\u00a0al (2016) Dandelion-encoded harmony search heuristics for opportunistic traffic offloading in synthetically modeled mobile networks. In: Kim JH (ed) Harmony search algorithm. Advances in intelligent systems and computing, vol 382. Springer, Berlin, pp 133\u2013145. doi: 10.1007\/978-3-662-47926-1_14","DOI":"10.1007\/978-3-662-47926-1_14"},{"key":"2436_CR21","unstructured":"Picciotto S (1999) How to encode a tree. Dissertation, University of California"},{"key":"2436_CR22","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"RC Prim","year":"1957","unstructured":"Prim RC (1957) Shortest connection networks and some generalizations. Bell Syst Tech J 36:1389\u20131401","journal-title":"Bell Syst Tech J"},{"key":"2436_CR23","doi-asserted-by":"publisher","DOI":"10.1002\/fedr.19750860506","author":"I Rechenberg","year":"1973","unstructured":"Rechenberg I (1973) Evolutionsstrategie optimierung technischer systeme nach prinzipien der biologischen evolution. Frommann-Holzboog, Stuttgart. doi: 10.1002\/fedr.19750860506","journal-title":"Frommann-Holzboog, Stuttgart."},{"key":"2436_CR24","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-88094-0","volume-title":"Representations for genetic and evolutionary algorithms","author":"F Rothlauf","year":"2002","unstructured":"Rothlauf F (2002) Representations for genetic and evolutionary algorithms. Springer, Berlin"},{"key":"2436_CR25","doi-asserted-by":"publisher","DOI":"10.1155\/2012\/738409","author":"J Sabattin","year":"2012","unstructured":"Sabattin J, Bolton C, Arias M, Parada V (2012) Evolutionary optimization of electric power distribution using the Dandelion code. J Electr Comp Eng. doi: 10.1155\/2012\/738409","journal-title":"J Electr Comp Eng"},{"issue":"4","key":"2436_CR26","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1109\/TEVC.2009.2039142","volume":"14","author":"S Salcedo-Sanz","year":"2010","unstructured":"Salcedo-Sanz S, Naldi M, Perez-Bellido AM et al (2010) Evolutionary optimization of service times in interactive voice response systems. IEEE Trans Evol Comput 14(4):602\u2013617. doi: 10.1109\/TEVC.2009.2039142","journal-title":"IEEE Trans Evol Comput"},{"key":"2436_CR27","doi-asserted-by":"publisher","DOI":"10.1155\/2014\/739768","author":"S Salcedo-Sanz","year":"2014","unstructured":"Salcedo-Sanz S, Del Ser J, Landa-Torres I et al (2014) The coral reefs optimization algorithm: a novel metaheuristic for efficiently solving optimization problems. Sci World J. doi: 10.1155\/2014\/739768","journal-title":"Sci World J"},{"issue":"1","key":"2436_CR28","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1109\/TEVC.2006.880730","volume":"11","author":"E Thompson","year":"2007","unstructured":"Thompson E, Paulden T, Smith DK (2007) The Dandelion code: a new coding of spanning trees for genetic algorithms. IEEE Trans Evol Comput 11(1):91\u2013100. doi: 10.1109\/TEVC.2006.880730","journal-title":"IEEE Trans Evol Comput"},{"issue":"2\u20133","key":"2436_CR29","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s12021-011-9122-1","volume":"9","author":"E T\u00fcretken","year":"2011","unstructured":"T\u00fcretken E, Gonz\u00e1lez G, Blum C et al (2011) Automated reconstruction of dendritic and axonal trees by global optimization with geometric priors. Neuroinformatics 9(2\u20133):279\u2013302. doi: 10.1007\/s12021-011-9122-1","journal-title":"Neuroinformatics"},{"issue":"2","key":"2436_CR30","doi-asserted-by":"publisher","first-page":"50","DOI":"10.4018\/jamc.2010040104","volume":"1","author":"D Weyland","year":"2010","unstructured":"Weyland D (2010) A rigorous analysis of the harmony search algorithm: how the research community can be misled by a methodology. Int J Appl Metaheuristic Comput 1(2):50\u201360. doi: 10.4018\/jamc.2010040104","journal-title":"Int J Appl Metaheuristic Comput"},{"key":"2436_CR31","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.orp.2015.04.001","volume":"2","author":"D Weyland","year":"2015","unstructured":"Weyland D (2015) A critical analysis of the harmony search algorithm\u2013how not to solve sudoku. Oper Res Perspect 2:97\u2013105. doi: 10.1016\/j.orp.2015.04.001","journal-title":"Oper Res Perspect"},{"issue":"9","key":"2436_CR32","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1109\/MC.2016.292","volume":"49","author":"XS Yang","year":"2016","unstructured":"Yang XS, Deb S, Fong S et al (2016) From swarm intelligence to metaheuristics: nature-inspired optimization algorithms. Computer 49(9):52\u201359. doi: 10.1109\/MC.2016.292","journal-title":"Computer"},{"key":"2436_CR33","volume-title":"Nature-inspired metaheuristic algorithms","author":"XS Yang","year":"2008","unstructured":"Yang XS (2008) Nature-inspired metaheuristic algorithms. Luniver Press, Frome"},{"key":"2436_CR34","doi-asserted-by":"publisher","unstructured":"Zhang L, Lampe M, Wang Z (2011) Topology Design of Industrial Ethernet Networks using a Multi-Objective Genetic Algorithm. In: Communications and Networking in China (CHINACOM), 6th International ICST Conference on. IEEE, Harbin, pp 735\u2013741. doi: 10.1109\/ChinaCom.2011.6158251","DOI":"10.1109\/ChinaCom.2011.6158251"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-016-2436-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-016-2436-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-016-2436-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T03:01:07Z","timestamp":1657681267000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-016-2436-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11,11]]},"references-count":34,"journal-issue":{"issue":"17","published-print":{"date-parts":[[2017,9]]}},"alternative-id":["2436"],"URL":"https:\/\/doi.org\/10.1007\/s00500-016-2436-z","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2016,11,11]]}}}