{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,21]],"date-time":"2026-09-21T16:04:39Z","timestamp":1790006679198,"version":"4.0.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2018,7,5]],"date-time":"2018-07-05T00:00:00Z","timestamp":1530748800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003443","name":"Ministry of Education and Science of the Russian Federation","doi-asserted-by":"publisher","award":["\u201cMikhail Lomonosov II\u201d-Program"],"award-info":[{"award-number":["\u201cMikhail Lomonosov II\u201d-Program"]}],"id":[{"id":"10.13039\/501100003443","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001655","name":"Deutscher Akademischer Austauschdienst","doi-asserted-by":"publisher","award":["\u201cMikhail Lomonosov II\u201d-Program"],"award-info":[{"award-number":["\u201cMikhail Lomonosov II\u201d-Program"]}],"id":[{"id":"10.13039\/501100001655","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002347","name":"Bundesministerium f\u00fcr Bildung und Forschung","doi-asserted-by":"publisher","award":["HPC2SE project"],"award-info":[{"award-number":["HPC2SE project"]}],"id":[{"id":"10.13039\/501100002347","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s11227-018-2472-9","type":"journal-article","created":{"date-parts":[[2018,7,5]],"date-time":"2018-07-05T02:46:19Z","timestamp":1530758779000},"page":"7921-7933","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Comparing GPU-parallelized metaheuristics to branch-and-bound for batch plants optimization"],"prefix":"10.1007","volume":"75","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9315-6167","authenticated-orcid":false,"given":"Andrey","family":"Borisenko","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sergei","family":"Gorlatch","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,7,5]]},"reference":[{"key":"2472_CR1","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-1-4614-6940-7_10","volume-title":"Search Methodologies","author":"Emile Aarts","year":"2013","unstructured":"Aarts E, Korst J, Michiels W (2014) Simulated annealing. In: Search methodologies. Springer, pp. 265\u2013285.\nhttps:\/\/doi.org\/10.1007\/978-1-4614-6940-7_10"},{"key":"2472_CR2","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00483-4","volume-title":"Tuning Metaheuristics","author":"Mauro Birattari","year":"2009","unstructured":"Birattari M (2009) Tuning metaheuristics: a machine learning perspective. Springer, Berlin. \nhttps:\/\/doi.org\/10.1007\/978-3-642-00483-4"},{"key":"2472_CR3","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/978-3-319-62932-2_39","volume-title":"Lecture Notes in Computer Science","author":"Andrey Borisenko","year":"2017","unstructured":"Borisenko A, Gorlatch S (2017) Parallelizing metaheuristics for optimal design of multiproduct batch plants on GPU. In: Parallel Computing Technologies, Lecture Notes in Computer Science, vol 10421, pp 405\u2013417. \nhttps:\/\/doi.org\/10.1007\/978-3-319-62932-2_39"},{"issue":"2","key":"2472_CR4","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1007\/s11227-016-1784-x","volume":"73","author":"A Borisenko","year":"2017","unstructured":"Borisenko A, Haidl M, Gorlatch S (2017) A GPU parallelization of branch-and-bound for multiproduct batch plants optimization. J Supercomput 73(2):639\u2013651. \nhttps:\/\/doi.org\/10.1007\/s11227-016-1784-x","journal-title":"J Supercomput"},{"key":"2472_CR5","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/978-3-642-23178-0_36","volume-title":"Lecture Notes in Computer Science","author":"Andrey Borisenko","year":"2011","unstructured":"Borisenko A, Kegel P, Gorlatch S (2011) Optimal design of multi-product batch plants using a parallel branch-and-bound method. In: Parallel Computing Technologies, Lecture Notes in Computer Science, vol 6873. Springer, pp 417\u2013430. \nhttps:\/\/doi.org\/10.1007\/978-3-642-23178-0_36"},{"key":"2472_CR6","doi-asserted-by":"publisher","unstructured":"Dawson L, Stewart I (2013) Improving ant colony optimization performance on the GPU using CUDA. In: 2013 IEEE Congress on Evolutionary Computation. IEEE, pp 1901\u20131908. \nhttps:\/\/doi.org\/10.1109\/cec.2013.6557791","DOI":"10.1109\/cec.2013.6557791"},{"issue":"1","key":"2472_CR7","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.jpdc.2012.01.003","volume":"73","author":"A Del\u00e9vacq","year":"2013","unstructured":"Del\u00e9vacq A, Delisle P, Gravel M, Krajecki M (2013) Parallel ant colony optimization on graphics processing units. J Parallel Distrib Comput 73(1):52\u201361. \nhttps:\/\/doi.org\/10.1016\/j.jpdc.2012.01.003","journal-title":"J Parallel Distrib Comput"},{"issue":"2\u20133","key":"2472_CR8","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/j.tcs.2005.05.020","volume":"344","author":"M Dorigo","year":"2005","unstructured":"Dorigo M, Blum C (2005) Ant colony optimization theory: a survey. Theor Comput Sci 344(2\u20133):243\u2013278. \nhttps:\/\/doi.org\/10.1016\/j.tcs.2005.05.020","journal-title":"Theor Comput Sci"},{"key":"2472_CR9","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/978-1-4419-1665-5_8","volume-title":"Handbook of Metaheuristics","author":"Marco Dorigo","year":"2010","unstructured":"Dorigo M, St\u00fctzle T (2010) Ant colony optimization: overview and recent advances. In: Handbook of Metaheuristics. Springer, pp 227\u2013263. \nhttps:\/\/doi.org\/10.1007\/978-1-4419-1665-5_8"},{"key":"2472_CR10","doi-asserted-by":"publisher","unstructured":"Gonzalez-Pardo A, Camacho D (2013) A new CSP graph-based representation for ant colony optimization. In: 2013 IEEE Congress on Evolutionary Computation. Institute of Electrical and Electronics Engineers (IEEE), pp 689\u2013696. \nhttps:\/\/doi.org\/10.1109\/cec.2013.6557635","DOI":"10.1109\/cec.2013.6557635"},{"key":"2472_CR11","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1016\/j.trc.2015.02.013","volume":"55","author":"NA Kallioras","year":"2015","unstructured":"Kallioras NA, Kepaptsoglou K, Lagaros DN (2015) Transit stop inspection and maintenance scheduling: a GPU accelerated metaheuristics approach. Transp Res Part C Emerg Technol 55:246\u2013260. \nhttps:\/\/doi.org\/10.1016\/j.trc.2015.02.013","journal-title":"Transp Res Part C Emerg Technol"},{"key":"2472_CR12","doi-asserted-by":"publisher","unstructured":"Khan S, Bilal M, Sharif M, Sajid M, Baig R (2009) Solution of \n$$n$$\n\n\n\nn\n\n\n\n-queen problem using ACO. In: 2009 IEEE 13th International Multitopic Conference. Institute of Electrical and Electronics Engineers (IEEE), pp 1\u20135. \nhttps:\/\/doi.org\/10.1109\/inmic.2009.5383157","DOI":"10.1109\/inmic.2009.5383157"},{"issue":"4598","key":"2472_CR13","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gelatt CD, Vecchi MP et al (1983) Optimization by simulated annealing. Science 220(4598):671\u2013680. \nhttps:\/\/doi.org\/10.1126\/science.220.4598.671","journal-title":"Science"},{"key":"2472_CR14","unstructured":"NVIDIA Corporation: CUDA C programming guide 9.1 (2016). \nhttp:\/\/docs.nvidia.com\/cuda\/pdf\/CUDA_C_Programming_Guide.pdf"},{"key":"2472_CR15","volume-title":"Handbook of constraint programming","author":"Rossi F","year":"2006","unstructured":"F Rossi, Van Beek P, T Walsh (2006) Handbook of constraint programming. Elsevier, New York"},{"key":"2472_CR16","doi-asserted-by":"publisher","DOI":"10.1002\/9781118557563","volume-title":"Ant Colony Optimization and Constraint Programming","year":"2013","unstructured":"Solnon C (2010) Ant colony optimization and constraint programming. Wiley, Hoboken. \nhttps:\/\/doi.org\/10.1002\/9781118557563"},{"key":"2472_CR17","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-642-21434-9_8","volume-title":"Autonomous Search","author":"Thomas St\u00fctzle","year":"2011","unstructured":"St\u00fctzle T, L\u00f3pez-Ib\u00e1nez M, Pellegrini P, Maur M, de\u00a0Oca MM, Birattari M, Dorigo M (2011) Parameter adaptation in ant colony optimization. In: Autonomous search. Springer, Berlin, pp 191\u2013215. \nhttps:\/\/doi.org\/10.1007\/978-3-642-21434-9_8"},{"key":"2472_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-06508-3","volume-title":"Applications of Metaheuristics in Process Engineering","year":"2014","unstructured":"Valadi J, Siarry P (2014) Applications of metaheuristics in process engineering. Springer, Berlin. \nhttps:\/\/doi.org\/10.1007\/978-3-319-06508-3"},{"key":"2472_CR19","doi-asserted-by":"publisher","unstructured":"Wei KC, Wu CC, Yu HL (2015) Mapping the simulated annealing algorithm onto CUDA GPUs. In: 2015 10th International Conference on Intelligent Systems and Knowledge Engineering (ISKE), pp 1\u20138. \nhttps:\/\/doi.org\/10.1109\/iske.2015.97","DOI":"10.1109\/iske.2015.97"},{"key":"2472_CR20","volume-title":"Nature-inspired metaheuristic algorithms","author":"XS Yang","year":"2010","unstructured":"Yang XS (2010) Nature-inspired metaheuristic algorithms. Luniver Press, Beckington"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-018-2472-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-018-2472-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-018-2472-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,20]],"date-time":"2019-11-20T04:17:37Z","timestamp":1574223457000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-018-2472-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,5]]},"references-count":20,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["2472"],"URL":"https:\/\/doi.org\/10.1007\/s11227-018-2472-9","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,7,5]]},"assertion":[{"value":"5 July 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}