A number of optimisation problems involve the optimal grouping of a finite set of items into a number of categories subject to one or more constraints. Such problems raise interesting issues in mapping solutions in genetic algorithms. These problems range from the knapsack problem to bin packing and cutting stock problems. This paper describes research involving cutting stock problems. Results ...

We report on a user-friendly decision support system (DSS) for solving specific cutting stock problem from a smaller wood-processing company. A prototype DSS is developed for use in veneers production and is designed to aid mangers in create or improving existing tailoring of logs using their experience and preference s. The results of testing a typical cutting-stock problem are shown to point ...

We consider the well-known one-dimensional cutting stock problem (1CSP). It is shown that all possible instances of the 1CSP can be divided into a finite number of equivalence classes when the number of items m is fixed. A method for enumerating all these classes is investigated. This method is improved for searching proper non-IRUP instances with minimal number of items. We found the minimal n...

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, we investigate the bi-objective multiperiod one-dimensional cutting stock problem that seeks to minimize cost of production associated with total length cut objects (waste) and inventory costs related items. A mathematical model is presented heuristically solved by a column generation method. Computational tests were performed using Weighted Sum method, ε-Constraint method variat...