{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T01:54:12Z","timestamp":1780451652154,"version":"3.54.1"},"reference-count":39,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T00:00:00Z","timestamp":1746057600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T00:00:00Z","timestamp":1746057600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T00:00:00Z","timestamp":1746057600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Serv. Comput."],"published-print":{"date-parts":[[2025,5]]},"DOI":"10.1109\/tsc.2025.3556641","type":"journal-article","created":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T20:58:37Z","timestamp":1743541117000},"page":"1185-1198","source":"Crossref","is-referenced-by-count":4,"title":["A Developer-Focused Genetic Algorithm for IoT Application Placement in the Computing Continuum"],"prefix":"10.1109","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2280-2878","authenticated-orcid":false,"given":"Juan Luis","family":"Herrera","sequence":"first","affiliation":[{"name":"Department of Computer Science Engineering, University of Bologna, Bologna, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8071-9845","authenticated-orcid":false,"given":"Alejandro","family":"Moya","sequence":"additional","affiliation":[{"name":"LoUISE Research Group, University of Castilla-La Mancha, Albacete, Spain"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1007-2134","authenticated-orcid":false,"given":"Javier","family":"Berrocal","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Communications Engineering, University of Extremadura, Badajoz, Spain"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4961-4030","authenticated-orcid":false,"given":"Juan Manuel","family":"Murillo","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Communications Engineering, University of Extremadura, Badajoz, Spain"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9496-6890","authenticated-orcid":false,"given":"Elena","family":"Navarro","sequence":"additional","affiliation":[{"name":"LoUISE Research Group, University of Castilla-La Mancha, Albacete, Spain"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","article-title":"Global IoT market to grow to 24.1 billion devices in 2030, generating $1.5 trillion annual revenue","author":"Insights","year":"2020"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.pmcj.2018.12.007"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2020.05.016"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2884906"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2665971"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.14569\/IJACSA.2016.071133"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2017.04.036"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/CIT\/IUCC\/DASC\/PICOM.2015.51"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1002\/spe.2766"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISVLSI.2017.60"},{"key":"ref11","article-title":"Microservices in practice - key architectural concepts of an MSA","author":"Indrasiri","year":"2019"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2022.3165646"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2004.09.012"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2019.2928698"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2018.2855746"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2018.03.004"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2019.2906793"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3297280.3297477"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2015.2501300"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2022.3174112"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2015.2481421"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022602019183"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/4235.797969"},{"key":"ref24","article-title":"Some experiments in machine learning using vector evaluated genetic algorithms","author":"Schaffer","year":"1984"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICEC.1995.489161"},{"key":"ref26","first-page":"82","article-title":"A niched Pareto genetic algorithm for multiobjective optimization","volume-title":"Proc. 1st IEEE Conf. Evolutionary Comput.","volume":"1","author":"Horn","year":"1994"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1162\/evco.1994.2.3.221"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/4235.996017"},{"issue":"4","key":"ref29","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1109\/TEVC.2013.2281535","article-title":"An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, Part I: Solving problems with box constraints","volume":"18","author":"Deb","year":"2014","journal-title":"IEEE Trans. Evol. Comput."},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45356-3_82"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.advengsoft.2009.01.001"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44874-8_2"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2022.108441"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2014.12.041"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/bf01386390"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.5486\/PMD.1959.6.3-4.12"},{"issue":"1","key":"ref37","first-page":"2171","article-title":"DEAP: Evolutionary algorithms made easy","volume":"13","author":"Fortin","year":"2012","journal-title":"J. Mach. Learn. Res."},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.23919\/INM.2017.7987464"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-33702-5_22"}],"container-title":["IEEE Transactions on Services Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/4629386\/11031152\/10946221.pdf?arnumber=10946221","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T17:43:24Z","timestamp":1749750204000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10946221\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5]]},"references-count":39,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tsc.2025.3556641","relation":{},"ISSN":["1939-1374","2372-0204"],"issn-type":[{"value":"1939-1374","type":"electronic"},{"value":"2372-0204","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,5]]}}}