In this paper, the authors present a hybrid genetic approach for the two-dimensional rectangular guillotine oriented cutting-stock problem. In this method, the genetic algorithm is used to select a set of cutting patterns while the linear programming model permits one to create the lengths to produce with each cutting pattern to fulfil the customer orders with minimal production cost. The effec...

The profitability of forging and stamping plants is directly related to the economical use raw materials. For sheet metal stamping, material losses can account for a significant proportion (up 20-40%), so reducing them even by few percent saves thousands tonnes metal. An indicator utilisation efficiency rationality cutting factor η, defined as ratio weight workpiece rate consumption its product...

Reducing losses in electrical devices is essential for reducing global energy consumption. Losses the core of machines constitute a significant part overall losses—their share increases with number powered by PWM converters, especially high-speed machines. Limiting requires precise determination at design stage device. Achieving this goal possible thanks to numerical or analytical simulation. A...

Dental structures capture, retain and fragment food for ingestion. Gnathostome dentition should be viewed in the context of the prey's material properties. Animal muscle and skin are mechanically tough materials that resist fragmentation unless energy is continually supplied directly to the tip of the fracture by some device such as a blade edge. Despite the variety of bladed tooth morphologies...

The practical problem we are trying to model is: we have to cover a room with a material(carpet or linolleum). This material is in a roll of fixed width. We want to cover the room with a minimum number of pieces and to waste a minimum amount of material. We present in this paper a synthesis of our works. We can easily see that the two criteria, the minimum loss of material and the minimumnumber...

In this paper we present a new parallelization of an efficient best-first branch-and-bound algorithm to solve the constrained two-dimensional single stock guillotine cutting stock problem (CSP) to optimality. The underlying sequential branch-and-bound algorithm is based on an exact version of Wang's heuristic suggested by Viswanathan and Bagchi. In our algorithm we improve the upper bound and i...