This work presents a genetic symbiotic algorithm to minimize the number of objects and the setup in a one-dimensional cutting stock problem. The algorithm implemented can generate combinations of ordered lengths of stock (the cutting pattern) and, at the same time, the frequency of the cutting patterns, through a symbiotic process between two distinct populations, solutions and cutting patterns...

Research addressing two-dimensional irregular shape packing has largely focused on the strip packing variant of the problem. However, it can be argued that this is a simplification. Materials from which pieces are required to be cut will ultimately have a fixed length either due to the physical dimensions of the material or through constraints on the cutting machinery. Hence, in order to cut al...

Efficient cutting design is essential to reduce the costs of production in the open die forging industry. This article discusses a slab cutting design problem that occurs when parallel piped items are cut from raw material steel slabs with varying widths and lengths to meet a volume requirement. The problem is modeled as a two-dimensional cutting stock problem or bin packing problem with size-c...

A cutting stock problem is one of the main and classical problems in operations research that is modeled as Lp < /div> problem. Because of its NP-hard nature, finding an optimal solution in reasonable time is extremely difficult and at least non-economical. In this paper, two meta-heuristic algorithms, namely simulated annealing (SA) and tabu search (TS), are proposed and deve...

This paper considers the one-dimensional cutting stock problem with divisible items, which is a new problem in the cutting stock literature. The problem exists in steel industries. In the new problem, each item can be divided into smaller pieces, then they can be recombined again by welding. The objective is to minimize both the trim loss and the number of the welds. We present a mathematical m...

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...

Cutting Stock Problems (CSP) arise in many production industries where large stock sheets must be cut into smaller pieces. We present a parallel algorithm based on Viswanathan and Bagchi algorithm (VB) solving the Two-Dimensional Cutting Stock Problem (2DCSP). The algorithm guarantees the processing of best nodes first and does not introduce any redundant combinations others than the already pr...

Over a decade ago, the European Journal of Operational Research published its first special issue on Cutting and Packing [1] in conjunction with the founding of SICUP, the Special Interest Group on Cutting and Packing. The majority of the papers in the first special issue were focused on cutting problems in the aluminium, paper, and canvas industry, as well as container loading problems. In 199...

In this paper, two-dimensional cutting stock problem with demand has been studied.In this problem, cutting of large rectangular sheets into specific small pieces should be carried out hence, the waste will be minimized. Solving this problem is important to decrease waste materials in any industry that requires cutting of sheets. In most previus studies, the demand of pieces has not been usually...

In this paper, two-dimensional cutting stock problem with demand has been studied.In this problem, cutting of large rectangular sheets into specific small pieces should be carried out hence, the waste will be minimized. Solving this problem is important to decrease waste materials in any industry that requires cutting of sheets. In most previus studies, the demand of pieces has not been usually...