{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:34:01Z","timestamp":1743053641496,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319134635"},{"type":"electronic","value":"9783319134642"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-13464-2_9","type":"book-chapter","created":{"date-parts":[[2014,12,1]],"date-time":"2014-12-01T20:09:58Z","timestamp":1417464598000},"page":"113-127","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Parallel Genetic Algorithm Framework for Cloud Computing Applications"],"prefix":"10.1007","author":[{"given":"Elena","family":"Apostol","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Iulia","family":"B\u0103lu\u0163\u0103","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexandru","family":"Gorgoi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Valentin","family":"Cristea","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,11,26]]},"reference":[{"issue":"11","key":"9_CR1","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"J Beasley","year":"1990","unstructured":"Beasley, J.: Or-library: distributing test problems by electronic mail. J. Oper. Res. Soc. 41(11), 1069\u20131072 (1990)","journal-title":"J. Oper. Res. Soc."},{"doi-asserted-by":"crossref","unstructured":"Jin, R.B.C., Vecchiola, C.: Mrpga: an extension of mapreduce for parallelizing genetic algorithms. In: eScience, pp. 214\u2013221, December 2008","key":"9_CR2","DOI":"10.1109\/eScience.2008.78"},{"issue":"2","key":"9_CR3","first-page":"141","volume":"10","author":"E Cantu-Paz","year":"1998","unstructured":"Cantu-Paz, E.: A survey of parallel genetic algorithms. Calculateurs Paralleles, Reseaux et Syst. Repartis 10(2), 141\u2013171 (1998)","journal-title":"Calculateurs Paralleles, Reseaux et Syst. Repartis"},{"doi-asserted-by":"crossref","unstructured":"Huang, J.L.D.: Scaling populations of a genetic algorithm for job shop scheduling problems using mapreduce. In: Cloud Computing Technology and Science (2010)","key":"9_CR4","DOI":"10.1109\/CloudCom.2010.18"},{"unstructured":"Grid5000 home page (2014). Grid5000.Fr","key":"9_CR5"},{"key":"9_CR6","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-642-10675-0_2","volume-title":"Parallel and Distributed Computational Intelligence","author":"X Llor\u00e0","year":"2010","unstructured":"Llor\u00e0, X., Verma, A., Campbell, R.H., Goldberg, D.E.: When huge is routine: scaling genetic algorithms and estimation of distribution algorithms via data-intensive computing. In: de Vega, F.F., Cant\u00fa-Paz, E. (eds.) Parallel and Distributed Computational Intelligence. SCI, vol. 269, pp. 11\u201341. Springer, Heidelberg (2010)"},{"unstructured":"Open nebula home page (2014). OpenNebula.Org","key":"9_CR7"},{"unstructured":"The traveling salesman problem official site (2014). TSP.Gatech.Edu","key":"9_CR8"},{"unstructured":"Verma, A.: Scaling simple, compact and extended compact genetic algorithms using mapreduce. Master\u2019s thesis, University of Illinois at Urbana-Champaign, August 2010","key":"9_CR9"},{"issue":"1","key":"9_CR10","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/j.tcs.2008.05.011","volume":"403","author":"C Witt","year":"2008","unstructured":"Witt, C.: Population size versus runtime of a simple evolutionary algorithm. Theoret. Comput. Sci. 403(1), 104\u2013120 (2008)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Adaptive Resource Management and Scheduling for Cloud Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-13464-2_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T01:03:23Z","timestamp":1676423003000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-13464-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319134635","9783319134642"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-13464-2_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"26 November 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}