Preprint

A Mathematical Formulation and Reduction of Cutting Stocks Problems in Paper-Mill Industries

Authors:
Preprints and early-stage research may not have been peer reviewed yet.
Preprint

A Mathematical Formulation and Reduction of Cutting Stocks Problems in Paper-Mill Industries

If you want to read the PDF, try requesting it from the authors.

Abstract

The "trim Trim loss issue" (TLP) perhaps uttermost intriguing issues with regards to structure of advancement research It targets to determine the best cutting example of several things of varying lengths from a load of regular size measurable to meet the clients' wants while reducing waste due to trim misfortune. The subsequent numerical pattern is exceptionally nonconvex in nature went with a few imperatives with additional limitations of paired factors. This evades the utilization of straight advancement techniques. In this review work we utilize synergetic differential advancement (SDE) for the arrangement of this sort of issues. Four theoretical yet significant instances of trim misfortune issue emergingare used in the paper industry the test. The exploratory outcomes contrasted and those of different procedures show the capability of the SDE to take care of the issue. This paper includes introduction which explains a complete terminologies related to cutting stock problem, in

No file available

Request Full-text Paper PDF

To read the file of this research,
you can request a copy directly from the authors.

ResearchGate has not been able to resolve any citations for this publication.
Article
Full-text available
The optimization of water management in industrial processes is paramount in diminishing or mitigating, as far as possible, the negative externalities generated by its current use within the linear economy model. This research presents methods for the optimization of wastewater from paper mills which are associated with the new sustainability and circular economy model. In this way, the concept of circular economy was applied to the wastewater treatment from a paper mill, with the objective of recovering the resources contained in this type of effluent. The wastewater treatment plant is based on a biological reactor of activated sludge, and treats a flow of 4868 m3·day−1. This study proposes the development and evaluation of indicators of circular economy applied to wastewater from a paper mill, as well as the assessment of the removal performance of color, total suspended solids (TSS), biochemical oxygen demand on the fifth day (BOD5), and chemical oxygen demand (COD), which are higher than 96% in all cases. Per 1 m3 of wastewater from a paper mill, a volume of 0.9 m3 of potentially reusable water and a recovered sludge mass of 0.7 kg are generated; the latter is reused as a mineral filler during the process itself. In light of this, a multivariable statistical analysis was applied to determine the relationship of the operation variables and indicators of circular economy. In this way, wastewater from the paper mill can be regarded as a technological nutrient, which is partially reintroduced into the production process, enabling the recovery of the water and mineral fillers that it contains.
Article
Full-text available
This paper deals with the study of the stock preparation unit for paper making process in paper plant industry. Stock preparation is conducted to convert the raw stock into finished stock for the paper machine. The stock preparation unit comprises of various sub-systems, including materials feeding, repulping/slushing, defalking, storage and mixing. The mathematical formulation of the problem is done using probabilistic approach, and by considering the exponential distribution of probable failures and repairs. Furthermore, difference differential equations are developed based on Markov birth-death process approach. These equations are further solved by using normalizing conditions for determining the steady state availability of the stock preparation unit. Additionally, the performance of each subsystem of the stock preparation units in a paper plant has been optimized by using genetic algorithm. After that the decision matrices are developed, which provide the diverse availability levels for different combinations of failure and repair rates for all subsystems. The model developed helps in the operations and quantitative of varied maintenance decisions and actions.
Article
Full-text available
We consider a one‐dimensional cutting stock problem in which the material not used in the cutting patterns, if large enough, is kept for use in the future. Moreover, it is assumed that leftovers should not remain in stock for a long time, hence, such leftovers have priority‐in‐use compared to standard objects (objects bought by the industry) in stock. A heuristic procedure is proposed for this problem, and its performance is analyzed by solving randomly generated dynamic instances where successive problems are solved in a time horizon. For each period, new demands arise and a new problem is solved on the basis of the information about the stock of the previous periods (remaining standard objects in the stock) and usable leftovers generated during those previous periods. The computational experiments show that the solutions presented by the proposed heuristic are better than the solutions obtained by other heuristics from the literature.
Article
Full-text available
The “trim loss problem” (TLP) is one of the most challenging problems in context of optimization research. It aims at determining the optimal cutting pattern of a number of items of various lengths from a stock of standard size material to meet the customers’ demands that the wastage due to trim loss is minimized. The resulting mathematical model is highly nonconvex in nature accompanied with several constraints with added restrictions of binary variables. This prevents the application of conventional optimization methods. In this paper we use synergetic differential evolution (SDE) for the solution of this type of problems. Four hypothetical but relevant cases of trim loss problem arising in paper industry are taken for the experiment. The experimental results compared with those of the other techniques show the competence of the SDE to solve the problem.
Article
Full-text available
Cutting and packing problems appear under various names in literature, e.g. cutting stock or trim loss problem, bin or strip packing problem, vehicle, pallet or container loading problem, nesting problem, knapsack problem etc. The paper develops a consistent and systematic approach for a comprehensive typology integrating the various kinds of problems. The typology is founded on the basic logical structure of cutting and packing problems. The purpose is to unify the different use of notions in the literature and to concentrate further research on special types of problems.
Article
Full-text available
In the paper a new approach to the cutting stock (CS) problem as one of the activities in the CS process is proposed. A thorough critical review of the literature is conducted in order to identify the main limitations of the current state of research. The main finding is that the CS problem is treated too narrowly and that the connection of the CS process with other processes in a company, along with a better transfer of information, should be studied. The paper presents a methodology for evaluating CS process renovation benefits. A process flowchart technique is used to compare as-was and as-is states, while simulations are conducted to provide an estimate of the benefits and to compare the costs of trim loss with other production costs. A case study of a company involved in non-ferrous metal and iron retail activities is used to analyse the effects of renovation of the whole CS process that led to a considerable reduction of cutting costs and lead times. A decrease in the variability of the CS process lead time is also noted which can lead to the more standardised fulfillment of customers’ orders. The measurement and reduction of costs can improve the competitiveness of companies that undertake cutting or similar (e.g. packing) operations in production.
Article
Purpose: The main objective of this study is to develop a model for solving the one dimensional cutting stock problem in the wood working industry, and develop a program for its implementation.Design/methodology/approach: This study adopts the pattern oriented approach in the formulation of the cutting stock model. A pattern generation algorithm was developed and coded using Visual basic.NET language. The cutting stock model developed is a Linear Programming (LP) Model constrained by numerous feasible patterns. A LP solver was integrated with the pattern generation algorithm program to develop a one - dimensional cutting stock model application named GB Cutting Stock Program.Findings and Originality/value: Applying the model to a real life optimization problem significantly reduces material waste (off-cuts) and minimizes the total stock used. The result yielded about 30.7% cost savings for company-I when the total stock materials used is compared with the former cutting plan. Also, to evaluate the efficiency of the application, Case I problem was solved using two top commercial 1D-cutting stock software. The results show that the GB program performs better when related results were compared.Research limitations/implications: This study round up the linear programming solution for the number of pattern to cut.Practical implications: From Managerial perspective, implementing optimized cutting plans increases productivity by eliminating calculating errors and drastically reducing operator mistakes. Also, financial benefits that can annually amount to millions in cost savings can be achieved through significant material waste reduction.Originality/value: This paper developed a linear programming one dimensional cutting stock model based on a pattern generation algorithm to minimize waste in the wood working industry. To implement the model, the algorithm was coded using VisualBasic.net and linear programming solver called lpsolvedll (dynamic link library) was integrated to develop a one dimensional cutting stock Program.
Article
In this study, we solve the nonexact two-stage two-dimensional guillotine cutting problem considering usable leftovers, in which stock plates remainders of the cutting patterns (nonused material or trim loss) can be used in the future, if they are large enough to fulfill future demands for items (ordered smaller plates). This cutting problem can be characterized as a residual bin-packing problem because of the possibility of putting back into stock residual pieces, as the trim loss of each cutting/packing pattern does not necessarily represent waste of material depending on its size. Two bilevel mathematical programming models to represent this nonexact two-stage two-dimensional residual bin-packing problem are presented. The models basically consist of cutting/packing the ordered items using a set of plates of minimum cost and, among all possible solutions of minimum cost, choosing one that maximizes the value of the generated usable leftovers. Because of special characteristics of these bilevel models, they can be reformulated as one-level mixed integer programming models. Results of some numerical experiments are presented to show that the models represent appropriately the problem and illustrate their performance.
Article
This new model resolves the non-linearity in the one-dimensional cutting stock problem, between pattern variables and pattern run lengths, by a novel use of 0–1 variables. The model does not require pre-specification of cutting patterns. It explicitly includes practical constraints such as pattern cardinality constraints, minimum run length constraints and sequence related constraints. The resultant MIP is relatively compact and its application to four problem instances using a commercial MIP package is presented.
Article
A wide variety of materials are manufactured in bulk by processes in which the dimensions of the units of production are constrained by the nature of the machinery being used. The assortment problem is that of deciding, given the constraints, what the dimensions of the production units should be. The trim-loss problem is that of formulating a scheme for the cutting of the production units into pieces of the sizes ordered by customers.A variety of methods, both exact and heuristic, have been applied to these problems. This paper presents a taxonomy of the problems and reviews the techniques which have been proposed for their solution.
Article
This work describes a real-world industrial problem of production planning and cutting optimization of reels and sheets, occurring at a Portuguese paper mill. It will focus on a particular module of the global problem, which is concerned with the determination of the width combinations of the items involved in the planning process: the main goal consists in satisfying an order set of reels and sheets that must be cut from master reels. The width combination process will determine the quantity/weight of the master reels to be produced and their cutting patterns, in order to minimize waste, while satisfying production orders.A two-phase approach has been devised, naturally dependent on the technological process involved. Details of the models and solution methods are presented. Moreover some illustrative computational results are included.
Article
The paper deals with the general one-dimensional cutting stock problem (G1D-CSP), where optimization is not limited to a single order. Stock cutting is treated as a permanent business process in a company in which consecutive order sets need to be fulfilled either for production needs or for its customers. Exact demand for future orders is not known in advance. The unutilized and partly utilized stock lengths left after fulfilling current order sets are stored and used later. The goal is the reduction of trim loss and costs over a broader time-span. A new approach is suggested where previously developed method for G1D-CSP is modified. Several practical examples of the cutting process for several consecutive order sets are presented. An extension to a currently used typology for cutting stock problems is proposed.
Article
In the present work, the planning and cutting problem for the corrugated board boxes industries is presented. This problem belongs to the category of the trim-loss problem, which is essential in the paper-converting supply chain management. Bilinear terms in demand and stock constraints, for instance, lead to a non-convex formulation. Two global convex models are formulated and tested. Results obtained in the problem solution are shown. The most efficient model is implemented by means of Java programs and GAMS, a mathematical optimization program. The system is linked to the company ERP (enterprise resource planning) system. Several issues are optimized and improved: waste generation, energy demand, environmental impact and production costs. Paper reel stock management is improved due to more accurate and statistical information obtained by the system. The planning system linked to the ERP connection allows the integration of customers and suppliers increasing the company competitiveness.
Numerical and environmental considerations on a complex industrial mixed integer nonlinear programing (MINLP) problem
"Numerical and environmental considerations on a complex industrial mixed integer nonlinear programing (MINLP) problem," Computers and Chemical Engineering, Volume 23, no.10, 1999, pp.1545-1561.
The one-dimensional cutting stock problem with usable leftovers-A survey
  • Adriana Cristinacherri
  • Marcos Nereuarenales
  • Horacio Hideki Yanasse
  • Kelly Cristina Poldi
  • Andrea Carla Gonclavesvianna
Adriana cristinacherri, Marcos NereuArenales, Horacio Hideki Yanasse, Kelly Cristina Poldi, Andrea Carla GonclavesVianna, "The one-dimensional cutting stock problem with usable leftovers-A survey", European journal of operational research,2013.