{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T18:57:23Z","timestamp":1771700243270,"version":"3.50.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2011,7,27]],"date-time":"2011-07-27T00:00:00Z","timestamp":1311724800000},"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":[[2011,8]]},"DOI":"10.1007\/s11432-011-4351-3","type":"journal-article","created":{"date-parts":[[2011,7,26]],"date-time":"2011-07-26T04:02:29Z","timestamp":1311652949000},"page":"1572-1584","source":"Crossref","is-referenced-by-count":12,"title":["A new heuristic algorithm for the circular packing problem with equilibrium constraints"],"prefix":"10.1007","volume":"54","author":[{"given":"JingFa","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gang","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"HuanTong","family":"Geng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,7,27]]},"reference":[{"key":"4351_CR1","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/S0377-2217(02)00123-6","volume":"141","author":"A. Lodi","year":"2002","unstructured":"Lodi A, Martello S, Monaci M. Two-dimensional packing problems: a survey. Eur J Oper Res, 2002, 141: 241\u2013252","journal-title":"Eur J Oper Res"},{"key":"4351_CR2","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":"4351_CR3","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/S1000-9361(08)60066-7","volume":"22","author":"Y. S. Wang","year":"2009","unstructured":"Wang Y S, Teng H F. Knowledge fusion design method: satellite module layout. Chin J Aeronaut, 2009, 22: 32\u201342","journal-title":"Chin J Aeronaut"},{"key":"4351_CR4","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0743-7315(90)90019-L","volume":"10","author":"J. Leung","year":"1990","unstructured":"Leung J, Tam T, Wong C S, et al. Packing square into square. J Parallel Distr Com, 1990, 10: 271\u2013275","journal-title":"J Parallel Distr Com"},{"key":"4351_CR5","first-page":"734","volume":"29","author":"W. Q. Huang","year":"2006","unstructured":"Huang W Q, Liu J F. A deterministic heuristic algorithm based on Euclidian distance for solving the rectangles packing problem. Chin J Comput, 2006, 29: 734\u2013739","journal-title":"Chin J Comput"},{"key":"4351_CR6","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/j.ejor.2008.02.024","volume":"196","author":"W. Q. Huang","year":"2009","unstructured":"Huang W Q, He K. A caving degree approach for the single container loading problem. Eur J Oper Res, 2009, 196: 93\u2013101","journal-title":"Eur J Oper Res"},{"key":"4351_CR7","doi-asserted-by":"crossref","first-page":"1608","DOI":"10.1016\/j.cor.2008.03.004","volume":"36","author":"L. J. Wei","year":"2009","unstructured":"Wei L J, Zhang D F, Chen Q S. A least wasted first heuristic algorithm for the rectangular packing problem. Comput Oper Res, 2009, 36: 1608\u20131614","journal-title":"Comput Oper Res"},{"key":"4351_CR8","doi-asserted-by":"crossref","first-page":"1068","DOI":"10.1016\/j.cor.2009.09.011","volume":"37","author":"D. B. Chen","year":"2010","unstructured":"Chen D B, Liu J F, Fu Y, et al. An efficient heuristic algorithm for arbitrary shaped rectilinear block packing problem. Comput Oper Res, 2010, 37: 1068\u20131074","journal-title":"Comput Oper Res"},{"key":"4351_CR9","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":"4351_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-Math, 1994, 37: 1272\u20131280","journal-title":"Sci China Ser A-Math"},{"key":"4351_CR11","first-page":"1096","volume":"10","author":"F. Tang","year":"1999","unstructured":"Tang F, Teng H F. A modified genetic algorithm and its application to layout optimization. J Softw, 1999, 10: 1096\u20131102","journal-title":"J Softw"},{"key":"4351_CR12","first-page":"553","volume":"24","author":"Z. Q. Qian","year":"2001","unstructured":"Qian Z Q, Teng H F, Sun Z G. Human-computer interactive genetic algorithm and its application to constrained layout optimization. Chin J Comput, 2001, 24: 553\u2013559","journal-title":"Chin J Comput"},{"key":"4351_CR13","first-page":"1242","volume":"24","author":"Y. Yu","year":"2001","unstructured":"Yu Y, Cha J Z, Tang X J. Learning based GA and application in packing. Chin J Comput, 2001, 24: 1242\u20131249","journal-title":"Chin J Comput"},{"key":"4351_CR14","first-page":"897","volume":"27","author":"N. Li","year":"2004","unstructured":"Li N, Liu F, Sun D B. A study on the particle swarm optimization with mutation operator constrained layout optimization. Chin J Comput, 2004, 27: 897\u2013903","journal-title":"Chin J Comput"},{"key":"4351_CR15","first-page":"36","volume":"20","author":"C. Zhou","year":"2005","unstructured":"Zhou C, Gao L, Gao H B. Particle swarm optimization based algorithm for constrained layout optimization. Control Decision, 2005, 20: 36\u201340","journal-title":"Control Decision"},{"key":"4351_CR16","doi-asserted-by":"crossref","first-page":"1724","DOI":"10.1360\/crad20061008","volume":"43","author":"K. Y. Lei","year":"2006","unstructured":"Lei K Y, Qiu Y H. A study of constrained layout optimization using adaptive particle swarm optimizer. J Comput Res Develop, 2006, 43: 1724\u20131731","journal-title":"J Comput Res Develop"},{"key":"4351_CR17","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1016\/j.cie.2006.06.004","volume":"50","author":"W. Q. Huang","year":"2006","unstructured":"Huang W Q, Chen M. Note on: An improved algorithm for the packing of unequal circles within a larger containing circle. Comput Ind Eng, 2006, 50: 338\u2013344","journal-title":"Comput Ind Eng"},{"key":"4351_CR18","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 A, 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":"4351_CR19","doi-asserted-by":"crossref","first-page":"1214","DOI":"10.3724\/SP.J.1016.2009.01214","volume":"32","author":"Y. S. Wang","year":"2009","unstructured":"Wang Y S, Shi Y J, Teng H F. An improved scatter search for circles packing problem with the equilibrium constraint. Chin J Comput, 2009, 32: 1214\u20131221","journal-title":"Chin J Comput"},{"key":"4351_CR20","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1145\/937503.937505","volume":"35","author":"C. Blum","year":"2003","unstructured":"Blum C, Roli A. Meta-heuristic in combinatorial optimization: overview and conceptual comparison. ACM Comput Survey, 2003, 35: 268\u2013308","journal-title":"ACM Comput Survey"},{"key":"4351_CR21","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":"4351_CR22","doi-asserted-by":"crossref","first-page":"068105","DOI":"10.1103\/PhysRevLett.88.068105","volume":"88","author":"U. H. E. Hansmann","year":"2002","unstructured":"Hansmann U H E, Wille L T. Global optimization by energy landscape paving. Phys Rev Lett, 2002, 88: 068105","journal-title":"Phys Rev Lett"},{"key":"4351_CR23","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F. Glover","year":"1989","unstructured":"Glover F. Tabu search: Part I. ORSA J Comput, 1989, 1: 190\u2013206","journal-title":"ORSA J Comput"},{"key":"4351_CR24","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F. Glover","year":"1990","unstructured":"Glover F. Tabu search: Part II. ORSA J Comput, 1990, 2: 4\u201332","journal-title":"ORSA J Comput"},{"key":"4351_CR25","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F. Glover","year":"1997","unstructured":"Glover F, Laguna M. Tabu Search. Boston: Kluwer Academic Publishers, 1997"},{"key":"4351_CR26","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":"4351_CR27","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":"4351_CR28","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":"4351_CR29","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"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-011-4351-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11432-011-4351-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-4351-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T15:36:14Z","timestamp":1559403374000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11432-011-4351-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7,27]]},"references-count":29,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2011,8]]}},"alternative-id":["4351"],"URL":"https:\/\/doi.org\/10.1007\/s11432-011-4351-3","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,7,27]]}}}