A Genetic Algorithm for the One-Dimensional Cutting Stock Problem With Setups

Araújo, Silvio Alexandre de; Poldi, Kelly Cristina; Smith, Jim

doi:10.1590/0101-7438.2014.034.02.0165

Cited by 25 publications

(14 citation statements)

References 40 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Arbib and Marinelli [12] developed an integer linear programming model and heuristic methods in another study where cutting operations were scheduled by taking into consideration the product delivery dates. In the paper of Araujo et al [13], minimization of the number of parts and the number of different cutting patterns were considered, which are two objective functions that are contradictory to each other. A genetic algorithm was developed for the mentioned problem and tested on randomly generated and real data set.…”

Section: Literature Reviewmentioning

confidence: 99%

Simulated Annealing Algorithm and Implementation Software for Fabric Cutting Problem

Eroğlu

Orbak

2020

Tekstil Ve Konfeksiyon

View full text Add to dashboard Cite

The development of loom technology has significantly increased the efficiency of fabric output in the textile industry. Additionally, preventing the occurrence of defects during the manufacturing process on the fabric is not easy. Therefore, after the production is completed, the aim is deciding the cutting location of the product, which has the defect map, to increase the first quality product quantity by considering the customer quality parameters. In this article, a decision support system has been developed to help the inspector in the final stage which will also prevent losses. The utilized algorithm is the Simulated Annealing algorithm, which is well known and rendered good results for different types of problems in the literature. In the study, a sample problem is used to explain the adaptation of the algorithm to the problem, and the design of the experiments is deployed to obtain the best parameter values for the algorithm. Finally, the software, which is prepared to use the algorithm in the real production environment, is introduced and the results of the performance analysis are evaluated. The results demonstrated that the developed software is capable of making high ratio first quality fabric decisions within seconds.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Simulated Annealing Algorithm and Implementation Software for Fabric Cutting Problem

Eroğlu

Orbak

2020

Tekstil Ve Konfeksiyon

View full text Add to dashboard Cite

show abstract

“…Other approaches first optimize a regular objective such as the minimization of the number of objects used or the waste, and next find a solution that minimizes the number of cutting patterns used ( Cui, Zhong, & Yao, 2015;Foerster & Wäscher, 20 0 0;Yanasse & Limeira, 20 06 ). Some papers also consider a multi-objective problem ( de Araujo, Poldi, & Smith, 2014;Golfeto, Moretti, & de Salles Neto, 2009 ). A literature review on the cutting stock problem with setups can be found in Henn and Wäscher (2013) .…”

Section: Decision Variablesmentioning

confidence: 99%

Classification and literature review of integrated lot-sizing and cutting stock problems

Melega

Araújo

Jans

2018

European Journal of Operational Research

View full text Add to dashboard Cite

a b s t r a c tThe aim of this paper is to classify the literature related to the integration between the lot-sizing and cutting stock problem. A deterministic mathematical model, that considers multiple dimensions of integration and comprises several aspects found in practice, is proposed. This model is used as a framework to classify the current literature in this field. The main classification of the literature is organized around two types of integration. In a planning horizon which consists of multiple periods, the inventory provides a link between the periods. This integration across time periods constitutes the first type of integration. The proposed model also considers the production of different types of items at three different levels: objects are fabricated or purchased and next cut into pieces which are then assembled into final products. The integration between these three production levels constitutes the second type of integration. The classification indicates that, even though many papers in the current literature analyze an integrated lot-sizing and cutting stock problem, they vary widely with respect to the level of integration on the time and production level dimensions. Furthermore, our analysis indicates that the current models also consider varying assumptions with respect to the inventory, the production capacities and the setups. Finally, we point out some possible interesting areas for future research. (R. Jans). that might correspond to customer requests, and a decision related to the cutting stock problem is needed. Part of the smaller reels can be cut again into paper sheets, according to some decision related to the lot size for the papers sheets. In the furniture industry, wooden plates are produced or purchased from different suppliers, and a decision about the size of the lots to be produced or purchased from each supplier must be taken. Then, these wooden plates are cut into several wooden parts (in a two-dimensional cutting stock process) to be assembled into the final products. A decision about the size of the lots of final products is also needed, and consequently there are three levels of decisions. Other examples can be found in the fiberglass industry, where fiberglass plates are cut to manufacture printed circuit boards and in the aluminium industry, where aluminium profiles are cut to make several window types. The basic idea of the integrated lot-sizing and cutting stock problem is to consider, simultaneously, the decisions related to both problems so as to capture the interdependency between these decisions in order to obtain a better global solution. Several papers from the literature present computational results showing the benefits of considering an integrated approach instead of taking decisions separately

