{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T19:03:09Z","timestamp":1761418989260,"version":"3.41.0"},"reference-count":51,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2016,4,1]],"date-time":"2016-04-01T00:00:00Z","timestamp":1459468800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"European Social Fund and the Free State of Saxony within the Young Researcher Group \u201cSchwarm-inspirierte Verfahren zur Optimierung, Selbstorganisation und Ressourceneffizienz.\u201d"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Evol. Computat."],"published-print":{"date-parts":[[2016,4]]},"DOI":"10.1109\/tevc.2015.2451701","type":"journal-article","created":{"date-parts":[[2015,7,7]],"date-time":"2015-07-07T21:38:02Z","timestamp":1436305082000},"page":"245-262","source":"Crossref","is-referenced-by-count":9,"title":["Simple Probabilistic Population-Based Optimization"],"prefix":"10.1109","volume":"20","author":[{"given":"Ying-Chi","family":"Lin","sequence":"first","affiliation":[]},{"given":"Martin","family":"Claub","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Middendorf","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"crossref","DOI":"10.1002\/9780470496916","author":"talbi","year":"2009","journal-title":"Metaheuristics From Design to Implementation"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-739X(00)00043-1"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2004.03.008"},{"key":"ref32","article-title":"A new ACO approach for solving dynamic problems","author":"sammoud","year":"2009","journal-title":"Proc Int Conf Artif Evol"},{"key":"ref31","article-title":"A similarity based P-ACO version for solving dynamic problems","author":"sammoud","year":"2008","journal-title":"Proc Int Conf Metaheuristics Nat Inspired Comput (META)"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/2001858.2001866"},{"key":"ref37","first-page":"33","article-title":"ACO algorithms for the quadratic assignment problem","author":"st\u00fctzle","year":"1999","journal-title":"New Ideas in Optimization"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1111\/itor.12001"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.06.046"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.5539\/mas.v5n5p150"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44320-0_20"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2012.6252885"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/2001576.2001682"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/MCDM.2007.369110"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-76931-6_21"},{"article-title":"Ant algorithms in stochastic and multi-criteria environments","year":"2004","author":"guntsch","key":"ref20"},{"journal-title":"Stochastic Local Search Foundations & Applications","year":"2004","author":"hoos","key":"ref22"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-1665-5_19"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/SIS.2013.6615181"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/AMS.2008.37"},{"article-title":"Jumping frogs optimization: A new swarm method for discrete optimization","year":"2008","author":"mart\u00ednez-garc\u00eda","key":"ref26"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2012.6256606"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2014.6900640"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/MCI.2014.2326101"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16696-9_46"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/4235.585892"},{"key":"ref40","first-page":"291","article-title":"Protein folding in the HP-model solved with a hybrid population based ACO algorithm","volume":"35","author":"thalheim","year":"2008","journal-title":"IAENG Int J Comput Sci"},{"article-title":"The ant system: An autocatalytic optimizing process","year":"1991","author":"dorigo","key":"ref12"},{"key":"ref13","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1290.001.0001","author":"dorigo","year":"2004","journal-title":"Ant Colony Optimization"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-92695-5_9"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-1665-5_2"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.enconman.2012.07.029"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46004-7_8"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45724-0_10"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36970-8_33"},{"key":"ref4","first-page":"4391","article-title":"A new simplified swarm optimization (SSO) using exchange local search scheme","volume":"8","author":"bae","year":"2012","journal-title":"Int J Innov Comput Inf Control"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/E-SCIENCE.2006.261199"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2013.02.041"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2007.01.029"},{"key":"ref8","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4614-6940-7","author":"burke","year":"2014","journal-title":"Search Methodologies—Introductory Tutorials in Optimisation and Decision Support Methodology"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2008.4631010"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-13356-0_16"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s11047-009-9137-9"},{"key":"ref46","first-page":"226","article-title":"Disassembly sequencing problems with stochastic processing time using simplified swarm optimization","volume":"3","author":"yeh","year":"2012","journal-title":"International Journal for Innovation and Technology Management"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCA.2011.2157135"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-13356-0_34"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2014.03.011"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2008.12.024"},{"key":"ref41","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1145\/2739480.2754733","article-title":"Visual analysis and comparison of search landscapes of TSP, QAP, and SMTTP","author":"volke","year":"2015","journal-title":"Proc Genet Evol Comput Conf (GECCO)"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2012.02.009"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2011.10.027"}],"container-title":["IEEE Transactions on Evolutionary Computation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4235\/7442915\/7145357.pdf?arnumber=7145357","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,29]],"date-time":"2025-05-29T02:28:35Z","timestamp":1748485715000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7145357\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,4]]},"references-count":51,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tevc.2015.2451701","relation":{},"ISSN":["1089-778X","1089-778X","1941-0026"],"issn-type":[{"type":"print","value":"1089-778X"},{"type":"print","value":"1089-778X"},{"type":"electronic","value":"1941-0026"}],"subject":[],"published":{"date-parts":[[2016,4]]}}}