{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T18:27:57Z","timestamp":1763663277695},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,2,3]],"date-time":"2015-02-03T00:00:00Z","timestamp":1422921600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2016,4]]},"DOI":"10.1007\/s00500-015-1603-y","type":"journal-article","created":{"date-parts":[[2015,2,2]],"date-time":"2015-02-02T06:50:30Z","timestamp":1422859830000},"page":"1521-1535","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["Evolutionary computation solutions to the circle packing problem"],"prefix":"10.1007","volume":"20","author":[{"given":"Juan J.","family":"Flores","sequence":"first","affiliation":[]},{"given":"Jose","family":"Mart\u00ednez","sequence":"additional","affiliation":[]},{"given":"Felix","family":"Calder\u00f3n","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,2,3]]},"reference":[{"key":"1603_CR1","doi-asserted-by":"crossref","unstructured":"Addis B, Locatelli M, Schoen F (2008) Efficiently packing unequal disks in a circle. Oper Res Lett 36(1):37\u201342","DOI":"10.1016\/j.orl.2007.03.001"},{"key":"1603_CR2","doi-asserted-by":"crossref","unstructured":"Al-Modahka I, Hifi M, M\u2019Hallah R (2011) Packing circles in the smallest circle: an adaptive hybrid algorithm. J Oper Res Soc 62(11):1917\u20131930","DOI":"10.1057\/jors.2010.157"},{"issue":"3","key":"1603_CR3","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 FJ, Pint\u00e9r JD (2008) Solving circle packing problems by global optimization: numerical results and industrial applications. Eur J Oper Res 191(3):786\u2013802","journal-title":"Eur J Oper Res"},{"key":"1603_CR4","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1007\/s00500-004-0377-4","volume":"9","author":"K Deb","year":"2004","unstructured":"Deb K (2004) A population-based algorithm-generator for real-parameter optimization. Soft Comput 9:236\u2013253","journal-title":"Soft Comput"},{"key":"1603_CR5","unstructured":"Demaine ED, Fekete SP, Lang RJ (2010) Circle packing for origami design is hard. arXiv:1008.1224"},{"issue":"4","key":"1603_CR6","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1057\/palgrave.jors.2602170","volume":"58","author":"KA Dowsland","year":"2007","unstructured":"Dowsland KA, Gilbert M, Kendall G (2007) A local search approach to a circle cutting problem arising in the motor cycle industry. J Oper Res Soc 58(4):429\u2013438","journal-title":"J Oper Res Soc"},{"key":"1603_CR7","doi-asserted-by":"crossref","unstructured":"Francesco C, Cerrone C, Cerulli R (2014) A tabu search approach for the circle packing problem. In: 17th international conference on network-based information systems","DOI":"10.1109\/NBiS.2014.28"},{"key":"1603_CR8","doi-asserted-by":"crossref","unstructured":"Harary F, Randolph W, Mezey PG (1996) A study of maximum unit-circle caterpillars-tools for the study of the shape of adsorption patterns. Discret Appl Math 67(1\u20133):127\u2013135","DOI":"10.1016\/0166-218X(95)00014-I"},{"key":"1603_CR9","doi-asserted-by":"crossref","unstructured":"Hifi M, M\u2019Hallah R (2009) Beam search and non-linear programming tools for the circular packing problem. Int J Math Oper Res 1(4):476\u2013503","DOI":"10.1504\/IJMOR.2009.026278"},{"key":"1603_CR10","doi-asserted-by":"crossref","unstructured":"Lee D-T, Schachter BJ (1980) Two algorithms for constructing a delaunay triangulation. Int J Comput Inf Sci 9(3):219\u2013242","DOI":"10.1007\/BF00977785"},{"key":"1603_CR11","doi-asserted-by":"crossref","unstructured":"Michalewicz Z (1996) Genetic algorithms+datastructures=evolutionary programs, 3rd edn. Springer, Berlin","DOI":"10.1007\/978-3-662-03315-9"},{"issue":"9","key":"1603_CR12","doi-asserted-by":"crossref","first-page":"2419","DOI":"10.1016\/j.cor.2004.03.010","volume":"32","author":"N Mladenovic","year":"2005","unstructured":"Mladenovic N, Plastria F, Urosevic D (2005) Reformulation descent applied to circle packing problems. Comput Oper Res 32(9):2419\u20132434","journal-title":"Comput Oper Res"},{"issue":"1\u20132","key":"1603_CR13","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/S0921-5093(04)00830-5","volume":"385","author":"MW Nordbakke","year":"2004","unstructured":"Nordbakke MW, Ryum N, Hunderi O (2004) Curvilinear polygons, finite circle packings, and normal grain growth. Mater Sci Eng A 385(1\u20132):229\u2013234","journal-title":"Mater Sci Eng A"},{"key":"1603_CR14","first-page":"1","volume":"10","author":"JD Pint\u00e9r","year":"2006","unstructured":"Pint\u00e9r JD, Kampas FJ (2006) Nonlinear optimization in mathematica with math-optimizer professional. Math Educ Res 10:1\u201318","journal-title":"Math Educ Res"},{"key":"1603_CR15","doi-asserted-by":"crossref","unstructured":"Shi Y-J, Liu Z-C, Ma S (2010) An improved evolution strategy for constrained circle packing problem. In: Advanced intelligent computing theories and applications. Springer, Berlin, pp 86\u201393","DOI":"10.1007\/978-3-642-14922-1_12"},{"key":"1603_CR16","unstructured":"Specht E (1999) Packomania web site. http:\/\/www.packomania.com\/"},{"issue":"3","key":"1603_CR17","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/BF03167582","volume":"21","author":"K Sugihara","year":"2004","unstructured":"Sugihara K, Sawai M, Sano H, Kim DS, Kim D (2004) Disk packing for the estimation of the size of a wire bundle. Jpn J Ind Appl Math 21(3):259\u2013278","journal-title":"Jpn J Ind Appl Math"},{"key":"1603_CR18","unstructured":"Szab\u00f3 PG, Mark\u00f3t MC, Csendes T, Specht E, Casado LG, Garc\u00eda I (2006) New approaches to circle packing in a square. Springer, Berlin"},{"issue":"2","key":"1603_CR19","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1016\/S0377-2217(01)00241-7","volume":"141","author":"H Wang","year":"2002","unstructured":"Wang H, Huang W, Zhang Q, Xu D (2002) An improved algorithm for the packing of unequal circles within a larger containing circle. Eur J Oper Res 141(2):440\u2013453","journal-title":"Eur J Oper Res"},{"key":"1603_CR20","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1023\/B:ANOR.0000039514.14699.03","volume":"1\u20134","author":"H Wenqi","year":"2004","unstructured":"Wenqi H, Yan K (2004) A short note on a simple search heuristic for the diskspacking problem. Ann Oper Res 1\u20134:101\u2013108","journal-title":"Ann Oper Res"},{"key":"1603_CR21","unstructured":"Xu Y-C, Xiao R-B, Amos M (2007) A novel genetic algorithm for the layout optimization problem. In: Evolutionary computation 2007 CEC 2007, pp 3938\u20133943"},{"key":"1603_CR22","doi-asserted-by":"crossref","first-page":"1722","DOI":"10.3923\/itj.2012.1722.1729","volume":"11","author":"S Yan-Jun","year":"2012","unstructured":"Yan-Jun S, Yi-Shou W, Long W, Hong-Fei T (2012) A layout pattern based particle swarm optimization for constrained packing problems. Inf Technol J 11:1722\u20131729","journal-title":"Inf Technol J"},{"issue":"8","key":"1603_CR23","doi-asserted-by":"crossref","first-page":"1941","DOI":"10.1016\/j.cor.2003.12.006","volume":"32","author":"DF Zhang","year":"2005","unstructured":"Zhang DF, Deng AS (2005) An effective hybrid algorithm for the problem of packing circles into a larger containing circle. Comput Oper Res 32(8):1941\u20131951","journal-title":"Comput Oper Res"},{"key":"1603_CR24","first-page":"553","volume":"5","author":"Q Zhi-Qin","year":"2001","unstructured":"Zhi-Qin Q, Hong-Fei T, Zhi-Guo S (2001) Human\u2013computer interactive genetic algorithm and its application to constrained layout optimization. Chin J Comput 5:553\u2013560","journal-title":"Chin J Comput"},{"key":"1603_CR25","unstructured":"Zimmermann A (2006) Al zimmermann\u2019s programming contests. http:\/\/www.recmath.org\/contest\/CirclePacking\/index.php"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-015-1603-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-015-1603-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-015-1603-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,20]],"date-time":"2019-08-20T12:04:53Z","timestamp":1566302693000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-015-1603-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2,3]]},"references-count":25,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,4]]}},"alternative-id":["1603"],"URL":"https:\/\/doi.org\/10.1007\/s00500-015-1603-y","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,2,3]]}}}