An effective solution for a real cutting stock problem in manufacturing plastic rolls
نویسندگان
چکیده
منابع مشابه
An effective solution for a real cutting stock problem in manufacturing plastic rolls
We confront a practical cutting stock problem from a production plant of plastic rolls. The problem is a variant of the well-known one dimensional cutting stock, with particular constraints and optimization criteria defined by the experts of the company. We start by giving a problem formulation in which optimization criteria have been considered in linear hierarchy according to expert preferenc...
متن کاملAn ACO algorithm for one-dimensional cutting stock problem
The one-dimensional cutting stock problem, has so many applications in lots of industrial processes and during the past few years has attracted so many researchers’ attention all over the world. In this paper a meta-heuristic method based on ACO is presented to solve this problem. In this algorithm, based on designed probabilistic laws, artificial ants do select various cuts and then select the...
متن کاملA Genetic Solution for the Cutting Stock Problem
The cutting stock problem it is of great interest in relation with several real world problems. Basically it means that there are some smaller pieces that have to be cut from a greater stock piece, in such a way, that the remaining part of the stock piece should be minimal. The classical solution methods of this problem generally need a great amount of calculation. In order to reduce the comput...
متن کاملA Near-optimal Solution to a Two-dimensional Cutting Stock Problem a Near-optimal Solution to a Two-dimensional Cutting Stock Problem a Near-optimal Solution to a Two-dimensional Cutting Stock Problem
We present an asymptotic fully polynomial approximation scheme for strip-packing, or packing rectangles into a rectangle of xed width and minimum height, a classical NP-hard cutting-stock problem. The algorithm nds a packing of n rectangles whose total height is within a factor of (1 +) of optimal (up to an additive term), and has running time polynomial both in n and in 1==. It is based on a r...
متن کاملan aco algorithm for one-dimensional cutting stock problem
the one-dimensional cutting stock problem, has so many applications in lots of industrial processes and during the past few years has attracted so many researchers’ attention all over the world. in this paper a meta-heuristic method based on aco is presented to solve this problem. in this algorithm, based on designed probabilistic laws, artificial ants do select various cuts and then select the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Operations Research
سال: 2008
ISSN: 0254-5330,1572-9338
DOI: 10.1007/s10479-008-0407-1