{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T03:13:19Z","timestamp":1785553999498,"version":"3.56.0"},"reference-count":34,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1016\/j.cor.2022.105826","type":"journal-article","created":{"date-parts":[[2022,4,12]],"date-time":"2022-04-12T21:08:24Z","timestamp":1649797704000},"page":"105826","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":31,"special_numbering":"C","title":["Adaptive simulated annealing with greedy search for the circle bin packing problem"],"prefix":"10.1016","volume":"144","author":[{"given":"Yong","family":"Yuan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0003-0373-3691","authenticated-orcid":false,"given":"Kevin","family":"Tole","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fei","family":"Ni","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0001-7627-4604","authenticated-orcid":false,"given":"Kun","family":"He","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhengda","family":"Xiong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jinfa","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"5","key":"10.1016\/j.cor.2022.105826_b1","doi-asserted-by":"crossref","first-page":"1513","DOI":"10.1016\/j.cor.2008.02.003","article-title":"A beam search algorithm for the circular packing problem","volume":"36","author":"Akeb","year":"2009","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2022.105826_b2","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1016\/j.cie.2011.02.009","article-title":"An augmented beam search-based algorithm for the circular open dimension problem","volume":"61","author":"Akeb","year":"2011","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.cor.2022.105826_b3","doi-asserted-by":"crossref","DOI":"10.1016\/j.ejor.2020.02.048","article-title":"Packing rectangles into a fixed size circular container: Constructive and metaheuristic search approaches","volume":"285","author":"Bouzid","year":"2020","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2022.105826_b4","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/j.cosrev.2016.12.001","article-title":"Approximation and online algorithms for multidimensional bin packing: A survey","volume":"24","author":"Christensen","year":"2017","journal-title":"Comp. Sci. Rev."},{"issue":"1","key":"10.1016\/j.cor.2022.105826_b5","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1137\/0603007","article-title":"On packing two-dimensional bins","volume":"3","author":"Chung","year":"1982","journal-title":"SIAM J. Algebr. Discrete Methods"},{"key":"10.1016\/j.cor.2022.105826_b6","series-title":"Circle packing for origami design is hard","author":"Demaine","year":"2010"},{"key":"10.1016\/j.cor.2022.105826_b7","series-title":"Packomania website 2018","author":"Eckardi","year":"2018"},{"issue":"3","key":"10.1016\/j.cor.2022.105826_b8","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1287\/ijoc.15.3.267.16080","article-title":"Guided local search for the three-dimensional bin-packing problem","volume":"15","author":"Faroe","year":"2003","journal-title":"Inf. J. Comput."},{"issue":"2","key":"10.1016\/j.cor.2022.105826_b9","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1016\/j.ejor.2012.10.022","article-title":"Iterated tabu search for the circular open dimension problem","volume":"225","author":"Fu","year":"2013","journal-title":"European J. Oper. Res."},{"issue":"4","key":"10.1016\/j.cor.2022.105826_b10","doi-asserted-by":"crossref","first-page":"3680","DOI":"10.1016\/j.asoc.2011.01.039","article-title":"Solving the traveling salesman problem based on an adaptive simulated annealing algorithm with greedy search","volume":"11","author":"Geng","year":"2011","journal-title":"Appl. Soft Comput."},{"issue":"1","key":"10.1016\/j.cor.2022.105826_b11","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/s10898-009-9458-3","article-title":"Solving the problem of packing equal and unequal circles in a circular container","volume":"47","author":"Grosso","year":"2010","journal-title":"J. Global Optim."},{"key":"10.1016\/j.cor.2022.105826_b12","series-title":"National Conference of Theoretical Computer Science","first-page":"75","article-title":"A greedy heuristic based on corner occupying action for the 2D circular bin packing problem","author":"He","year":"2017"},{"issue":"7","key":"10.1016\/j.cor.2022.105826_b13","doi-asserted-by":"crossref","first-page":"1355","DOI":"10.1016\/j.cor.2011.08.005","article-title":"An efficient deterministic heuristic for two-dimensional rectangular packing","volume":"39","author":"He","year":"2012","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2022.105826_b14","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/j.cor.2014.12.010","article-title":"An action-space-based global optimization algorithm for packing circles into a square container","volume":"58","author":"He","year":"2015","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2022.105826_b15","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2020.105140","article-title":"Adaptive large neighborhood search for solving the circle bin packing problem","volume":"127","author":"He","year":"2021","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2022.105826_b16","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1016\/j.cor.2017.12.002","article-title":"An efficient quasi-physical quasi-human algorithm for packing equal circles in a circular container","volume":"92","author":"He","year":"2018","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2022.105826_b17","first-page":"33","article-title":"A best-local position procedure-based heuristic for two-dimensional layout problems","volume":"2","author":"Hifi","year":"2002","journal-title":"Stud. Inform. Univ."},{"issue":"2","key":"10.1016\/j.cor.2022.105826_b18","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1016\/S0377-2217(03)00417-X","article-title":"A simulated annealing approach for the circular cutting problem","volume":"159","author":"Hifi","year":"2004","journal-title":"European J. Oper. Res."},{"issue":"8","key":"10.1016\/j.cor.2022.105826_b19","doi-asserted-by":"crossref","first-page":"2125","DOI":"10.1016\/j.cor.2005.01.003","article-title":"New heuristics for packing unequal circles into a circular container","volume":"33","author":"Huang","year":"2006","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2022.105826_b20","series-title":"Near-Optimal Bin Packing Algorithms","author":"Johnson","year":"1973"},{"issue":"2","key":"10.1016\/j.cor.2022.105826_b21","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/S0377-2217(02)00247-3","article-title":"Algorithms for the variable sized bin packing problem","volume":"147","author":"Kang","year":"2003","journal-title":"European J. Oper. Res."},{"issue":"4598","key":"10.1016\/j.cor.2022.105826_b22","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","author":"Kirkpatrick","year":"1983","journal-title":"Science"},{"issue":"2","key":"10.1016\/j.cor.2022.105826_b23","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/S0377-2217(02)00123-6","article-title":"Two-dimensional packing problems: A survey","volume":"141","author":"Lodi","year":"2002","journal-title":"European J. Oper. Res."},{"issue":"4","key":"10.1016\/j.cor.2022.105826_b24","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1287\/ijoc.11.4.345","article-title":"Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems","volume":"11","author":"Lodi","year":"1999","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"10.1016\/j.cor.2022.105826_b25","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1016\/j.ejor.2015.10.062","article-title":"A formulation space search heuristic for packing unequal circles in a fixed size circular container","volume":"251","author":"L\u00f3pez","year":"2016","journal-title":"European J. Oper. Res."},{"issue":"5","key":"10.1016\/j.cor.2022.105826_b26","doi-asserted-by":"crossref","first-page":"1742","DOI":"10.1016\/j.cor.2006.10.012","article-title":"PERM for solving circle packing problem","volume":"35","author":"L\u00fc","year":"2008","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2022.105826_b27","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/PL00009314","article-title":"Curved hexagonal packings of equal disks in a circle","volume":"18","author":"Lubachevsky","year":"1997","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/j.cor.2022.105826_b28","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1016\/S0305-0548(03)00020-0","article-title":"Approximate algorithms for constrained circular cutting problems","volume":"31","author":"Mhand","year":"2004","journal-title":"Comput. Oper. Res."},{"issue":"9","key":"10.1016\/j.cor.2022.105826_b29","doi-asserted-by":"crossref","first-page":"2419","DOI":"10.1016\/j.cor.2004.03.010","article-title":"Reformulation descent applied to circle packing problems","volume":"32","author":"Mladenovi\u0107","year":"2005","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2022.105826_b30","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1287\/ijoc.1040.0089","article-title":"A set-covering-based heuristic approach for bin-packing problems","volume":"18","author":"Monaci","year":"2006","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"10.1016\/j.cor.2022.105826_b31","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/s10479-008-0449-4","article-title":"A hybrid GRASP\/VND algorithm for two-and three-dimensional bin packing","volume":"179","author":"Parre\u00f1o","year":"2010","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2022.105826_b32","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1016\/S0377-2217(01)00241-7","article-title":"An improved algorithm for the packing of unequal circles within a larger containing circle","volume":"141","author":"Wang","year":"2002","journal-title":"European J. Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2022.105826_b33","first-page":"337","article-title":"A skyline heuristic for the 2D rectangular packing and strip packing problems","volume":"215","author":"Wei","year":"2011","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2022.105826_b34","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1016\/j.asoc.2017.11.051","article-title":"Adaptive tabu search and variable neighborhood descent for packing unequal circles into a square","volume":"65","author":"Zhizhong","year":"2018","journal-title":"Appl. Soft Comput."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S030505482200106X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S030505482200106X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T07:57:12Z","timestamp":1759651032000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S030505482200106X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8]]},"references-count":34,"alternative-id":["S030505482200106X"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.cor.2022.105826","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2022,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Adaptive simulated annealing with greedy search for the circle bin packing problem","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.cor.2022.105826","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2022 Elsevier Ltd. All rights reserved.","name":"copyright","label":"Copyright"}],"article-number":"105826"}}