{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T23:59:17Z","timestamp":1773705557671,"version":"3.50.1"},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T00:00:00Z","timestamp":1664582400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"AFarCloud European Project","award":["783221 (Call: H2020-ECSEL-2017-2)"],"award-info":[{"award-number":["783221 (Call: H2020-ECSEL-2017-2)"]}]},{"DOI":"10.13039\/100003077","name":"DPAC","doi-asserted-by":"publisher","award":["20150022"],"award-info":[{"award-number":["20150022"]}],"id":[{"id":"10.13039\/100003077","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100003077","name":"FIESTA\u2014Federated Choreography of an Integrated Embedded Systems Software Architecture, funded by the Swedish Knowledge Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100003077","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Cybern."],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1109\/tcyb.2021.3070913","type":"journal-article","created":{"date-parts":[[2021,5,13]],"date-time":"2021-05-13T19:39:19Z","timestamp":1620934759000},"page":"10627-10638","source":"Crossref","is-referenced-by-count":32,"title":["GMP: A Genetic Mission Planner for Heterogeneous Multirobot System Applications"],"prefix":"10.1109","volume":"52","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9051-929X","authenticated-orcid":false,"given":"Branko","family":"Miloradovic","sequence":"first","affiliation":[{"name":"Division of Intelligent Future Technologies, Mälardalen University, Västerås, Sweden"}]},{"given":"Baran","family":"Curuklu","sequence":"additional","affiliation":[{"name":"Division of Intelligent Future Technologies, Mälardalen University, Västerås, Sweden"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5832-5452","authenticated-orcid":false,"given":"Mikael","family":"Ekstrom","sequence":"additional","affiliation":[{"name":"Division of Intelligent Future Technologies, Mälardalen University, Västerås, Sweden"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1364-8127","authenticated-orcid":false,"given":"Alessandro Vittorio","family":"Papadopoulos","sequence":"additional","affiliation":[{"name":"Division of Intelligent Future Technologies, Mälardalen University, Västerås, Sweden"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/rob.21819"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/CCDC.2015.7161668"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2018.2794578"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v22i1.13515"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-016-2376-7"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2020.3024223"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2018.2883764"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2014.2371918"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(97)00358-5"},{"issue":"1","key":"ref11","first-page":"167","article-title":"A two-commodity network flow approach to the traveling salesman problem","volume":"41","author":"Finke","year":"1984","journal-title":"Congressus Numerantium"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.5220\/0007309002370244"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2.4.393"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2004.10.004"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.15807\/jorsj.34.152"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2007.11.008"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s13676-012-0010-0"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2017.2706720"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2016.2531648"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/JAS.2017.7510415"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2020.2972389"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-37584-3_6"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2011.2160400"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2015.2418052"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/JAS.2019.1911405"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2019.2910274"},{"issue":"1","key":"ref27","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1023\/A:1008779125567","article-title":"A branch & cut algorithm for the asymmetric traveling salesman problem with precedence constraints","volume":"17","author":"Ascheuer","year":"2000","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"ref28","first-page":"149","article-title":"A time-dependent atsp with time window and precedence constraints in air travel","volume":"9","author":"Saradatta","year":"2017","journal-title":"J. Telecommun. Elect. Comput. Eng."},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.procir.2016.02.136"},{"key":"ref30","article-title":"Mission planning for unmanned aerial vehicles","author":"F\u00fcgenschuh","year":"2019"},{"key":"ref31","article-title":"Solving real-world vehicle routing problems using MILP and pgreedy heuristics","author":"Yuan","year":"2007"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2014.6942590"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1177\/0278364904045564"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1177\/0278364913496484"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2016.10.008"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-33792-6_32"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2004.03.007"},{"key":"ref38","volume-title":"The Traveling Salesman Problem and Its Variations","volume":"12","author":"Gutin","year":"2006"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/IEEECONF38699.2020.9389393"},{"key":"ref40","first-page":"65","article-title":"Branch-and-cut algorithms for combinatorial optimization problems","volume-title":"Handbook of Applied Optimization","volume":"1","author":"Mitchell","year":"2002"},{"key":"ref41","article-title":"Branch and bound algorithms-principles and examples","author":"Clausen","year":"1999"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(02)00051-5"},{"key":"ref43","first-page":"7","article-title":"Genetic algorithm applications on job shop scheduling problem: A review","volume-title":"Proc. Int. Conf. Soft Comput. Techn. Implement.","author":"Nisha"},{"key":"ref44","first-page":"320","article-title":"Genetic planning using variable length chromosomes","volume-title":"Proc. Int. Conf. Autom. Plan. Schedul.","author":"Brie"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13520-0_23"}],"container-title":["IEEE Transactions on Cybernetics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6221036\/9895112\/09430776.pdf?arnumber=9430776","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,9]],"date-time":"2024-01-09T23:30:08Z","timestamp":1704843008000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9430776\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10]]},"references-count":45,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tcyb.2021.3070913","relation":{},"ISSN":["2168-2267","2168-2275"],"issn-type":[{"value":"2168-2267","type":"print"},{"value":"2168-2275","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,10]]}}}