{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T05:01:39Z","timestamp":1768280499743,"version":"3.49.0"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2018,11,13]],"date-time":"2018-11-13T00:00:00Z","timestamp":1542067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,11,13]],"date-time":"2018-11-13T00:00:00Z","timestamp":1542067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Wireless Netw"],"published-print":{"date-parts":[[2020,10]]},"DOI":"10.1007\/s11276-018-1869-y","type":"journal-article","created":{"date-parts":[[2018,11,13]],"date-time":"2018-11-13T15:50:45Z","timestamp":1542124245000},"page":"4743-4752","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":27,"title":["Binary monkey algorithm for approximate packing non-congruent circles in a rectangular container"],"prefix":"10.1007","volume":"26","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8368-3948","authenticated-orcid":false,"given":"Rafael","family":"Torres-Escobar","sequence":"first","affiliation":[]},{"given":"Jos\u00e9 Antonio","family":"Marmolejo-Saucedo","sequence":"additional","affiliation":[]},{"given":"Igor","family":"Litvinchev","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,13]]},"reference":[{"key":"1869_CR1","doi-asserted-by":"publisher","first-page":"1917","DOI":"10.1057\/jors.2010.157","volume":"62","author":"I Al-Mudahka","year":"2011","unstructured":"Al-Mudahka, I., Hifi, M., & M\u2019Hallah, R. (2011). Packing circles in the smallest circle: An adaptive hybrid algorithm. Journal of the Operational Research Society, 62, 1917\u20131930.","journal-title":"Journal of the Operational Research Society"},{"key":"1869_CR2","unstructured":"Birgin, E.G (2016). Applications + Practical Conceptualization + Mathematics = fruitful Innovation. In: R.S. Anderssen, P.\u00a0Broadbridge, Y.\u00a0Fukumoto, K.\u00a0Kajiwara, T.\u00a0Takagi, E.\u00a0Verbitskiy, M.\u00a0Wakayama (eds.) Applications + Practical Conceptualization + Mathematics = fruitful Innovation: Proceedings of the Forum of Mathematics for Industry 2014, vol. 11, (pp. 31\u201339). Tokyo: Springer"},{"issue":"7","key":"1869_CR3","doi-asserted-by":"publisher","first-page":"1318","DOI":"10.1016\/j.cor.2009.09.017","volume":"37","author":"EG Birgin","year":"2010","unstructured":"Birgin, E. G., & Gentil, J. M. (2010). New and improved results for packing identical unitary radius circles within triangles, rectangles and strips. Computers & Operations Research, 37(7), 1318\u20131327.","journal-title":"Computers & Operations Research"},{"key":"1869_CR4","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1016\/j.amc.2017.03.051","volume":"319","author":"MS Casas-Ramrez","year":"2018","unstructured":"Casas-Ramrez, M. S., Camacho-Vallejo, J. F., & Martnez-Salazar, I. A. (2018). Approximating solutions to a bilevel capacitated facility location problem with customer\u2019s patronization toward a list of preferences. Applied Mathematics and Computation. Recent Advances in Computing, 319, 369\u2013386.","journal-title":"Applied Mathematics and Computation. Recent Advances in Computing"},{"issue":"3","key":"1869_CR5","doi-asserted-by":"publisher","first-page":"786","DOI":"10.1016\/j.ejor.2007.01.054","volume":"191","author":"I Castillo","year":"2008","unstructured":"Castillo, I., Kampas, F. J., & Pint\u00e9r, J. D. (2008). Solving circle packing problems by global optimization: Numerical results and industrial applications. European Journal of Operational Research, 191(3), 786\u2013802.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"1869_CR6","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1504\/IJLSM.2014.064029","volume":"19","author":"R Dubey","year":"2014","unstructured":"Dubey, R., Bag, S., & Ali, S. S. (2014). Green supply chain practices and its impact on organisational performance: An insight from indian rubber industry. International Journal of Logistics Systems and Management, 19(1), 20\u201342.","journal-title":"International Journal of Logistics Systems and Management"},{"issue":"2","key":"1869_CR7","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s10898-012-9865-8","volume":"55","author":"G Fasano","year":"2012","unstructured":"Fasano, G. (2012). A global optimization point of view to handle non-standard object packing problems. Journal of Global Optimization, 55(2), 279\u2013299.","journal-title":"Journal of Global Optimization"},{"key":"1869_CR8","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-319-18899-7_4","volume-title":"Optimized packings with applications","author":"G Fasano","year":"2015","unstructured":"Fasano, G. (2015). A modeling-based approach for non-standard packing problems. In G. Fasano & J. D. Pint\u00e9r (Eds.), Optimized packings with applications (pp. 67\u201385). Berlin: Springer."},{"key":"1869_CR9","doi-asserted-by":"publisher","first-page":"1521","DOI":"10.1007\/s00500-015-1603-y","volume":"20","author":"JJ Flores","year":"2015","unstructured":"Flores, J. J., Mart\u00ednez, J., & Calder\u00f3n, F. (2015). Evolutionary computation solutions to the circle packing problem. Soft Computing, 20, 1521\u20131535.","journal-title":"Soft Computing"},{"issue":"3","key":"1869_CR10","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1016\/j.ejor.2013.04.050","volume":"230","author":"SI Galiev","year":"2013","unstructured":"Galiev, S. I., & Lisafina, M. S. (2013). Linear models for the approximate solution of the problem of packing equal circles into a given domain. European Journal of Operational Research, 230(3), 505\u2013514.","journal-title":"European Journal of Operational Research"},{"issue":"8","key":"1869_CR11","doi-asserted-by":"publisher","first-page":"1402","DOI":"10.1134\/S0965542516080066","volume":"56","author":"SI Galiev","year":"2016","unstructured":"Galiev, S. I., & Lisafina, M. S. (2016). Numerical optimization method for packing regular convex polygons. Computational Mathematics and Mathematical Physics, 56(8), 1402\u20131413.","journal-title":"Computational Mathematics and Mathematical Physics"},{"issue":"3","key":"1869_CR12","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/s10696-016-9256-4","volume":"29","author":"MD Gracia","year":"2017","unstructured":"Gracia, M. D., Gonz\u00e1lez-Ram\u00edrez, R. G., & Mar-Ortiz, J. (2017). The impact of lanes segmentation and booking levels on a container terminal gate congestion. Flexible Services and Manufacturing Journal, 29(3), 403\u2013432.","journal-title":"Flexible Services and Manufacturing Journal"},{"issue":"3","key":"1869_CR13","doi-asserted-by":"publisher","first-page":"1187","DOI":"10.1007\/s10898-012-9948-6","volume":"56","author":"Y He","year":"2013","unstructured":"He, Y., & Wu, Y. (2013). Packing non-identical circles within a rectangle with open length. Journal of Global Optimization, 56(3), 1187\u20131215.","journal-title":"Journal of Global Optimization"},{"issue":"1","key":"1869_CR14","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s10589-007-9049-5","volume":"39","author":"M Hifi","year":"2008","unstructured":"Hifi, M., & M\u2019Hallah, R. (2008). Adaptive and restarting techniques-based algorithms for circular packing problems. Computational Optimization and Applications, 39(1), 17\u201335. https:\/\/doi.org\/10.1007\/s10589-007-9049-5.","journal-title":"Computational Optimization and Applications"},{"key":"1869_CR15","doi-asserted-by":"crossref","unstructured":"Hifi, M., M\u2019Hallah, R. (2009). A literature review on circle and sphere packing problems: Models and methodologies. Advances in Operations Research 2009","DOI":"10.1155\/2009\/150624"},{"issue":"6","key":"1869_CR16","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/BF02916995","volume":"42","author":"W Huang","year":"1999","unstructured":"Huang, W., & Xu, R. (1999). Two personification strategies for solving circles packing problem. Science in China Series E: Technological Sciences, 42(6), 595\u2013602.","journal-title":"Science in China Series E: Technological Sciences"},{"issue":"7","key":"1869_CR17","doi-asserted-by":"publisher","first-page":"1333","DOI":"10.1007\/s11432-011-4270-3","volume":"54","author":"W Huang","year":"2011","unstructured":"Huang, W., & Ye, T. (2011). Quasi-physical global optimization method for solving the equal circle packing problem. Science China Information Sciences, 54(7), 1333\u20131339.","journal-title":"Science China Information Sciences"},{"issue":"1","key":"1869_CR18","doi-asserted-by":"publisher","first-page":"837","DOI":"10.1002\/cnm","volume":"25","author":"C Labra","year":"2009","unstructured":"Labra, C., & O\u00f1ate, E. (2009). High-density sphere packing for discrete element method simulations. Communications in Numerical Methods in Engineering, 25(1), 837\u2013849. https:\/\/doi.org\/10.1002\/cnm.","journal-title":"Communications in Numerical Methods in Engineering"},{"key":"1869_CR19","unstructured":"Lenstra, J., Kan, A. (1979) Econometric\u00a0institute, E.u.R.: Complexity of packing, covering and partitioning problems. Econometric Institute"},{"issue":"1","key":"1869_CR20","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s41095-015-0003-7","volume":"1","author":"G Liang","year":"2015","unstructured":"Liang, G., Lu, L., Chen, Z., & Yang, C. (2015). Poisson disk sampling through disk packing. Computational Visual Media, 1(1), 17\u201326.","journal-title":"Computational Visual Media"},{"key":"1869_CR21","first-page":"1","volume":"2014","author":"I Litvinchev","year":"2014","unstructured":"Litvinchev, I., & Ozuna Espinosa, E. L. (2014). Integer programming formulations for approximate packing circles in a rectangular container. Mathematical Problems in Engineering, 2014, 1\u20136.","journal-title":"Mathematical Problems in Engineering"},{"issue":"19","key":"1869_CR22","doi-asserted-by":"publisher","first-page":"1630","DOI":"10.1057\/jors.2012.128","volume":"64","author":"L Mart\u00ednez","year":"2013","unstructured":"Mart\u00ednez, L., & Amaya, C. (2013). A vehicle routing problem with multi-trips and time windows for circular items. Journal of the Operational Research Society, 64(19), 1630\u20131643.","journal-title":"Journal of the Operational Research Society"},{"key":"1869_CR23","doi-asserted-by":"crossref","unstructured":"Miyazawa, F. K., Pedrosa, L. L. C., Schouery, R. C. S., Sviridenko, M., & Wakabayashi, Y. (2014). Polynomial-time approximation schemes for circle packing problems. Algorithms\u2014ESA 2014: 22th Annual European Symposium, Wroclaw, Poland, September 8\u201310, 2014. Proceedings  (pp. 713\u2013724). Berlin Heidelberg: Springer","DOI":"10.1007\/978-3-662-44777-2_59"},{"key":"1869_CR24","doi-asserted-by":"publisher","unstructured":"Morinaga, S., Ohta, H., Nakamori, M. (2014) Algorithms for the circle-packing problem via extended sequence-pair. In: Transactions on Engineering Technologies: Special Issue of the World Congress on Engineering and Computer Science 2013 (pp. 1\u2013781). Netherlands: Springer. https:\/\/doi.org\/10.1007\/978-94-017-9115-1","DOI":"10.1007\/978-94-017-9115-1"},{"key":"1869_CR25","doi-asserted-by":"crossref","unstructured":"Shi, Y.J., Liu, Z.C., Ma, S. (2010) An improved evolution strategy for constrained circle packing problem. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (6215 LNCS(2), pp. 86\u201393)","DOI":"10.1007\/978-3-642-14922-1_12"},{"key":"1869_CR26","volume-title":"New approaches to circle packing in a square. With program codes","author":"PG Szab\u00f3","year":"2007","unstructured":"Szab\u00f3, P. G., Mark\u00f3t, M. C., Csendes, T., Specht, E., Casado, L. G., & Garc\u00eda, I. (2007). New approaches to circle packing in a square. With program codes. Berlin: Springer."},{"issue":"2","key":"1869_CR27","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1162\/002409403321554215","volume":"36","author":"T Tarnai","year":"2003","unstructured":"Tarnai, T., & Miyazaki, K. (2003). Circle packings and the sacred lotus. Leonardo, 36(2), 145\u2013150.","journal-title":"Leonardo"},{"issue":"2","key":"1869_CR28","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1016\/j.ijpe.2013.04.009","volume":"145","author":"FMB Toledo","year":"2013","unstructured":"Toledo, F. M. B., Carravilla, M. A., Ribeiro, C., Oliveira, J. F., & Gomes, A. M. (2013). The dotted-board model: A new MIP model for nesting irregular shapes. International Journal of Production Economics, 145(2), 478\u2013487.","journal-title":"International Journal of Production Economics"},{"issue":"3","key":"1869_CR29","doi-asserted-by":"publisher","first-page":"1109","DOI":"10.1016\/j.ejor.2005.12.047","volume":"183","author":"G W\u00e4scher","year":"2007","unstructured":"W\u00e4scher, G., Hau\u00dfner, H., & Schumann, H. (2007). An improved typology of cutting and packing problems. European Journal of Operational Research, 183(3), 1109\u20131130.","journal-title":"European Journal of Operational Research"},{"key":"1869_CR30","first-page":"165","volume":"2","author":"R Zhao","year":"2007","unstructured":"Zhao, R., & Tang, W. (2007). Monkey algorithm for global numerical optimization monkey algorithm for global numerical optimization. Journal of Uncertain Systems, 2, 165\u2013176. (February).","journal-title":"Journal of Uncertain Systems"},{"key":"1869_CR31","doi-asserted-by":"publisher","first-page":"817","DOI":"10.1016\/j.asoc.2015.10.043","volume":"38","author":"Y Zhou","year":"2016","unstructured":"Zhou, Y., Chen, X., & Zhou, G. (2016). An improved monkey algorithm for a 0\/1 knapsack problem. Applied Soft Computing, 38, 817\u2013830.","journal-title":"Applied Soft Computing"}],"container-title":["Wireless Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11276-018-1869-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11276-018-1869-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11276-018-1869-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,12]],"date-time":"2021-05-12T12:14:47Z","timestamp":1620821687000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11276-018-1869-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,13]]},"references-count":31,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2020,10]]}},"alternative-id":["1869"],"URL":"https:\/\/doi.org\/10.1007\/s11276-018-1869-y","relation":{},"ISSN":["1022-0038","1572-8196"],"issn-type":[{"value":"1022-0038","type":"print"},{"value":"1572-8196","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,11,13]]},"assertion":[{"value":"13 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}