{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T12:00:36Z","timestamp":1747224036177,"version":"3.40.5"},"reference-count":29,"publisher":"IGI Global","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,7,1]]},"abstract":"<p>The problem of packing non-congruent circles within bounded regions is considered. The aim is to maximize the number of circles placed into a rectangular container or minimize the waste. The circle is considered as a set of points that are all the same distance (not necessarily Euclidean) from a given point. An integer programming model is proposed using a dotted-board approximating the container and considering the dots as potential positions for assigning centers of the circles. The packing problem is then stated as a large scale linear 0\u20131 optimization problem. Binary decision variables are associated with each discrete point of the board (a dot) and with each object. Then, the same grid is used to prove a population-based metaheuristic. This metaheuristic is inspired by the monkeys' behavior. The resulting binary problem is then solved by using Gurobi Solver and Python Programming Language as Interface<\/p>","DOI":"10.4018\/ijamc.2020070106","type":"journal-article","created":{"date-parts":[[2020,3,20]],"date-time":"2020-03-20T17:17:39Z","timestamp":1584724659000},"page":"108-119","source":"Crossref","is-referenced-by-count":0,"title":["A Metaheuristic Approach and Mathematical Programming for Packing Objects in a Rectangular Container"],"prefix":"10.4018","volume":"11","author":[{"given":"Rafael","family":"Torres-Escobar","sequence":"first","affiliation":[{"name":"Universidad Anahuac, Campus Norte, Facultad de Ingenier\u00eda, Naucalpan de Ju\u00e1rez, Mexico"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8539-9828","authenticated-orcid":true,"given":"Jose Antonio","family":"Marmolejo-Saucedo","sequence":"additional","affiliation":[{"name":"Universidad Panamericana, Facultad de Ingenier\u00eda, Ciudad de Mexico, Mexico"}]},{"given":"Igor","family":"Litvinchev","sequence":"additional","affiliation":[{"name":"Universidad Autonoma de Nuevo Leon, San Nicol\u00e1s de los Garza, Mexico"}]}],"member":"2432","reference":[{"key":"IJAMC.2020070106-0","doi-asserted-by":"crossref","first-page":"1917","DOI":"10.1057\/jors.2010.157","article-title":"Packing circles in the smallest circle: An adaptive hybrid algorithm.","volume":"62","author":"I.Al-Mudahka","year":"2011","journal-title":"The Journal of the Operational Research Society"},{"key":"IJAMC.2020070106-1","doi-asserted-by":"crossref","unstructured":"Beasley, J. E. (1985). An exact two-dimensional non-guillotine cutting tree search procedure.Operations Research, 33(1), 49\u201364.","DOI":"10.1287\/opre.33.1.49"},{"key":"IJAMC.2020070106-2","doi-asserted-by":"publisher","DOI":"10.1007\/978-4-431-55342-7_3"},{"key":"IJAMC.2020070106-3","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2007.01.054"},{"key":"IJAMC.2020070106-4","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-012-9865-8"},{"key":"IJAMC.2020070106-5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-05005-8"},{"key":"IJAMC.2020070106-6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-18899-7"},{"key":"IJAMC.2020070106-7","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-015-1603-y"},{"key":"IJAMC.2020070106-8","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2013.04.050"},{"key":"IJAMC.2020070106-9","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1996.139"},{"key":"IJAMC.2020070106-10","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(95)00032-L"},{"key":"IJAMC.2020070106-11","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-012-9948-6"},{"key":"IJAMC.2020070106-12","doi-asserted-by":"publisher","DOI":"10.1007\/s10711-009-9433-7"},{"key":"IJAMC.2020070106-13","article-title":"A literature review on circle and sphere packing problems: Models and methodologies.","author":"M.Hifi","year":"2009","journal-title":"Advances in Operations Research"},{"key":"IJAMC.2020070106-14","doi-asserted-by":"publisher","DOI":"10.1007\/BF02916995"},{"key":"IJAMC.2020070106-15","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-011-4270-3"},{"journal-title":"Complexity of packing, covering and partitioning problems. Econometric Institute","year":"1979","author":"J. K.Lenstra","key":"IJAMC.2020070106-16"},{"key":"IJAMC.2020070106-17","doi-asserted-by":"publisher","DOI":"10.1007\/s41095-015-0003-7"},{"key":"IJAMC.2020070106-18","doi-asserted-by":"publisher","DOI":"10.1134\/S1064230715020070"},{"key":"IJAMC.2020070106-19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1155\/2014\/317697","article-title":"Integer Programming Formulations for Approximate Packing Circles in a Rectangular Container.","author":"I.Litvinchev","year":"2014","journal-title":"Mathematical Problems in Engineering"},{"key":"IJAMC.2020070106-20","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2011.04.024"},{"key":"IJAMC.2020070106-21","doi-asserted-by":"publisher","DOI":"10.1057\/jors.2012.128"},{"key":"IJAMC.2020070106-22","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 - Esa 2014, 8737, 713\u2013724","DOI":"10.1007\/978-3-662-44777-2_59"},{"journal-title":"New approaches to circle packing in a square. With program codes","year":"2007","author":"P. G.Szab\u00f3","key":"IJAMC.2020070106-23"},{"key":"IJAMC.2020070106-24","doi-asserted-by":"publisher","DOI":"10.1162\/002409403321554215"},{"key":"IJAMC.2020070106-25","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijpe.2013.04.009"},{"key":"IJAMC.2020070106-26","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.12.047"},{"issue":"3","key":"IJAMC.2020070106-27","first-page":"165","article-title":"Monkey algorithm for global numerical optimization Monkey Algorithm for Global Numerical Optimization","volume":"2","author":"R.Zhao","year":"2007","journal-title":"Journal of Uncertain Systems"},{"key":"IJAMC.2020070106-28","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2015.10.043"}],"container-title":["International Journal of Applied Metaheuristic Computing"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=251841","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,7]],"date-time":"2022-05-07T00:02:49Z","timestamp":1651881769000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/IJAMC.2020070106"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2020,7,1]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,7]]}},"URL":"https:\/\/doi.org\/10.4018\/ijamc.2020070106","relation":{},"ISSN":["1947-8283","1947-8291"],"issn-type":[{"type":"print","value":"1947-8283"},{"type":"electronic","value":"1947-8291"}],"subject":[],"published":{"date-parts":[[2020,7,1]]}}}