Set Covering Model in Solving Multiple Cutting Stock Problem
نویسندگان
چکیده
منابع مشابه
Solving the Two-Stage Cutting Stock Problem
I N T R O D U C T I O N In a number of industries, such as paper and film, there is an important class of problems OVER THE past 20 years, a substantial amount that falls in between the well known one and of work has been done on one and two-dimentwo-dimensional problems. These are referred sional cutting stock problems. A number of to here as two-stage cutting stock problems early authors [1, ...
متن کاملSolving a Weighted Set Covering Problem for Improving Algorithms for Cutting Stock Problems with Setup Costs by Solution Merging
There are many different kinds of cutting stock problems (CSPs) occurring in practice and in theory having in common that they ask for a set of patterns, where each pattern is a collection of elements, to satisfy given element demands while minimizing the costs of the patterns. The classical CSP only considers fixed costs for each individual pattern, but in many practical applications an additi...
متن کاملSolving a fuzzy set-covering problem
K e y w o r d s S e t c o v e r i n g problems, Fuzzy sets, Fuzzy set-covering problem, Algebraic sum operator. 1. I N T R O D U C T I O N A classical set-covering problem considers the subsets I = {1, 2 , . . . , m} and J = {1, 2 , . . . , n} of integers. A collection p of subset Pj of I is a cover of I, if the union of the members of go is I, i.e., let Pj C I, go = {Pj : j C J0}, J0 C J, go i...
متن کاملSolving Set Covering Problem with Fireworks Explosion
To solve the Set Covering Problem we will use a metaheuristic Fireworks Algorithm inspired by the fireworks explosion. Through the observation of the way that fireworks explode is much similar to the way that an individual searches the optimal solution in swarm. Fireworks algorithm (FWA) consists of four parts, i.e., the explosion operator, the mutation operator, the mapping rule and selection ...
متن کاملEnumeration Technique for Solving Linear Fractional Fuzzy Set Covering Problem
In this paper an enumeration technique for solving linear fractional fuzzy set covering problem is defined. Set covering problems belong to the class of 0-1 integer programming problems that are NP-complete. Many applications arises having the set covering problems, switching theory, testing of VLSI circuits and line balancing often take on a set covering structure. Linear fractional set coveri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science and Technology Indonesia
سال: 2020
ISSN: 2580-4391,2580-4405
DOI: 10.26554/sti.2020.5.4.121-130