A Combination of a Greedy Algorithm and Genetics Algorithms to Optimize the Production of Corrugated Board
DOI:
https://doi.org/10.46661/revmetodoscuanteconempresa.2130Keywords:
Industria cartonera, cajas de cartón, algoritmos genéticos, SPP-CP, corrugator manufacturing, cardboard boxes, genetic algorithmsAbstract
In this paper, we suggest a genetic algorithm for optimizing the continuous cutting of cardboard plates, a common problem in the corrugated industry, where minimizing wastage of raw materials and meeting production deadlines are two priority objectives of production planning.
The solutions provided by a greedy algorithm are used as seeds for the genetic algorithm. It uses the one-point crossover operator.
Downloads
References
Álvarez-Valdés, R.; Parreño F.; Tamarit J.M. “Reactive GRASP for the strip-packing problem”, Computers & Operations Research, vol.35, nº4. pp.1065–1083, 2008.
Amadeh, A.; Hellström, D. “The problem of corrugator sequencing and its impact on packaging processes”, 2008: http://www.lu.se/o.o.i.s?id=12683&postid=1300725
Bortfeldt, A. “A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces”, European Journal of Operational Research, vol.172, nº4, pp.814–837, 2006.
De la Fuente García, D.; Gómez Gómez, A. “Resolución de problemas de corte de piezas rectangulares mediante algoritmos genéticos”, En: La gestión de la diversidad: XIII Congreso Nacional, IX Congreso Hispano-Francés, Logroño (La Rioja), 16-18 junio 1999 (coord. Juan Carlos Ayala Calvo), vol.1, 1999, pp.1299–1306, 1999.
Holland, J. H. “Adaptation in Natural and Articial Systems”, Ann Arbor: The University of Michigan Press, 1975.
Jaramillo, J.D.; Correa, F.J. “Programación lineal y algoritmos genéticos para la solución del problema de corte”, enviado a revisión a la Revista Colombiana de Computación, 2008: http://ingenieria-matematica.eafit.edu.co/biblioteca/practicas_investigativas/prac_inv_programacion_lineal_ag_corte.pdf
Jaramillo, J.D.; Correa, F.J.; Jaramillo, R. “Desarrollo de un método basado en algoritmos genéticos y programación lineal para la solución de un problema de corte unidimensional”, enviado a revisión a la Revista de Ingeniería de la Universidad Eafit, 2009: http://serverlab.unab.edu.co:8080/wikimedia/memorias/shortpapers/161.pdf
Kureichik V.M.; Miagkikh V.V.; Topchy A.P. “Genetic Algorithm for Solution of the Traveling Salesman Problem with New Features against Premature Convergence”, TSURE Journal of Engineering, nº3, 1997.
Lodi, A.; Martello, S.; Monaci, M. “Two-dimensional packing problems: A survey”, European Journal of Operational Research, vol.141, nº2, pp.241–252, 2002.
Martello, S.; Monaci, M.; Vigo, D. “An exact approach to the strip packing problem”, Technical Paper OR/00/18, Dipartamento di Elettronica, Informatica e Sistemica,Università di Bologna, 2000.
Rinaldi, F.; Franz, A. “A two-dimensional strip cutting problem with sequencing constraint”, European Journal of Operational Research, vol.183, nº3, pp.1371–1384, 2007.
Velásquez, G.A.; Bellini, G.; Paternina-Arboleda, C. “A multi-objective approach based on soft computing techniques for production scheduling in corrugator manufacturing plants”, Ingeniería y Desarrollo 2007, (enero-junio): http://redalyc.uaemex.mx/redalyc/src/inicio/ArtPdfRed.jsp?iCve=85202106
Vuk, D. “An Approach to the Guillotine Strip Packing Problem”, 2008: http://www.ceciis.foi.hr/app/index.php/ceciis/2008/paper/view/97/69
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2009 Revista de Métodos Cuantitativos para la Economía y la Empresa
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
Submission of manuscripts implies that the work described has not been published before (except in the form of an abstract or as part of thesis), that it is not under consideration for publication elsewhere and that, in case of acceptance, the authors agree to automatic transfer of the copyright to the Journal for its publication and dissemination. Authors retain the authors' right to use and share the article according to a personal or instutional use or scholarly sharing purposes; in addition, they retain patent, trademark and other intellectual property rights (including research data).
All the articles are published in the Journal under the Creative Commons license CC-BY-SA (Attribution-ShareAlike). It is allowed a commercial use of the work (always including the author attribution) and other derivative works, which must be released under the same license as the original work.
Up to Volume 21, this Journal has been licensing the articles under the Creative Commons license CC-BY-SA 3.0 ES. Starting from Volume 22, the Creative Commons license CC-BY-SA 4.0 is used.
