92 resultados para 2D cutting and packing


Relevância:

40.00% 40.00%

Publicador:

Resumo:

Social organization enables leaf-cutting ants to keep appropriate micro-ecological nest conditions for the fungus garden (their main food), eggs, larvae and adults. To maintain stability while facing changing conditions, individual ants must perceive destabilising factors and produce a proper behavioral response. We investigated behavioral responses to experimental dehydration in leaf-cutting ants to verify if task specialization exists, and to quantify the ability of ant sub-colonies for water management. Our setup consisted of fourteen sub-colonies, ten of which were randomly assigned to different levels of experimental dehydration with silica gel, whereas the remaining four were controls. The ten experimental sub-colonies were split into two groups, so that five of them had access to water. Diverse ant morphs searched for water in dehydrated colonies, but mainly a caste of small ants collected water after sources had been discovered. Size specialization for water collection was replicable in shorter experiments with three additional colonies. Ants of dehydrated colonies accumulated leaf-fragments on the nest entrance, and covering the fungus garden. Behaviors that may enhance humidity within the nests were common to all dehydration treatments. Water availability increased the life span of dehydrated colonies.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

The constrained compartmentalized knapsack problem can be seen as an extension of the constrained knapsack problem. However, the items are grouped into different classes so that the overall knapsack has to be divided into compartments, and each compartment is loaded with items from the same class. Moreover, building a compartment incurs a fixed cost and a fixed loss of the capacity in the original knapsack, and the compartments are lower and upper bounded. The objective is to maximize the total value of the items loaded in the overall knapsack minus the cost of the compartments. This problem has been formulated as an integer non-linear program, and in this paper, we reformulate the non-linear model as an integer linear master problem with a large number of variables. Some heuristics based on the solution of the restricted master problem are investigated. A new and more compact integer linear model is also presented, which can be solved by a branch-and-bound commercial solver that found most of the optimal solutions for the constrained compartmentalized knapsack problem. On the other hand, heuristics provide good solutions with low computational effort. (C) 2011 Elsevier BM. All rights reserved.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

This paper deals with the classical one-dimensional integer cutting stock problem, which consists of cutting a set of available stock lengths in order to produce smaller ordered items. This process is carried out in order to optimize a given objective function (e.g., minimizing waste). Our study deals with a case in which there are several stock lengths available in limited quantities. Moreover, we have focused on problems of low demand. Some heuristic methods are proposed in order to obtain an integer solution and compared with others. The heuristic methods are empirically analyzed by solving a set of randomly generated instances and a set of instances from the literature. Concerning the latter. most of the optimal solutions of these instances are known, therefore it was possible to compare the solutions. The proposed methods presented very small objective function value gaps. (C) 2008 Elsevier Ltd. All rights reserved.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

Industrial production processes involving both lot-sizing and cutting stock problems are common in many industrial settings. However, they are usually treated in a separate way, which could lead to costly production plans. In this paper, a coupled mathematical model is formulated and a heuristic method based on Lagrangian relaxation is proposed. Computational results prove its effectiveness. (C) 2009 Elsevier B.V. All rights reserved.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

An important production programming problem arises in paper industries coupling multiple machine scheduling with cutting stocks. Concerning machine scheduling: how can the production of the quantity of large rolls of paper of different types be determined. These rolls are cut to meet demand of items. Scheduling that minimizes setups and production costs may produce rolls which may increase waste in the cutting process. On the other hand, the best number of rolls in the point of view of minimizing waste may lead to high setup costs. In this paper, coupled modeling and heuristic methods are proposed. Computational experiments are presented.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

We investigate the critical behavior of a stochastic lattice model describing a predator-prey system. By means of Monte Carlo procedure we simulate the model defined on a regular square lattice and determine the threshold of species coexistence, that is, the critical phase boundaries related to the transition between an active state, where both species coexist and an absorbing state where one of the species is extinct. A finite size scaling analysis is employed to determine the order parameter, order parameter fluctuations, correlation length and the critical exponents. Our numerical results for the critical exponents agree with those of the directed percolation universality class. We also check the validity of the hyperscaling relation and present the data collapse curves.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

We report on integer and fractional microwave-induced resistance oscillations in a 2D electron system with high density and moderate mobility, and present results of measurements at high microwave intensity and temperature. Fractional microwave-induced resistance oscillations occur up to fractional denominator 8 and are quenched independently of their fractional order. We discuss our results and compare them with existing theoretical models. (C) 2009 Elsevier B.V. All rights reserved.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

A mixed integer continuous nonlinear model and a solution method for the problem of orthogonally packing identical rectangles within an arbitrary convex region are introduced in the present work. The convex region is assumed to be made of an isotropic material in such a way that arbitrary rotations of the items, preserving the orthogonality constraint, are allowed. The solution method is based on a combination of branch and bound and active-set strategies for bound-constrained minimization of smooth functions. Numerical results show the reliability of the presented approach. (C) 2010 Elsevier Ltd. All rights reserved.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

The focus of study in this paper is the class of packing problems. More specifically, it deals with the placement of a set of N circular items of unitary radius inside an object with the aim of minimizing its dimensions. Differently shaped containers are considered, namely circles, squares, rectangles, strips and triangles. By means of the resolution of non-linear equations systems through the Newton-Raphson method, the herein presented algorithm succeeds in improving the accuracy of previous results attained by continuous optimization approaches up to numerical machine precision. The computer implementation and the data sets are available at http://www.ime.usp.br/similar to egbirgin/packing/. (C) 2009 Elsevier Ltd, All rights reserved.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