show abstract

“…Muchos de estos algoritmos se han utilizado para resolver el Problema de patrones de corte, entre los cuales se destaca Tabu Search (TS), Greedy Randomized Adaptive Search Procedure (GRASP) [42] , Algoritmos genéticos [43][44][45][46] y Ant Colony optimization (ACO) [47,48], entre otros algoritmos evolucionarios [2], [2,[49][50][51][52].Según [6] desarrolló una tipología de enfoques de solución teniendo en cuenta el tipo de problema, para lo cual los dividió en dos categorías: orientados a los objetos o ítems, y los orientados a los patrones tal como se muestra en la tabla 2.…”

Section: Metaheurísticasunclassified

El Problema de patrones de corte, clasificación y enfoques/Cutting stock problem, classification and approaches

2017

View full text Add to dashboard Cite

RESUMENEl Problema de patrones es de gran importancia para empresas manufactureras que involucran el proceso de cortar grandes rollos de algún material y pasarlos a rollos más pequeños de diferentes anchos, considerando el efecto que este tienen sobre los inventarios de producto en proceso y materias primas. Una apropiada gestión de este problema no solo genera benéficos económicos, sino que también genera impactos sostenibles, en la medida que busca un equilibrio entre el costo de inventario y los desperdicios del proceso. Conscientes de la importancia de este problema en este trabajo se presenta inicialmente una introducción de lo que significa en complejidad la solución de un problema de este tipo en una empresa. Luego se enuncian sus antecedentes mediante los trabajos más importantes encontrados en la literatura, destacando algunos trabajos colombianos. Posteriormente, se aborda la clasificación del problema y se aportan sugerencias de otros aspectos a tener en cuenta en el problema. Finalmente se enmarcan los cuatro enfoques de solución más comunes dando ideas para investigaciones futura esperando con esto contribuir al desarrollo del tema.Palabras clave: Planeación del inventario; Proceso de cortado; Modelación matemática; Planeación de operaciones; Minimización de desperdicios. El problema de patrones de corte o cutting stock problem. ABSTRACTThe Cutting stock problem is of great importance for manufacturing companies that involving the process of cutting large rolls of some material into small strips of different widths, considering the effect this has on product inventories in process and raw materials. Proper management of this problem not only generates beneficial economic but also generates sustainable impacts, to the extent that seeks a balance between the cost of inventory and process waste. This paper first presents an overview of what complexity means in solving a problem of this type in a company. His background is set out with the most important works in the literature, highlighting some Colombian jobs. Then, we present classification problem and suggestions from other aspects are provided to consider when addressed cutting stock problem. Finally are framed the four most common approaches to solution giving ideas for future research, hoping thereby contribute to the development of the topic.

show abstract

A Genetic Algorithm for the One-Dimensional Cutting Stock Problem With Setups

Cited by 25 publications

References 40 publications

Simulated Annealing Algorithm and Implementation Software for Fabric Cutting Problem

Simulated Annealing Algorithm and Implementation Software for Fabric Cutting Problem

Classification and literature review of integrated lot-sizing and cutting stock problems

El Problema de patrones de corte, clasificación y enfoques/Cutting stock problem, classification and approaches

Contact Info

Product

Resources

About