Multicast packing problem: abordagem multiobjetivo

This work presents a algorithmic study of Multicast Packing Problem considering a multiobjective approach. The first step realized was an extensive review about the problem. This review serverd as a reference point for the definition of the multiobjective mathematical model. Then, the instances used in the experimentation process were defined, this instances were created based on the main caracteristics from literature. Since both mathematical model and the instances were definined, then several algoritms were created. The algorithms were based on the classical approaches to multiobjective optimization: NSGA2 (3 versions), SPEA2 (3 versions). In addition, the GRASP procedures were adapted to work with multiples objectives, two vesions were created. These algorithms were composed by three recombination operators(C1, C2 e C3), two operator for build solution, a mutation operator and a local search procedure. Finally, a long experimentation process was performed. This process has three stages: the first consisted of adjusting the parameters; the second was perfomed to indentify the best version for each algorithm. After, the best versions for each algorithm were compared in order to identify the best algorithm among all. The algorithms were evaluated based on quality indicators and Hypervolume Multiplicative Epsilon

Boas práticas de fabricação (BPF) aplicadas nas etapas de beneficiamento de um packing house de laranjas: estudo de caso

Pós-graduação em Agronomia (Energia na Agricultura) - FCA

An algorithm for the strip packing problem using collision free region and exact fitting placement

The irregular shape packing problem is approached. The container has a fixed width and an open dimension to be minimized. The proposed algorithm constructively creates the solution using an ordered list of items and a placement heuristic. Simulated annealing is the adopted metaheuristic to solve the optimization problem. A two-level algorithm is used to minimize the open dimension of the container. To ensure feasible layouts, the concept of collision free region is used. A collision free region represents all possible translations for an item to be placed and may be degenerated. For a moving item, the proposed placement heuristic detects the presence of exact fits (when the item is fully constrained by its surroundings) and exact slides (when the item position is constrained in all but one direction). The relevance of these positions is analyzed and a new placement heuristic is proposed. Computational comparisons on benchmark problems show that the proposed algorithm generated highly competitive solutions. Moreover, our algorithm updated some best known results. (C) 2012 Elsevier Ltd. All rights reserved.

Correlation Between Molecular Conformation, Packing, and Dynamics in Oligofluorenes: A Theoretical/Experimental Study

Fluorene-based systems have shown great potential as components in organic electronics and optoelectronics (organic photovoltaics, OPVs, organic light emitting diodes, OLEDs, and organic transistors, OTFTs). These systems have drawn attention primarily because they exhibit strong blue emission associated with relatively good thermal stability. It is well-known that the electronic properties of polymers are directly related to the molecular conformations and chain packing of polymers. Here, we used three oligofluorenes (trimer, pentamer, and heptamer) as model systems to theoretically investigate the conformational properties of fluorene molecules, starting with the identification of preferred conformations. The hybrid exchange correlation functional, OPBE, and ZINDO/S-CI showed that each oligomer exhibits a tendency to adopt a specific chain arrangement, which could be distinguished by comparing their UV/vis electronic absorption and C-13 NMR spectra. This feature was used to identify the preferred conformation of the oligomer chains in chloroform-cast films by comparing experimental and theoretical UV/vis and C-13 NMR spectra. Moreover, the oligomer chain packing and dynamics in the films were studied by DSC and several solid state NMR techniques, which indicated that the phase behavior of the films may be influenced by the tendency that each oligomeric chain has to adopt a given conformation.

Form III-like conformation and Form I-like packing in a chloroform channel solvate of the diuretic drug chlortalidone

Chlortalidone (CTD) is an antihypertensive drug for which only two solid state phases have been structurally elucidated thus far. Here, we have prepared a chloroform solvate thereof, namely, CTD Form IV, and its structure was compared to those of Form I and Form III. Its two conformers exhibit a dual structural feature in relation to the antecedent polymorphs. Both CTD molecules of Form IV adopt a Form III-like conformation, which is featured, if the conformation of CTD Form I is used as a reference, by a rotation of about 90 degrees on the axis of the C-C bond bridging the substituted benzene and isoindolinyl rings. However, CTD Form IV assembles as in the Form I crystal packing despite the different stacking fashion of their centrosymmetric dimers. In contrast to Form I, there is no offset stacking in Form IV, which forces a bend of ca. 24 degrees between the planes passing through the isoindolinyl moieties of two [100]-stacked dimers. Chloroform molecules at a maximum stoichiometry of 0.25 mol per mol of the drug play a stabilizing role in the assembly of Form IV by filling the channels formed on the crystals.

