This paper deals with the classical two-dimensional cutting stock problem, which consists of generating cutting patterns to produce bi rectangular items of sizes (li,wi), i=1,..,m, from rectangular objects of sizes (L,W), so that an objective is optimized, for example, the cost or trim loss. However, to cut the patterns they should be sequenced in such a way as to optimize another objective, fo...

The two-dimensional orthogonal non-guillotine cutting problem (NGCP) appears in many industries (like wood and steel industries) and consists in cutting a rectangular master surface into a number of rectangular pieces, each with a given size and value. The pieces must be cut with their edges always parallel or orthogonal to the edges of the master surface (orthogonal cuts). The objective is to ...

The aim of this study, is to use finite element simulation to achieve the optimal geometry of a broaching tool that creates the lowest tensile stress at the machined surface of the Ti6Al4V alloy. It plays a major role in reducing production costs and improves the surface integrity of the machined parts. The type and amount of residual stress determined by the thermal and mechanical loads transm...

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

Countercurrent immunoelectrophoresis was used to assay bloodmeals to determine the hostspecificity of Anopheles culicifarics species-A and B, collected from areas in Delhi, Uttar piadesh and Bihar. Results indicated the-predominantly zoophagic nature of species A and B with " r.t"tiullv higher degree of anthropophagy for species A. Furth-er, the human blood index was found to be relatei to the ...

A branch-and-cut-and-price algorithm for one-and two-dimensional two-staged cutting (stock) problems

We present an asymptotic fully polynomial approximation scheme for strip-packing, or packing rectangles into a rectangle of xed width and minimum height, a classical NP-hard cutting-stock problem. The algorithm nds a packing of n rectangles whose total height is within a factor of (1 +) of optimal (up to an additive term), and has running time polynomial both in n and in 1==. It is based on a r...