Mostrar el registro sencillo del ítem
dc.contributor.author | D'Amato, Juan P. | es_ES |
dc.contributor.author | Mercado, Matias | es_ES |
dc.contributor.author | Heiling, Alejandro | es_ES |
dc.contributor.author | Cifuentes, Virginia | es_ES |
dc.date.accessioned | 2020-05-18T13:25:53Z | |
dc.date.available | 2020-05-18T13:25:53Z | |
dc.date.issued | 2016-04-06 | |
dc.identifier.issn | 1697-7912 | |
dc.identifier.uri | http://hdl.handle.net/10251/143567 | |
dc.description.abstract | [ES] Se presenta un modelo discreto que resuelve el problema bidimensional de corte y ubicación, generalmente llamado nesting (anidamiento), de gran interés en las industrias textiles. El problema consiste en minimizar el remanente o desperdicio de un material a través de la ordenación de moldes geométricamente irregulares. Como solución se propone un algoritmo heurístico polinomial, flexible porque permite evaluar distintas condiciones y restricciones del problema, y paralelizable en arquitecturas de múltiples núcleos de bajo costo. La metodología propuesta se evaluó con casos de estudio de la literatura del área y se comparan los tiempos de cómputo con una herramienta comercial del sector, obteniéndose muy buenos resultados. Además, se logra una aceleración del procesamiento de hasta 4X con respecto a la versión secuencial. | es_ES |
dc.description.abstract | [EN] In this paper, a discrete model that solves the two-dimensional cutting problem, usually called nesting, of great interest in the textile industries is presented. The problem consists in finding the best position and orientation of irregularly shaped molds on a material without overlapping, in order to minimize the residual or waste. We propose an adaptive heuristic that evaluates various conditions and constraints of the problem, with a polynomial computational complexity that can be accelerated using multi-core architectures. The proposed methodology is evaluated using known cases of the literature of the area and the resolution times are compared with a commercial tool sector, obtaining very good results. Furthermore, it achieves acceleration up to 4X processing respect to its sequential version. | es_ES |
dc.description.sponsorship | Este trabajo ha sido parcialmente financiado por el Consejo Nacional de Investigaciones Científicas y Técnicas (CONICET), Argentina. | es_ES |
dc.language | Español | es_ES |
dc.publisher | Elsevier | es_ES |
dc.relation.ispartof | Revista Iberoamericana de Automática e Informática industrial | es_ES |
dc.rights | Reconocimiento - No comercial - Sin obra derivada (by-nc-nd) | es_ES |
dc.subject | Optimización | es_ES |
dc.subject | Corte | es_ES |
dc.subject | Industria textil | es_ES |
dc.subject | Heurística | es_ES |
dc.subject | Paralelización | es_ES |
dc.subject | Optimization | es_ES |
dc.subject | Nesting | es_ES |
dc.subject | Textile industry | es_ES |
dc.subject | Heuristics | es_ES |
dc.subject | Parallelization | es_ES |
dc.title | Un método de optimización proximal al problema de anidamiento de piezas irregulares utilizando arquitecturas en paralelo | es_ES |
dc.title.alternative | A proximal optimization method to the problem of nesting irregular pieces using parallel architectures | es_ES |
dc.type | Artículo | es_ES |
dc.identifier.doi | 10.1016/j.riai.2016.01.003 | |
dc.rights.accessRights | Abierto | es_ES |
dc.description.bibliographicCitation | D'amato, JP.; Mercado, M.; Heiling, A.; Cifuentes, V. (2016). Un método de optimización proximal al problema de anidamiento de piezas irregulares utilizando arquitecturas en paralelo. Revista Iberoamericana de Automática e Informática industrial. 13(2):220-227. https://doi.org/10.1016/j.riai.2016.01.003 | es_ES |
dc.description.accrualMethod | OJS | es_ES |
dc.relation.publisherversion | https://doi.org/10.1016/j.riai.2016.01.003 | es_ES |
dc.description.upvformatpinicio | 220 | es_ES |
dc.description.upvformatpfin | 227 | es_ES |
dc.type.version | info:eu-repo/semantics/publishedVersion | es_ES |
dc.description.volume | 13 | es_ES |
dc.description.issue | 2 | es_ES |
dc.identifier.eissn | 1697-7920 | |
dc.relation.pasarela | OJS\9301 | es_ES |
dc.contributor.funder | Consejo Nacional de Investigaciones Científicas y Técnicas, Argentina | es_ES |
dc.description.references | Abbasi, J., Sahir, M. Development of Optimal Cutting Plan using Linear Programming Tools and MATLAB Algorithm – Int. J. of Innovation, Management and Technology, Vol. 1, No. 5, pp.483-492, 2010. | es_ES |
dc.description.references | Alba, E., & Tomassini, M. (2002). Parallelism and evolutionary algorithms. IEEE Transactions on Evolutionary Computation, 6(5), 443-462. doi:10.1109/tevc.2002.800880 | es_ES |
dc.description.references | Albano, A. (1977). A method to improve two-dimensional layout. Computer-Aided Design, 9(1), 48-52. doi:10.1016/0010-4485(77)90062-8 | es_ES |
dc.description.references | ASNS - Nesting Software For Optimum Use Of Materials, LLC Technos, 2013. | es_ES |
dc.description.references | Baker, B. S., Coffman, Jr., E. G., & Rivest, R. L. (1980). Orthogonal Packings in Two Dimensions. SIAM Journal on Computing, 9(4), 846-855. doi:10.1137/0209064 | es_ES |
dc.description.references | Chazelle. (1983). The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation. IEEE Transactions on Computers, C-32(8), 697-707. doi:10.1109/tc.1983.1676307 | es_ES |
dc.description.references | Cheng, C. ., Feiring, B. ., & Cheng, T. C. . (1994). The cutting stock problem — a survey. International Journal of Production Economics, 36(3), 291-305. doi:10.1016/0925-5273(94)00045-x | es_ES |
dc.description.references | Cheng, S. K., & Rao, K. P. (2000). Large-scale nesting of irregular patterns using compact neighborhood algorithm. Journal of Materials Processing Technology, 103(1), 135-140. doi:10.1016/s0924-0136(00)00402-7 | es_ES |
dc.description.references | Cui, Y., He, D., & Song, X. (2006). Generating optimal two-section cutting patterns for rectangular blanks. Computers & Operations Research, 33(6), 1505-1520. doi:10.1016/j.cor.2004.09.022 | es_ES |
dc.description.references | Dagli,C. Cutting Stock Problem: Combined Use of Heuristics and Optimization Methods, Recent Developments in Production Research Amsterdam, pp. 500-506, 1988. Dowsland, K.A., Vaid, S., Dowsland, W.B. An Algorithm for Polygon Placement Using a Bottom-left Strategy, European Journal of Operational Research, 141:371-381, 2002. | es_ES |
dc.description.references | Elkeran, A. (2013). A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering. European Journal of Operational Research, 231(3), 757-769. doi:10.1016/j.ejor.2013.06.020 | es_ES |
dc.description.references | Hifi, M. (2001). Computational Optimization and Applications, 18(1), 63-88. doi:10.1023/a:1008743711658 | es_ES |
dc.description.references | Hopper, E., & Turton, B. (1999). A genetic algorithm for a 2D industrial packing problem. Computers & Industrial Engineering, 37(1-2), 375-378. doi:10.1016/s0360-8352(99)00097-2 | es_ES |
dc.description.references | Hopper, E., & Turton, B. C. . (2001). An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem. European Journal of Operational Research, 128(1), 34-57. doi:10.1016/s0377-2217(99)00357-4 | es_ES |
dc.description.references | Jakobs, S. (1996). On genetic algorithms for the packing of polygons. European Journal of Operational Research, 88(1), 165-181. doi:10.1016/0377-2217(94)00166-9 | es_ES |
dc.description.references | Junior, B.A., Pinheiro, P.R., Saraiva, R.D. A Hybrid Methodology for Nesting Irregular Shape: Case Study on a Textile Industry, 6th IFAC Conference on M. and Control of Production and Logistics (Brazil), pp.15-20, 2013. | es_ES |
dc.description.references | Lai, K. K., & Chan, J. W. M. (1997). Developing a simulated annealing algorithm for the cutting stock problem. Computers & Industrial Engineering, 32(1), 115-127. doi:10.1016/s0360-8352(96)00205-7 | es_ES |
dc.description.references | Lee, W.-C., Ma, H., & Cheng, B.-W. (2008). A heuristic for nesting problems of irregular shapes. Computer-Aided Design, 40(5), 625-633. doi:10.1016/j.cad.2008.02.008 | es_ES |
dc.description.references | Lesh, N., Marks, J., McMahon, A., & Mitzenmacher, M. (2005). New heuristic and interactive approaches to 2D rectangular strip packing. ACM Journal of Experimental Algorithmics, 10. doi:10.1145/1064546.1083322 | es_ES |
dc.description.references | Lesh, N., & Mitzenmacher, M. (2006). BubbleSearch: A simple heuristic for improving priority-based greedy algorithms. Information Processing Letters, 97(4), 161-169. doi:10.1016/j.ipl.2005.08.013 | es_ES |
dc.description.references | Liu, D., & Teng, H. (1999). An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles. European Journal of Operational Research, 112(2), 413-420. doi:10.1016/s0377-2217(97)00437-2 | es_ES |
dc.description.references | OFA - Optimizer For Anyshape - Samtec Solutions - Website http://www.samtecsolutions.com/. | es_ES |
dc.description.references | Parada Daza, V., Gómes de Alvarenga, A., & de Diego, J. (1995). Exact solutions for constrained two-dimensional cutting problems. European Journal of Operational Research, 84(3), 633-644. doi:10.1016/0377-2217(95)00028-o | es_ES |
dc.description.references | Rodrigo, W., Daundasekera, W. and Perera A. Pattern Generation for Two Dimensional Cutting Stock Problem - International Journal of Mathematics Trends and Technology, 3(2), pp.54-62, 2012. | es_ES |
dc.description.references | Ross, P., Schulenburg, S., Marín-Blázquez, J.G., & Hart, E. Hyper-heuristics: learning to combine simple heuristics in bin-packing problems. In LNCS. Conference on genetic and evolutionary computation, pp. 942-948, 2002. | es_ES |
dc.description.references | Savio, G., Menneghello, R., Conceri, G. A Heuristic Approach for Nesting of 2D Shapes, in: Proceedings of the 37th Int. MATADOR Conference (Springer), pp.49-53, 2012. | es_ES |
dc.description.references | Siasos, A., & Vosniakos, G.-C. (2014). Optimal directional nesting of planar profiles on fabric bands for composites manufacturing. CIRP Journal of Manufacturing Science and Technology, 7(3), 283-297. doi:10.1016/j.cirpj.2014.06.001 | es_ES |
dc.description.references | Tay, F. E. H., Chong, T. Y., & Lee, F. C. (2002). Pattern nesting on irregular-shaped stock using Genetic Algorithms. Engineering Applications of Artificial Intelligence, 15(6), 551-558. doi:10.1016/s0952-1976(03)00009-5 | es_ES |
dc.description.references | Weng, W.-C., & Kuo, H.-C. (2011). Irregular stock cutting system based on AutoCAD. Advances in Engineering Software, 42(9), 634-643. doi:10.1016/j.advengsoft.2011.04.009 | es_ES |