Body packing by rectal insertion of cocaine packets: a case report

Background: Body packing is used for international drug transport, immediate drug concealment during a police searching or introducing drugs inside prisons. Despite the high level of specialization of dealers who have started to manufacture more complex packs, up to 5% of patients could develop intoxication due to pack rupture. Bowel obstruction is another acute complication. Case presentation: A 27-year-old black male patient was sent to the hospital by court order for clinical evaluation and toxicological examination. The patient was conscious, oriented, had good color, normal arterial pressure and heart rate, and no signs of acute intoxication. Abdominal examination revealed discrete pain upon deep palpation and a small mass in the left iliac fossa. A plain abdominal radiograph revealed several oval structures located in the rectum and sigmoid. Fasting and a 50 g dose of activated charcoal every six hours were prescribed. After three days, the patient spontaneously evacuated 28 cocaine packs. Conclusion: Adequate clinical management and prompt identification of potential complications are of fundamental importance in dealing with body packing.

Parallel Layout Construction Algorithm for Irregular Shape Packing Problems

Cutting and packing problems arise in a variety of industries, including garment, wood and shipbuilding. Irregular shape packing is a special case which admits irregular items and is much more complex due to the geometry of items. In order to ensure that items do not overlap and no item from the layout protrudes from the container, the collision free region concept was adopted. It represents all possible translations for a new item to be inserted into a container with already placed items. To construct a feasible layout, collision free region for each item is determined through a sequence of Boolean operations over polygons. In order to improve the speed of the algorithm, a parallel version of the layout construction was proposed and it was applied to a simulated annealing algorithm used to solve bin packing problems. Tests were performed in order to determine the speed improvement of the parallel version over the serial algorithm

Two-Dimensional Bin Packing Problem with Guillotine Restrictions

This thesis, after presenting recent advances obtained for the two-dimensional bin packing problem, focuses on the case where guillotine restrictions are imposed. A mathematical characterization of non-guillotine patterns is provided and the relation between the solution value of the two-dimensional problem with guillotine restrictions and the two-dimensional problem unrestricted is being studied from a worst-case perspective. Finally it presents a new heuristic algorithm, for the two-dimensional problem with guillotine restrictions, based on partial enumeration, and computationally evaluates its performance on a large set of instances from the literature. Computational experiments show that the algorithm is able to produce proven optimal solutions for a large number of problems, and gives a tight approximation of the optimum in the remaining cases.

Packing a trunk : a physically based approach with full motional freedom

Geometric packing problems may be formulated mathematically as constrained optimization problems. But finding a good solution is a challenging task. The more complicated the geometry of the container or the objects to be packed, the more complex the non-penetration constraints become. In this work we propose the use of a physics engine that simulates a system of colliding rigid bodies. It is a tool to resolve interpenetration conflicts and to optimize configurations locally. We develop an efficient and easy-to-implement physics engine that is specialized for collision detection and contact handling. In succession of the development of this engine a number of novel algorithms for distance calculation and intersection volume were designed and imple- mented, which are presented in this work. They are highly specialized to pro- vide fast responses for cuboids and triangles as input geometry whereas the concepts they are based on can easily be extended to other convex shapes. Especially noteworthy in this context is our ε-distance algorithm - a novel application that is not only very robust and fast but also compact in its im- plementation. Several state-of-the-art third party implementations are being presented and we show that our implementations beat them in runtime and robustness. The packing algorithm that lies on top of the physics engine is a Monte Carlo based approach implemented for packing cuboids into a container described by a triangle soup. We give an implementation for the SAE J1100 variant of the trunk packing problem. We compare this implementation to several established approaches and we show that it gives better results in faster time than these existing implementations.