نتایج جستجو برای: cutting stock problem
تعداد نتایج: 995311 فیلتر نتایج به سال:
In this paper, we deal with a column generation based algorithm for the classical cutting stock problem. This algorithm is known to have convergence issues, which are addressed in this paper. Our methods are based on the fact that there are interesting characterizations of the structure of the dual problem, and that a large number of dual solutions are known. First we describe methods based on ...
The modified integer round-up property (MIRUP) for a linear integer minimization problem means that the optimal value of this problem is not greater than the optimal value of the corresponding LP relaxation rounded up plus one. In earlier papers the MIRUP was shown to hold for the so-called divisible case and some other subproblems of the one-dimensional cutting stock problem. In this paper we ...
This work introduces a set of important improvements in the resolution of the Two Dimensional Cutting Stock Problem. It presents a new heuristic enhancing existing ones, an original upper bound that lowers the upper bounds in the literature, and a parallel algorithm for distributed memory machines that achieves linear speedup. Many components of the algorithm are generic and can be ported to pa...
This paper presents a new variant of the A class algorithms for solving the known one dimensional cutting stock problem in a card board factory where the objective is to minimise the useless remaining of a continuous cardboard surface The algorithm limits the number of nodes in the tree search by using a bound criterion based on the prob lem restrictions The process of computing the solution is...
The modi ed integer round-up property (MIRUP) for a linear integer minimization problem means that the optimal value of this problem is not greater than the optimal value of the corresponding LP relaxation rounded up plus one. In earlier papers the MIRUP was shown to hold for the so-called divisible case and some other subproblems of the one-dimensional cutting stock problem. In this paper we e...
This paper presents a new best-fit heuristic for the two-dimensional rectangular stock-cutting problem and demonstrates its effectiveness by comparing it against other published approaches. A placement algorithm usually takes a list of shapes, sorted by some property such as increasing height or decreasing area, and then applies a placement rule to each of these shapes in turn. The proposed met...
The MIRUP (Modified Integer Round-Up Property) leads to an upper bound for the gap between the optimal value of the integer problem and that of the corresponding continuous relaxation rounded up. This property is known to hold for many instances of the one-dimensional cutting stock problem but there are not known so far any results with respect to the two-dimensional case. In this paper we inve...
The MIRUP (Modiied Integer RoundUp Property) leads to an upper bound for the gap between the optimal value of the integer problem and that of the corresponding continuous relaxation rounded up. This property is known to hold for many instances of the one-dimensional cutting stock problem but there are not known so far any results with respect to the two-dimensional case. In this paper we invest...
We describe an exact model for the two-dimensional Cutting Stock Problem with two stages and the guillotine constraint. It is a linear programming arc-flow model, formulated as a minimum flow problem, which is an extension of a model proposed by Valério de Carvalho for the one dimensional case. In this paper, we explore how this model behaves when it is solved with a commercial software, explic...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید