A genetic symbiotic algorithm applied to the one-dimensional cutting stock problem

Golfeto, Rodrigo Rabello; Moretti, Antônio Carlos; Neto, Luiz Leduíno de Salles

doi:10.1590/s0101-74382009000200006

Cited by 26 publications

(24 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Regarding the direct comparison between the two GAs, observe that in Tables 5 and 6 we compare our method, which finds, for each instance, a set of non-dominated solutions, against other methods including the method presented in Golfeto et al (2009a) which finds only one solution for each instance. Referring to the results presented in Table 5, we are comparing our method against Symbio1 which is the best (in terms of saving in waste) single objective method presented in Golfeto et al (2009a). Even comparing with Symbio1, we obtain slightly better results.…”

Section: Randomly Generated Data Setmentioning

confidence: 91%

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

2014

View full text Add to dashboard Cite

ABSTRACT. This paper investigates the one-dimensional cutting stock problem considering two conflicting objective functions: minimization of both the number of objects and the number of different cutting patterns used. A new heuristic method based on the concepts of genetic algorithms is proposed to solve the problem. This heuristic is empirically analyzed by solving randomly generated instances and also practical instances from a chemical-fiber company. The computational results show that the method is efficient and obtains positive results when compared to other methods from the literature.

show abstract

Section: Randomly Generated Data Setmentioning

confidence: 91%

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

2014

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

“…First techniques used only constructive heuristics [3,12,15] or mathematical formulations [6,14]. However, over the last years, many metaheuristics approaches have obtained significant results in several areas [1,8,17,19,20,24,25], including validation and comparison with third-party software like [10]. They are particularly applied to the multi-mode version of RCPSP, where a task can be executed in different ways, using different amount of resources [4,5].…”

Section: Literature Reviewmentioning

confidence: 99%

A hybrid method for a Project Scheduling Problem

Silva

2014

Pesqui. Oper.

View full text Add to dashboard Cite

ABSTRACT. This work deals with a project scheduling problem where the tasks consume resources to be activated, but start to produce them after that. This problem is known as Dynamic Resource-Constrained Project Scheduling Problem (DRCPSP). Three methods were proposed to divide the problem into smaller parts and solve them separately. Each partial solution is obtained by CPLEX optimizer and is used to generate more complete partial solutions. The obtained results show that this hybrid method works very well.

show abstract

A genetic symbiotic algorithm applied to the one-dimensional cutting stock problem

Cited by 26 publications

References 30 publications

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

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

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

A hybrid method for a Project Scheduling Problem

Contact Info

Product

Resources

About