{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,16]],"date-time":"2025-07-16T13:25:48Z","timestamp":1752672348375,"version":"3.37.0"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,11,25]],"date-time":"2009-11-25T00:00:00Z","timestamp":1259107200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Genet Program Evolvable Mach"],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1007\/s10710-009-9096-z","type":"journal-article","created":{"date-parts":[[2009,11,24]],"date-time":"2009-11-24T10:47:06Z","timestamp":1259059626000},"page":"227-246","source":"Crossref","is-referenced-by-count":46,"title":["EvAg: a scalable peer-to-peer evolutionary algorithm"],"prefix":"10.1007","volume":"11","author":[{"given":"J. L. J.","family":"Laredo","sequence":"first","affiliation":[]},{"given":"A. E.","family":"Eiben","sequence":"additional","affiliation":[]},{"given":"M.","family":"van Steen","sequence":"additional","affiliation":[]},{"given":"J. J.","family":"Merelo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,11,25]]},"reference":[{"key":"9096_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-1997-9","volume-title":"A Connectionist Machine for Genetic Hillclimbing","author":"D.H. Ackley","year":"1987","unstructured":"D.H. Ackley, A Connectionist Machine for Genetic Hillclimbing. (Kluwer, Norwell, MA, 1987)"},{"issue":"5","key":"9096_CR2","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1109\/TEVC.2002.800880","volume":"6","author":"E. Alba","year":"2002","unstructured":"E. Alba, M. Tomassini, Parallelism and evolutionary algorithms. IEEE Trans. Evol. Comput. 6(5), 443\u2013462 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"9096_CR3","doi-asserted-by":"crossref","unstructured":"M. Arenas, P. Collet, A.E. Eiben, M. Jelasity, J.J. Merelo, B. Paechter, M. Preuss, M. Schoenauer, A framework for distributed evolutionary algorithms. In Parallel Problem Solving from Nature\u2014PPSN VII, Granada, Spain, No. 2439 in Lecture Notes in Computer Science, LNCS. (Springer, 2002), pp. 665\u2013675","DOI":"10.1007\/3-540-45712-7_64"},{"key":"9096_CR4","doi-asserted-by":"crossref","unstructured":"B. B\u00e1nhelyi, M. Biazzini, A. Montresor, M. Jelasity, Peer-to-peer optimization in large unreliable networks with branch-and-bound and particle swarms. In Applications of Evolutionary Computing, Lecture Notes in Computer Science, ed. by M. Giacobini, A. Brabazon, S. Cagnoni, G.A.D. Caro, A. Ek\u00e1rt, A.I. Esparcia-Alc\u00e1zar, M. Farooq, A. Fink, P. Machado (Springer, 2009), pp. 87\u201392","DOI":"10.1007\/978-3-642-01129-0_10"},{"key":"9096_CR5","doi-asserted-by":"crossref","unstructured":"J. Berntsson, G2DGA: an adaptive framework for internet-based distributed genetic algorithms. In GECCO \u201905: Proceedings of the 2005 workshops on Genetic and evolutionary computation, pp. 346\u2013349","DOI":"10.1145\/1102256.1102333"},{"key":"9096_CR6","volume-title":"Efficient and Accurate Parallel Genetic Algorithms","author":"E. Cant\u00fa-Paz","year":"2000","unstructured":"E. Cant\u00fa-Paz, Efficient and Accurate Parallel Genetic Algorithms. (Kluwer, Norwell, MA, 2000)"},{"key":"9096_CR7","doi-asserted-by":"crossref","unstructured":"K. Deb, D.E. Goldberg, Analyzing deception in trap functions. In Foundations of Genetic Algorithms. (Morgan Kaufmann, 1991), pp. 93\u2013108","DOI":"10.1016\/B978-0-08-094832-4.50012-X"},{"key":"9096_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-05094-1","volume-title":"Introduction to Evolutionary Computing","author":"A.E. Eiben","year":"2003","unstructured":"A.E. Eiben, J.E. Smith, Introduction to Evolutionary Computing. (Springer, Berlin, 2003)"},{"key":"9096_CR9","unstructured":"A.E. Eiben, A.R. Griffioen, E. Haasdijk, Population-based adaptive systems: concepts, issues, and the platform NEW TIES. In Proceedings of European Conference on Complex Systems, Dresden, Germany, http:\/\/www.cs.vu.nl\/~gusz\/papers\/2007-ECCS-PAS.pdf"},{"key":"9096_CR10","doi-asserted-by":"crossref","unstructured":"G. Folino, G. Spezzano, P-cage: an environment for evolutionary computation in peer-to-peer systems. In EuroGP, Lecture Notes in Computer Science, vol. 3905, ed. by P. Collet, M. Tomassini, M. Ebner, S. Gustafson, A. Ek\u00e1rt (Springer, 2006), pp. 341\u2013350","DOI":"10.1007\/11729976_31"},{"key":"9096_CR11","doi-asserted-by":"crossref","unstructured":"M. Giacobini, E. Alba, A. Tettamanzi, M. Tomassini, Modeling selection intensity for toroidal cellular evolutionary algorithms. In GECCO \u201904: Proceedings of the 2004 conference on Genetic and Evolutionary Computation (Springer, Berlin\/Heidelberg, LNCS, 2004), pp. 1138\u20131149","DOI":"10.1007\/978-3-540-24854-5_111"},{"key":"9096_CR12","doi-asserted-by":"crossref","unstructured":"M. Giacobini, M. Tomassini, A. Tettamanzi, Takeover time curves in random and small-world structured populations. In GECCO \u201905: Proceedings of the 2005 conference on Genetic and evolutionary computation (ACM, New York, NY, 2005a), pp. 1333\u20131340. http:\/\/www.doi.acm.org\/10.1145\/1068009.1068224","DOI":"10.1145\/1068009.1068224"},{"issue":"5","key":"9096_CR13","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1109\/TEVC.2005.850298","volume":"9","author":"M. Giacobini","year":"2005","unstructured":"M. Giacobini, M. Tomassini, A. Tettamanzi, E. Alba, Selection intensity in cellular evolutionary algorithms for regular lattices. IEEE Trans. Evol. Comput. 9(5), 489\u2013505 (2005b)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"9096_CR14","doi-asserted-by":"crossref","unstructured":"M. Giacobini, M. Preuss, M. Tomassini, Effects of scale-free and small-world topologies on binary coded self-adaptive CEA. In Evolutionary Computation in Combinatorial Optimization\u2014EvoCOP 2006, vol. 3906, ed. by J. Gottlieb, G.R. Raidl (Springer, Budapest, LNCS, 2006), pp. 85\u201396","DOI":"10.1007\/11730095_8"},{"key":"9096_CR15","volume-title":"The Design of Innovation\u2014Lessons from and for Competent Genetic Algorithms","author":"D.E. Goldberg","year":"2002","unstructured":"D.E. Goldberg, The Design of Innovation\u2014Lessons from and for Competent Genetic Algorithms (Kluwer, Norwell, MA, 2002)"},{"key":"9096_CR16","doi-asserted-by":"crossref","unstructured":"D.E. Goldberg, K. Deb, A comparative analysis of selection schemes used in genetic algorithms. In: Foundations of Genetic Algorithms (Morgan Kaufmann, 1991), pp. 69\u201393","DOI":"10.1016\/B978-0-08-050684-5.50008-2"},{"issue":"3","key":"9096_CR17","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1162\/evco.1999.7.3.231","volume":"7","author":"G. Harik","year":"1999","unstructured":"G. Harik, E. Cant\u00fa-Paz, D. Goldberg, B. Miller, The Gambler\u2019s ruin problem, genetic algorithms, and the sizing of populations. Evol. Comput. 7(3), 231\u2013253 (1999)","journal-title":"Evol. Comput."},{"key":"9096_CR18","doi-asserted-by":"crossref","unstructured":"I. Hidalgo, F. Fern\u00e1ndez, Balancing the computation effort in genetic algorithms. In The 2005 IEEE Congress on Evolutionary Computation, vol. 2 (IEEE Press, 2005), pp. 1645\u20131652. doi: 10.1109\/CEC.2005.1554886","DOI":"10.1109\/CEC.2005.1554886"},{"key":"9096_CR19","unstructured":"M. Jelasity, M. van Steen, Large-scale Newscast Computing on the Internet. Tech. Rep. IR-503 (Vrije Universiteit Amsterdam, Department of Computer Science, Amsterdam, The Netherlands). http:\/\/www.cs.vu.nl\/pub\/papers\/globe\/IR-503.02.pdf"},{"issue":"3","key":"9096_CR20","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1145\/1082469.1082470","volume":"23","author":"M. Jelasity","year":"2005","unstructured":"M. Jelasity, A. Montresor, O. Babaoglu, Gossip-based aggregation in large dynamic networks. ACM Trans. Comput. Syst. 23(3), 219\u2013252 (2005)","journal-title":"ACM Trans. Comput. Syst."},{"key":"9096_CR21","doi-asserted-by":"crossref","unstructured":"J.L.J. Laredo, P.A. Castillo, B. Paechter, A.M. Mora, E. Alfaro-Cid, A. Esparcia-Alc\u00e1zar, J.J. Merelo, Empirical validation of a gossiping communication mechanism for parallel EAs. In EvoWorkshops, Lecture Notes in Computer Science, vol. 4448 (Springer, 2007), pp. 129\u2013136","DOI":"10.1007\/978-3-540-71805-5_14"},{"key":"9096_CR22","doi-asserted-by":"crossref","unstructured":"J.L.J. Laredo, P.A. Castillo, A.M. Mora, J.J. Merelo, Exploring population structures for locally concurrent and massively parallel evolutionary algorithms. In IEEE Congress on Evolutionary Computation (CEC2008), WCCI2008 Proceedings (IEEE Press, Hong Kong, 2008a), pp. 2610\u20132617","DOI":"10.1109\/CEC.2008.4631148"},{"key":"9096_CR23","doi-asserted-by":"crossref","unstructured":"J.L.J. Laredo, P.A. Castillo, A.M. Mora, J.J. Merelo, C. Fernandes, Resilience to churn of a peer-to-peer evolutionary algorithm. Int. J. High Perform. Syst. Archit. 1(4), 260\u2013268 (2008b). http:\/\/www.dx.doi.org\/10.1504\/IJHPSA.2008.024210","DOI":"10.1504\/IJHPSA.2008.024210"},{"key":"9096_CR24","doi-asserted-by":"crossref","unstructured":"J.L.J. Laredo, A.E. Eiben, M. van Steen, J.J. Merelo, On the run-time dynamics of a peer-to-peer evolutionary algorithm. In Proceedings of the 10th international conference on Parallel Problem Solving from Nature (Springer, Berlin, Heidelberg, 2008c), pp. 236\u2013245. http:\/\/www.dx.doi.org\/10.1007\/978-3-540-87700-4_24","DOI":"10.1007\/978-3-540-87700-4_24"},{"issue":"12","key":"9096_CR25","first-page":"1145","volume":"12","author":"J.L.J. Laredo","year":"2008","unstructured":"J.L.J. Laredo, P.A. Castillo, A.M. Mora, J.J. Merelo, Evolvable agents, a fine grained approach for distributed evolutionary computing: walking towards the peer-to-peer computing frontiers. Soft Comput. Fusion Found. Methodol. Appl. 12(12), 1145\u20131156 (2008d)","journal-title":"Soft Comput. Fusion Found. Methodol. Appl."},{"key":"9096_CR26","doi-asserted-by":"crossref","unstructured":"J.L.J. Laredo, C. Fernandes, A. Mora, P.A. Castillo, P. Garcia-Sanchez, J.J. Merelo, Studying the Cache Size in a Gossip-based Evolutionary Algorithm. In 3rd International Symposium on Intelligent Distributed Computing (Springer, Berlin\/Heidelberg, 2009), pp. 131\u2013140","DOI":"10.1007\/978-3-642-03214-1_13"},{"issue":"2","key":"9096_CR27","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1016\/j.eswa.2005.11.034","volume":"32","author":"W.P. Lee","year":"2007","unstructured":"W.P. Lee, Parallelizing evolutionary computation: a mobile agent-based approach. Expert Syst. Appl. 32(2), 318\u2013328 (2007)","journal-title":"Expert Syst. Appl."},{"key":"9096_CR28","doi-asserted-by":"crossref","unstructured":"F.G. Lobo, C.F. Lima, Adaptive population sizing schemes in genetic algorithms. In Parameter Setting in Evolutionary Algorithms, Studies in Computational Intelligence (Springer, Berlin\/Heidelberg, 2007), pp. 185\u2013204","DOI":"10.1007\/978-3-540-69432-8_9"},{"key":"9096_CR29","doi-asserted-by":"crossref","unstructured":"J.J. Merelo, P.A. Castillo, J.L.J. Laredo, A.M. Mora, A. Prieto, Asynchronous distributed genetic algorithms with Javascript and JSON. In IEEE Congress on Evolutionary Computation (CEC2008), WCCI2008 Proceedings (IEEE Press, Hong Kong, 2008), pp. 1372\u20131379","DOI":"10.1109\/CEC.2008.4630973"},{"key":"9096_CR30","doi-asserted-by":"crossref","unstructured":"N. Nedjah, L. de Macedo Mourelle, E. Alba (eds.), Parallel Evolutionary Computations, Studies in Computational Intelligence, vol. 22. (Springer, 2006)","DOI":"10.1007\/3-540-32839-4"},{"key":"9096_CR31","doi-asserted-by":"crossref","unstructured":"M. Preuss, C. Lasarczyk, On the importance of information speed in structured populations. In PPSN, vol. 3242 (Springer, 2004), pp. 91\u2013100","DOI":"10.1007\/978-3-540-30217-9_10"},{"key":"9096_CR32","unstructured":"K. Sastry, Evaluation-relaxation Schemes for Genetic and Evolutionary Algorithms. Tech. Rep. 2002004 (University of Illinois at Urbana-Champaign, Urbana, IL, 2001)"},{"key":"9096_CR33","doi-asserted-by":"crossref","unstructured":"R. Steinmetz, K. Wehrle, What is this peer-to-peer about? In Peer-to-Peer Systems and Applications, Lecture Notes in Computer Science, vol. 3485, ed. by R. Steinmetz, K. Wehrle (Springer, 2005), pp 9\u201316","DOI":"10.1007\/11530657_2"},{"issue":"4","key":"9096_CR34","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1162\/evco.1999.7.4.331","volume":"7","author":"D. Thierens","year":"2005","unstructured":"D. Thierens, Scalability problems of simple genetic algorithms. Evol. Comput. 7(4), 331\u2013352 (2005)","journal-title":"Evol. Comput."},{"key":"9096_CR35","volume-title":"Spatially Structured Evolutionary Algorithms: Artificial Evolution in Space and Time (Natural Computing Series)","author":"M. Tomassini","year":"2005","unstructured":"M. Tomassini, Spatially Structured Evolutionary Algorithms: Artificial Evolution in Space and Time (Natural Computing Series) (Springer New York, Inc., Secaucus, NJ, 2005)"},{"key":"9096_CR36","doi-asserted-by":"crossref","unstructured":"S. Voulgaris, M. Jelasity, M. van Steen, A Robust and Scalable Peer-to-Peer Gossiping Protocol, Lecture Notes in Computer Science (LNCS), vol. 2872 (Springer, Berlin\/Heidelberg, 2004), pp. 47\u201358. doi: 10.1007\/b104265","DOI":"10.1007\/b104265"},{"key":"9096_CR37","doi-asserted-by":"crossref","unstructured":"D. Watts, S. Strogatz, Collective dynamics of \u201csmall-world\u201d networks. Nature 393, 440\u2013442 (1998). http:\/\/www.dx.doi.org\/10.1038\/30918","DOI":"10.1038\/30918"},{"key":"9096_CR38","doi-asserted-by":"crossref","unstructured":"J. Whitacre, R. Sarker, Q. Pham, The self-organization of interaction networks for nature-inspired optimization. IEEE Trans. Evol. Comput. 12(2), 220\u2013230 (2008). doi: 10.1109\/TEVC.2007.900327","DOI":"10.1109\/TEVC.2007.900327"},{"key":"9096_CR39","doi-asserted-by":"crossref","unstructured":"W.R.M.U.K. Wickramasinghe, M. van Steen, A.E. Eiben, Peer-to-peer evolutionary algorithms with adaptive autonomous selection. In GECCO \u201907 (ACM Press, New York, NY, 2007), pp. 1460\u20131467, http:\/\/www.doi.acm.org\/10.1145\/1276958.1277225","DOI":"10.1145\/1276958.1277225"}],"container-title":["Genetic Programming and Evolvable Machines"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10710-009-9096-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10710-009-9096-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10710-009-9096-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,13]],"date-time":"2025-02-13T11:37:38Z","timestamp":1739446658000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10710-009-9096-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,11,25]]},"references-count":39,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,6]]}},"alternative-id":["9096"],"URL":"https:\/\/doi.org\/10.1007\/s10710-009-9096-z","relation":{},"ISSN":["1389-2576","1573-7632"],"issn-type":[{"type":"print","value":"1389-2576"},{"type":"electronic","value":"1573-7632"}],"subject":[],"published":{"date-parts":[[2009,11,25]]}}}