For a fixed family F of graphs, an F-packing in a graph G is a set of pairwise vertex-disjoint subgraphs of G, each isomorphic to an element of F. Finding an F-packing that maximizes the number of covered edges is a natural generalization of the maximum matching problem, which is just F = {K(2)}. In this paper we provide new approximation algorithms and hardness results for the K(r)-packing problem where K(r) = {K(2), K(3,) . . . , K(r)}. We show that already for r = 3 the K(r)-packing problem is APX-complete, and, in fact, we show that it remains so even for graphs with maximum degree 4. On the positive side, we give an approximation algorithm with approximation ratio at most 2 for every fixed r. For r = 3, 4, 5 we obtain better approximations. For r = 3 we obtain a simple 3/2-approximation, achieving a known ratio that follows from a more involved algorithm of Halldorsson. For r = 4, we obtain a (3/2 + epsilon)-approximation, and for r = 5 we obtain a (25/14 + epsilon)-approximation. (C) 2008 Elsevier B.V. All rights reserved.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

We consider the problems of finding the maximum number of vertex-disjoint triangles (VTP) and edge-disjoint triangles (ETP) in a simple graph. Both problems are NP-hard. The algorithm with the best approximation ratio known so far for these problems has ratio 3/2 + epsilon, a result that follows from a more general algorithm for set packing obtained by Hurkens and Schrijver [On the size of systems of sets every t of which have an SDR, with an application to the worst-case ratio of heuristics for packing problems, SIAM J. Discrete Math. 2(1) (1989) 68-72]. We present improvements on the approximation ratio for restricted cases of VTP and ETP that are known to be APX-hard: we give an approximation algorithm for VTP on graphs with maximum degree 4 with ratio slightly less than 1.2, and for ETP on graphs with maximum degree 5 with ratio 4/3. We also present an exact linear-time algorithm for VTP on the class of indifference graphs. (C) 2007 Elsevier B.V. All rights reserved.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

Cytochrome P450 (CYP450) is a class of enzymes where the substrate identification is particularly important to know. It would help medicinal chemists to design drugs with lower side effects due to drug-drug interactions and to extensive genetic polymorphism. Herein, we discuss the application of the 2D and 3D-similarity searches in identifying reference Structures with higher capacity to retrieve Substrates of three important CYP enzymes (CYP2C9, CYP2D6, and CYP3A4). On the basis of the complementarities of multiple reference structures selected by different similarity search methods, we proposed the fusion of their individual Tanimoto scores into a consensus Tanimoto score (T(consensus)). Using this new score, true positive rates of 63% (CYP2C9) and 81% (CYP2D6) were achieved with false positive rates of 4% for the CYP2C9-CYP2D6 data Set. Extended similarity searches were carried out oil a validation data set, and the results showed that by using the T(consensus) score, not only the area of a ROC graph increased, but also more substrates were recovered at the beginning of a ranked list.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

The present study evaluated the effect of repeated simulated microwave disinfection on physical and mechanical properties of Clássico, Onda-Cryl and QC-20 denture base acrylic resins. Aluminum patterns were included in metallic or plastic flasks with dental stone following the traditional packing method. The powder/liquid mixing ratio was established according to the manufacturer's instructions. After water-bath polymerization at 74ºC for 9 h, boiling water for 20 min or microwave energy at 900 W for 10 min, the specimens were deflasked after flask cooling and finished. Each specimen was immersed in 150 mL of distilled water and underwent 5 disinfection cycles in a microwave oven set at 650 W for 3 min. Non-disinfected and disinfected specimens were subjected to the following tets: Knoop hardness test was performed with 25 g load for 10 s, impact strength test was done using the Charpy system with 40 kpcm, and 3-point bending test (flexural strength) was performed at a crosshead speed of 0.5 mm/min until fracture. Data were analyzed statistically by ANOVA and Tukey's test (α= 0.05%). Repeated simulated microwave disinfections decreased the Knoop hardness of Clássico and Onda-Cryl resins and had no effect on the impact strength of QC-20. The flexural strength was similar for all tested resins.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Multiple cell membrane alterations have been reported to be the cause of various forms of hypertension. The present study focuses on the lipid portion of the membranes, characterizing the microviscosity of membranes reconstituted with lipids extracted from the aorta and mesenteric arteries of spontaneously hypertensive (SHR) and normotensive control rat strains (WKY and NWR). Membrane-incorporated phospholipid spin labels were used to monitor the bilayer structure at different depths. The packing of lipids extracted from both aorta and mesenteric arteries of normotensive and hypertensive rats was similar. Lipid extract analysis showed similar phospholipid composition for all membranes. However, cholesterol content was lower in SHR arteries than in normotensive animal arteries. These findings contrast with the fact that the SHR aorta is hyporeactive while the SHR mesenteric artery is hyperreactive to vasopressor agents when compared to the vessels of normotensive animal strains. Hence, factors other than microviscosity of bulk lipids contribute to the vascular smooth muscle reactivity and hypertension of SHR. The excess cholesterol in the arteries of normotensive animal strains apparently is not dissolved in bulk lipids and is not directly related to vascular reactivity since it is present in both the aorta and mesenteric arteries. The lower cholesterol concentrations in SHR arteries may in fact result from metabolic differences due to the hypertensive state or to genes that co-segregate with those that determine hypertension during the process of strain selection.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

We describe finite sets of points, called sentinels, which allow us to decide if isometric copies of polygons, convex or not, intersect. As an example of the applicability of the concept of sentinel, we explain how they can be used to formulate an algorithm based on the optimization of differentiable models to pack polygons in convex sets. Mathematical subject classification: 90C53, 65K05.