{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,21]],"date-time":"2023-11-21T18:43:18Z","timestamp":1700592198130},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2011,11,26]],"date-time":"2011-11-26T00:00:00Z","timestamp":1322265600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2013,9]]},"DOI":"10.1007\/s11432-011-4424-3","type":"journal-article","created":{"date-parts":[[2011,11,26]],"date-time":"2011-11-26T01:10:56Z","timestamp":1322269856000},"page":"1-14","source":"Crossref","is-referenced-by-count":12,"title":["Tabu search algorithm combined with global perturbation for packing arbitrary sized circles into a circular container"],"prefix":"10.1007","volume":"56","author":[{"given":"WenQi","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ZhangHua","family":"Fu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"RuChu","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,11,26]]},"reference":[{"key":"4424_CR1","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1145\/2455.214106","volume":"1","author":"D S Hochbaum","year":"1985","unstructured":"Hochbaum D S, Maass W. Approximation schemes for covering and packing problems in image processing and VLSI. J ACM, 1985, 1: 130\u2013136","journal-title":"J ACM"},{"key":"4424_CR2","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1038\/374039a0","volume":"374","author":"G Metcalfe","year":"1995","unstructured":"Metcalfe G, Shinbrot T, McCarthy J J, et al. Avalanche mixing of granular solids. Nature, 1995, 374: 39\u201341","journal-title":"Nature"},{"key":"4424_CR3","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/j.cplett.2006.03.003","volume":"423","author":"G Rossi","year":"2006","unstructured":"Rossi G, Ferrando R. Global optimization by excitable walkers. Chem Phys Lett, 2006, 423: 17\u201322","journal-title":"Chem Phys Lett"},{"key":"4424_CR4","doi-asserted-by":"crossref","first-page":"7492","DOI":"10.1021\/jp802872p","volume":"112","author":"H Takeuchi","year":"2008","unstructured":"Takeuchi H. Geometry optimization of carbon dioxide clusters (CO2)n for 4 n 40. J Phys Chem A, 2008, 112: 7492\u20137497","journal-title":"J Phys Chem A"},{"key":"4424_CR5","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/S0305-0548(03)00208-9","volume":"32","author":"Y D Cui","year":"2005","unstructured":"Cui Y D. Generating optimal T-shape cutting patterns for circular blanks. Comput Oper Res, 2005, 32: 143\u2013152","journal-title":"Comput Oper Res"},{"key":"4424_CR6","doi-asserted-by":"crossref","first-page":"466","DOI":"10.1016\/0377-2217(94)90410-3","volume":"77","author":"H J Fraser","year":"1994","unstructured":"Fraser H J, George J A. Integrated container loading software for pulp and paper industry. Eur J Oper Res, 1994, 77: 466\u2013474","journal-title":"Eur J Oper Res"},{"key":"4424_CR7","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/j.ejor.2003.06.018","volume":"160","author":"E G Birgin","year":"2005","unstructured":"Birgin E G, Martinez J M, Ronconi D P. Optimizing the packing of cylinders into a rectangular container: a nonlinear approach. Eur J Oper Res, 2005, 160: 19\u201333","journal-title":"Eur J Oper Res"},{"key":"4424_CR8","first-page":"823","volume":"34","author":"M D Adickes","year":"2002","unstructured":"Adickes M D, Billo R E, Norman B A, et al. Optimization of indoor wireless communication network layouts. IIE Trans, 2002, 34: 823\u2013836","journal-title":"IIE Trans"},{"key":"4424_CR9","doi-asserted-by":"crossref","first-page":"885","DOI":"10.1007\/s11432-010-0080-2","volume":"53","author":"J F Liu","year":"2010","unstructured":"Liu J F, Li G. Basin filling algorithm for the circular packing problem with equilibrium behavioral constraints. Sci China Inf Sci, 2010, 53: 885\u2013895","journal-title":"Sci China Inf Sci"},{"key":"4424_CR10","first-page":"1272","volume":"37","author":"H F Teng","year":"1994","unstructured":"Teng H F, Sun S L, Ge W H, et al. Layout optimization for the dishes installed on a rotating table the packing problem with equilibrium behavioral constraints. Sci China Ser A, 1994, 37: 1272\u20131280","journal-title":"Sci China Ser A"},{"key":"4424_CR11","volume-title":"Computers and Intractability: a Guide to the Theory of NP-Completeness","author":"M R Garey","year":"1979","unstructured":"Garey M R, Johnson D S. Computers and Intractability: a Guide to the Theory of NP-Completeness. Freeman: San Francisco, 1979"},{"key":"4424_CR12","doi-asserted-by":"crossref","first-page":"2125","DOI":"10.1016\/j.cor.2005.01.003","volume":"33","author":"W Q Huang","year":"2006","unstructured":"Huang W Q, Li Y, Li C M, et al. New heuristics for packing unequal circles into a circular container. Comput Oper Res, 2006, 33: 2125\u20132142","journal-title":"Comput Oper Res"},{"key":"4424_CR13","doi-asserted-by":"crossref","first-page":"1742","DOI":"10.1016\/j.cor.2006.10.012","volume":"35","author":"Z P L\u00fc","year":"2008","unstructured":"L\u00fc Z P, Huang W Q. PERM for solving circle packing problem. Comput Oper Res, 2008, 35: 1742\u20131755","journal-title":"Comput Oper Res"},{"key":"4424_CR14","doi-asserted-by":"crossref","first-page":"1513","DOI":"10.1016\/j.cor.2008.02.003","volume":"36","author":"H Akeb","year":"2009","unstructured":"Akeb H, Hifi M, M\u2019Hallah R. A beam search algorithm for the circular packing problem. Comput Oper Res, 2009, 36: 1513\u20131528","journal-title":"Comput Oper Res"},{"key":"4424_CR15","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1111\/j.1475-3995.2009.00745.x","volume":"17","author":"H Akeb","year":"2010","unstructured":"Akeb H, Hifi M, M\u2019Hallah R. Adaptive beam search look-ahead algorithms for the circular packing problem. Int Trans Oper Res, 2010, 17: 553\u2013575","journal-title":"Int Trans Oper Res"},{"key":"4424_CR16","doi-asserted-by":"crossref","first-page":"1280","DOI":"10.1016\/j.ejor.2005.11.069","volume":"183","author":"M Hifi","year":"2007","unstructured":"Hifi M, M\u2019Hallah R. A dynamic adaptive local search algorithm for the circular packing problem. Eur J Oper Res, 2007, 183: 1280\u20131294","journal-title":"Eur J Oper Res"},{"key":"4424_CR17","volume-title":"J Oper Res Soc","author":"I Al-Mudahka","year":"2010","unstructured":"Al-Mudahka I, Hifi M, M\u2019Hallah R. Packing circles in the smallest circle: an adaptive hybrid algorithm. J Oper Res Soc, 2010, doi: 10.1057\/jors.2010.157"},{"key":"4424_CR18","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1007\/BF02916995","volume":"42","author":"W Q Huang","year":"1999","unstructured":"Huang W Q, Xu R C. Two personnification strategies for solving circles packing problem. Sci China Ser E-Tech Sci, 1999, 42: 595\u2013602","journal-title":"Sci China Ser E-Tech Sci"},{"key":"4424_CR19","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1016\/S0377-2217(01)00241-7","volume":"141","author":"H Q Wang","year":"2002","unstructured":"Wang H Q, Huang W Q, Zhang Q, et al. An improved algorithm for the packing of unequal circles within a larger containing circle. Eur J Oper Res, 2002, 141: 440\u2013453","journal-title":"Eur J Oper Res"},{"key":"4424_CR20","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1023\/B:ANOR.0000039514.14699.03","volume":"131","author":"W Q Huang","year":"2004","unstructured":"Huang W Q, Kang Y. A short note on a simple search heuristic for the disk packing problem. Ann Oper Res, 2004, 131: 101\u2013108","journal-title":"Ann Oper Res"},{"key":"4424_CR21","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/j.orl.2007.03.001","volume":"36","author":"B Addis","year":"2008","unstructured":"Addis B, Locatelli M, Schoen F. Efficiently packing unequal disks in a circle. Oper Res Lett, 2008, 36: 37\u201342","journal-title":"Oper Res Lett"},{"key":"4424_CR22","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/s10898-009-9458-3","volume":"47","author":"A Grosso","year":"2010","unstructured":"Grosso A, Jamali A R M J U, Locatelli M, et al. Solving the problem of packing equal and unequal circles in a circular container. J Global Optim, 2010, 47: 63\u201381","journal-title":"J Global Optim"},{"key":"4424_CR23","doi-asserted-by":"crossref","first-page":"1941","DOI":"10.1016\/j.cor.2003.12.006","volume":"32","author":"D F Zhang","year":"2005","unstructured":"Zhang D F, Deng A S. An effective hybrid algorithm for the problem of packing circles into a larger containing circle. Comput Oper Res, 2005, 32: 1941\u20131951","journal-title":"Comput Oper Res"},{"key":"4424_CR24","doi-asserted-by":"crossref","first-page":"1144","DOI":"10.1016\/j.cie.2009.05.010","volume":"57","author":"J F Liu","year":"2009","unstructured":"Liu J F, Xue S J, Liu Z X, et al. An improved energy landscape paving algorithm for the problem of packing circles into a larger containing circle. Comput Ind Eng, 2009, 57: 1144\u20131149","journal-title":"Comput Ind Eng"},{"key":"4424_CR25","first-page":"250","volume":"5938","author":"J F Liu","year":"2010","unstructured":"Liu J F, Wang Y L, Pan J J. Efficiently packing circles into a larger containing circle. LNCS, 2010, 5938: 250\u2013256","journal-title":"LNCS"},{"key":"4424_CR26","doi-asserted-by":"crossref","first-page":"786","DOI":"10.1016\/j.ejor.2007.01.054","volume":"191","author":"I Castillo","year":"2008","unstructured":"Castillo I, Kampas F J, Printer J D. Solving circle packing problems by global optimization: numerical results and industrial applications. Eur J Oper Res, 2008, 191: 786\u2013802","journal-title":"Eur J Oper Res"},{"key":"4424_CR27","volume-title":"Advance Oper Res","author":"M Hifi","year":"2009","unstructured":"Hifi M, M\u2019Hallah R. A literature review on circle and sphere packing problems: models and methodologies. Advance Oper Res, 2009, doi: 10.1155\/2009\/150624"},{"key":"4424_CR28","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover.","year":"1989","unstructured":"F Glover. Tabu search: Part 1. ORSA J Comput, 1989, 1: 190\u2013261","journal-title":"ORSA J Comput"},{"key":"4424_CR29","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F Glover.","year":"1990","unstructured":"F Glover. Tabu search: Part 2. ORSA J Comput, 1990, 2: 4\u201332","journal-title":"ORSA J Comput"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-011-4424-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11432-011-4424-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-011-4424-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T15:37:42Z","timestamp":1559403462000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11432-011-4424-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,11,26]]},"references-count":29,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2013,9]]}},"alternative-id":["4424"],"URL":"https:\/\/doi.org\/10.1007\/s11432-011-4424-3","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,11,26]]}}}