Cutting and packing problems are encountered in many industries, with different industries incorporating different constraints and objectives. The wood-, glassand paper industry are mainly concerned with the cutting of regular figures, whereas in the ship building, textile and leather industry irregular, arbitrary shaped items are to be packed. In this paper two genetic algorithms are described...

For broad-based intracranial aneurysms, both surgical and endovascular treatments are demanding. Flexible metallic stents provide an alternative treatment option for these patients, because they enable coil placement through the stent mesh. Evidence from extracranial arteries indicates that aneurysms may also spontaneously thrombose after stent placement. This case report documents three patien...

The sphere-packing problem is the task of finding an arrangement to achieve the maximum density of identical spheres in a given space. This problem arises in the placement of kernel functions for uniform input space quantisation in machine learning algorithms. One example is the Cerebellar Model Articulation Controller (CMAC), where the problem arises as the placement of overlapping grids. In s...

This research is concentrates on a very interesting work, the bin packing using hybrid genetic approach. The optimal and feasible packing of goods for transportation and distribution to various locations by satisfying the practical constraints are the key points in this project work. As the number of boxes for packing can not be predicted in advance and the boxes may not be of same category alw...

We consider the NP Hard problem of online Bin Packing while requiring that larger (or longer) items be placed below smaller (or shorter) items — we call such a version the LIB version of problems. Bin sizes can be uniform or variable. We provide analytical upper bounds as well as computational results on the asymptotic approximation ratio for the first fit algorithm.

The paper presents a genetic algorithm (GA) for the two-dimensional strip-packing problem (SPP) with rectangular shaped pieces. Both the non-guillotinable SPP and the guillotinable SPP can be tackled. The genetic algorithm has been derived from a GA that was proposed earlier for solving the container-loading problem (CLP) with a single container to be loaded. The characteristic features of the ...

We consider the online scheduling problem of parallel jobs on parallel machines, P |online − list,mj|Cmax. For this problem we present a 6.6623-competitive algorithm. This improves the best known 7-competitive algorithm for this problem. The presented algorithm also applies to the problem where machines are ordered on a line and only adjacent machines can be assigned to a job and, therefore, al...

steaks with slight marbling, even when tenderness was held constant. The following research was conducted to determine sensory differences and consumer value of domestic grain-fed beef steaks compared to steaks from grass-fed beef in Australia and grain-fed beef in Cananda. Procedure Steak Preparation Fresh (unfrozen) Australian grass-fed and Canadian AAA beef strip loins (IMPS #180) were purch...

This research is concentrates on a very interesting work, the bin packing using hybrid genetic approach. The optimal and feasible packing of goods for transportation and distribution to various locations by satisfying the practical constraints are the key points in this project work. As the number of boxes for packing can not be predicted in advance and the boxes may not be of same category alw...