{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T03:32:16Z","timestamp":1773286336484,"version":"3.50.1"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,3,28]],"date-time":"2018-03-28T00:00:00Z","timestamp":1522195200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Memetic Comp."],"published-print":{"date-parts":[[2019,3]]},"DOI":"10.1007\/s12293-018-0256-7","type":"journal-article","created":{"date-parts":[[2018,3,28]],"date-time":"2018-03-28T10:24:41Z","timestamp":1522232681000},"page":"35-52","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Baldwin effect and Lamarckian evolution in a memetic algorithm for Euclidean Steiner tree problem"],"prefix":"10.1007","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7153-980X","authenticated-orcid":false,"given":"Micha\u0142","family":"Bereta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,3,28]]},"reference":[{"key":"256_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-13915-9","volume-title":"Optimal interconnection trees in the plane. Theory, algorithms and applications","author":"M Brazil","year":"2015","unstructured":"Brazil M, Zachariasen M (2015) Optimal interconnection trees in the plane. Theory, algorithms and applications. Springer, Berlin. \n                    https:\/\/doi.org\/10.1007\/978-3-319-13915-9"},{"key":"256_CR2","doi-asserted-by":"publisher","first-page":"143","DOI":"10.4153\/CMB-1961-016-2","volume":"4","author":"ZA Melzak","year":"1961","unstructured":"Melzak ZA (1961) On the problem of Steiner. Can Math Bull 4:143\u2013148","journal-title":"Can Math Bull"},{"key":"256_CR3","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1002\/(SICI)1097-0037(199710)30:3<149::AID-NET1>3.0.CO;2-L","volume":"30","author":"P Winter","year":"1997","unstructured":"Winter P, Zachariasen M (1997) Euclidean Steiner minimum trees: an improved exact algorithm. Networks 30:149\u2013166. \n                    https:\/\/doi.org\/10.1002\/(SICI)1097-0037(199710)30:3%3c149::AID-NET1%3e3.0.CO;2-L","journal-title":"Networks"},{"key":"256_CR4","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1137\/0150015","volume":"50","author":"D Trietsch","year":"1990","unstructured":"Trietsch D, Hwang F (1990) An improved algorithm for steiner trees. SIAM J Appl Math 50:244\u2013263. \n                    https:\/\/doi.org\/10.1137\/0150015","journal-title":"SIAM J Appl Math"},{"key":"256_CR5","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/BF01758756","volume":"7","author":"WD Smith","year":"1992","unstructured":"Smith WD (1992) How to find Steiner minimal trees in euclideand-space. Algorithmica 7:137\u2013177. \n                    https:\/\/doi.org\/10.1007\/BF01758756","journal-title":"Algorithmica"},{"key":"256_CR6","unstructured":"Barreiros J (2003) A hierarchic genetic algorithm for computing (near) optimal euclidean steiner trees. In: Barry AM (ed) GECCO 2003: Proceedings of the bird of a feather workshops, genetic and evolutionary computation conference. AAAI, Chigaco, pp 56\u201365"},{"key":"256_CR7","unstructured":"Jesus M, Jesus S, M\u00e1rquez A (2004) Steiner trees optimization using genetic algorithms. Technical report"},{"key":"256_CR8","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/s11390-006-0147-0","volume":"21","author":"Y Hu","year":"2006","unstructured":"Hu Y, Jing T, Feng Z, Hong X-L, Hu X-D, Yan G-Y (2006) ACO-Steiner: ant colony optimization based rectilinear steiner minimal tree algorithm. J Comput Sci Technol 21:147\u2013152. \n                    https:\/\/doi.org\/10.1007\/s11390-006-0147-0","journal-title":"J Comput Sci Technol"},{"key":"256_CR9","doi-asserted-by":"publisher","first-page":"818","DOI":"10.1109\/TC.2013.229","volume":"64","author":"L Liu","year":"2015","unstructured":"Liu L, Song Y, Zhang H, Ma H, Vasilakos AV (2015) Physarum optimization: a biology-inspired algorithm for the steiner tree problem in networks. IEEE Trans Comput 64:818\u2013831. \n                    https:\/\/doi.org\/10.1109\/TC.2013.229","journal-title":"IEEE Trans Comput"},{"key":"256_CR10","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1109\/TEVC.2011.2132725","volume":"15","author":"X Chen","year":"2011","unstructured":"Chen X, Ong YS, Lim MH, Tan KC (2011) A multi-facet survey on memetic computation. IEEE Trans Evol Comput 15:591\u2013607. \n                    https:\/\/doi.org\/10.1109\/TEVC.2011.2132725","journal-title":"IEEE Trans Evol Comput"},{"key":"256_CR11","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s12293-009-0011-1","volume":"1","author":"R Meuth","year":"2009","unstructured":"Meuth R, Lim MH, Ong YS, Wunsch DC (2009) A proposition on memes and meta-memes in computing for higher-order learning. MemetComput 1:85\u2013100. \n                    https:\/\/doi.org\/10.1007\/s12293-009-0011-1","journal-title":"MemetComput"},{"key":"256_CR12","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/s12293-012-0076-0","volume":"4","author":"J Botzheim","year":"2012","unstructured":"Botzheim J, Toda Y, Kubota N (2012) Bacterial memetic algorithm for offline path planning of mobile robots. Memet Comput 4:73\u201386. \n                    https:\/\/doi.org\/10.1007\/s12293-012-0076-0","journal-title":"Memet Comput"},{"key":"256_CR13","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s12293-011-0070-y","volume":"4","author":"MC Goldbarg","year":"2012","unstructured":"Goldbarg MC, Asconavieta PH, Goldbarg EFG (2012) Memetic algorithm for the traveling car renter problem: an experimental investigation. Memet Comput 4:89\u2013108. \n                    https:\/\/doi.org\/10.1007\/s12293-011-0070-y","journal-title":"Memet Comput"},{"key":"256_CR14","doi-asserted-by":"publisher","first-page":"2112","DOI":"10.1007\/s12293-016-0183-4","volume":"8","author":"MR Mirsaleh","year":"2016","unstructured":"Mirsaleh MR, Meybodi MR (2016) A new memetic algorithm based on cellular learning automata for solving the vertex coloring problem. Memet Comput 8:2112\u2013222. \n                    https:\/\/doi.org\/10.1007\/s12293-016-0183-4","journal-title":"Memet Comput"},{"key":"256_CR15","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s12293-008-0004-5","volume":"1","author":"SMK Hasan","year":"2009","unstructured":"Hasan SMK, Sarker R, Essam D, Cornforth D (2009) Memetic algorithms for solving job-shop scheduling problems. Memet Comput 1:69\u201383. \n                    https:\/\/doi.org\/10.1007\/s12293-008-0004-5","journal-title":"Memet Comput"},{"key":"256_CR16","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s12293-012-0097-8","volume":"4","author":"MR Karim","year":"2012","unstructured":"Karim MR, Ryan C (2012) Attributed grammatical evolution with lookahead for the multiple knapsack problem. Memet Comput 4:279\u2013302. \n                    https:\/\/doi.org\/10.1007\/s12293-012-0097-8","journal-title":"Memet Comput"},{"key":"256_CR17","doi-asserted-by":"crossref","unstructured":"Whitley D, Gordon VS, Mathias K (1994) Lamarckian evolution, the Baldwin effect and function optimization. In: Davidor Y, Schwefel H-P, M\u00e4nner R (eds) Parallel problem solving from nature\u2014PPSN III SE-1. Springer, Berlin, pp 5\u201315","DOI":"10.1007\/3-540-58484-6_245"},{"key":"256_CR18","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1109\/TEVC.2003.819944","volume":"8","author":"YS Ong","year":"2004","unstructured":"Ong YS, Keane AJ (2004) Meta\u2013Lamarckian learning in memetic algorithms. IEEE Trans Evol Comput 8:99\u2013110. \n                    https:\/\/doi.org\/10.1109\/TEVC.2003.819944","journal-title":"IEEE Trans Evol Comput"},{"key":"256_CR19","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1109\/TEVC.2006.890270","volume":"11","author":"S Elfwing","year":"2007","unstructured":"Elfwing S, Uchibe E, Doya K, Christensen HI (2007) Evolutionary development of hierarchical learning structures. IEEE Trans Evol Comput 11:249\u2013264. \n                    https:\/\/doi.org\/10.1109\/TEVC.2006.890270","journal-title":"IEEE Trans Evol Comput"},{"key":"256_CR20","doi-asserted-by":"crossref","unstructured":"Paenke I, Sendhoff B, Rowe J, Fernando C (2007) On the adaptive disadvantage of lamarckianism in rapidly changing environments. In: Proceedings of the 9th European conference on advances in artificial life, Springer, Berlin, pp 355\u2013364","DOI":"10.1007\/978-3-540-74913-4_36"},{"key":"256_CR21","doi-asserted-by":"crossref","unstructured":"Ishibuchi H, Kaige S, Narukawa K (2005) Comparison between lamarckian and baldwinian repair on multiobjective 0\/1 knapsack problems. In: Coello Coello CA, Hern\u00e1ndez Aguirre A, Zitzler E (eds) Evolutionary multi-criterion optimization: third international conference, EMO 2005, Guanajuato, Mexico, March 9\u201311, 2005. Proceedings. Springer, Berlin, pp 370\u2013385","DOI":"10.1007\/978-3-540-31880-4_26"},{"key":"256_CR22","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1109\/TEVC.2004.841682","volume":"9","author":"S-S Choi","year":"2005","unstructured":"Choi S-S, Moon B-R (2005) A graph-based Lamarckian\u2013Baldwinian hybrid for the sorting network problem. IEEE Trans Evol Comput 9:105\u2013114. \n                    https:\/\/doi.org\/10.1109\/TEVC.2004.841682","journal-title":"IEEE Trans Evol Comput"},{"key":"256_CR23","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.swevo.2011.02.002","volume":"1","author":"J Derrac","year":"2011","unstructured":"Derrac J, Garc\u00eda S, Molina D, Herrera F (2011) A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evolut Comput 1:3\u201318. \n                    https:\/\/doi.org\/10.1016\/j.swevo.2011.02.002","journal-title":"Swarm Evolut Comput"},{"key":"256_CR24","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s00500-008-0323-y","volume":"17","author":"J Alcal\u00e1-Fdez","year":"2011","unstructured":"Alcal\u00e1-Fdez J, Fern\u00e1ndez A, Luengo J, Derrac J, Garc\u00eda S, S\u00e1nchez L, Herrera F (2011) KEEL data-mining software tool: data set repository, integration of algorithms and experimental analysis framework. J Mult-Valued Log Soft Comput 17:255\u2013287. \n                    https:\/\/doi.org\/10.1007\/s00500-008-0323-y","journal-title":"J Mult-Valued Log Soft Comput"},{"key":"256_CR25","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"JE Beasley","year":"1990","unstructured":"Beasley JE (1990) OR-library: distributing test problems by electronic mail. J Oper Res Soc 41:1069\u20131072","journal-title":"J Oper Res Soc"}],"container-title":["Memetic Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12293-018-0256-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-018-0256-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-018-0256-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,27]],"date-time":"2019-03-27T20:24:27Z","timestamp":1553718267000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12293-018-0256-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,28]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,3]]}},"alternative-id":["256"],"URL":"https:\/\/doi.org\/10.1007\/s12293-018-0256-7","relation":{},"ISSN":["1865-9284","1865-9292"],"issn-type":[{"value":"1865-9284","type":"print"},{"value":"1865-9292","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,3,28]]},"assertion":[{"value":"10 December 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 March 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 March 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}