In textile industry, marker planning is one of the main operations in the cutting fabric stage. Marker packing is usually used to maximize cloth exploitation and minimize its waste. In this research, a method is used based on new found meta-heuristic imperialist competitive algorithm (ICA) and Bottom-Left-Fill Algorithm (BLF) to achieve optimal marker packing. Function of the proposed method wa...

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

The present work proposes new heuristics and algorithms for the 3D Cutting and Packing class of problems. Specifically the cutting stock problem and a real-world application from the retail steel distribution industry are addressed. The problem being addressed for the retail steel distribution industry is the retail steel cutting problem, which is how to cut steel in order to satisfy the custom...

There appear to be two versions of the Dual Bin Packing problem in the literature. In addition, one of the versions has a counterpart in the cutting stock literature, known as the Skiving Stock Problem. This paper outlines branch-andprice algorithms for both. We introduce combinatorial upper bounds and well-performing heuristics from the literature in the branch-and-price framework. Extensive c...

We present an exact method, based on an arc-flow formulation with side constraints, for solving bin packing and cutting stock problems — including multi-constraint variants — by simply representing all the patterns in a very compact graph. Our method includes a graph compression algorithm that usually reduces the size of the underlying graph substantially without weakening the model. Our formul...

We undertake an empirical study in which the performance of a good genetic algorithm is tested against some well-known bin packing heuristics on a range of two-dimensional bin packing problems. We restrict our study to problems involving guillotine patterns which are produced using a series of vertical and horizontal edge–to–edge cuts. Many applications of two-dimensional cutting and packing in...