2,137 research outputs found
2D multi-objective placement algorithm for free-form components
This article presents a generic method to solve 2D multi-objective placement
problem for free-form components. The proposed method is a relaxed placement
technique combined with an hybrid algorithm based on a genetic algorithm and a
separation algorithm. The genetic algorithm is used as a global optimizer and
is in charge of efficiently exploring the search space. The separation
algorithm is used to legalize solutions proposed by the global optimizer, so
that placement constraints are satisfied. A test case illustrates the
application of the proposed method. Extensions for solving the 3D problem are
given at the end of the article.Comment: ASME 2009 International Design Engineering Technical Conferences &
Computers and Information in Engineering Conference, San Diego : United
States (2009
Moldable Items Packing Optimization
This research has led to the development of two mathematical models to optimize the problem of packing a hybrid mix of rigid and moldable items within a three-dimensional volume. These two developed packing models characterize moldable items from two perspectives: (1) when limited discrete configurations represent the moldable items and (2) when all continuous configurations are available to the model. This optimization scheme is a component of a lean effort that attempts to reduce the lead-time associated with the implementation of dynamic product modifications that imply packing changes.
To test the developed models, they are applied to the dynamic packing changes of Meals, Ready-to-Eat (MREs) at two different levels: packing MRE food items in the menu bags and packing menu bags in the boxes. These models optimize the packing volume utilization and provide information for MRE assemblers, enabling them to preplan for packing changes in a short lead-time. The optimization results are validated by running the solutions multiple times to access the consistency of solutions. Autodesk Inventor helps visualize the solutions to communicate the optimized packing solutions with the MRE assemblers for training purposes
Container Loading Problems: A State-of-the-Art Review
Container loading is a pivotal function for operating supply chains efficiently. Underperformance results in unnecessary costs (e.g. cost of additional containers to be shipped) and in an unsatisfactory customer service (e.g. violation of deadlines agreed to or set by clients). Thus, it is not surprising that container loading problems have been dealt with frequently in the operations research literature. It has been claimed though that the proposed approaches are of limited practical value since they do not pay enough attention to constraints encountered in practice.In this paper, a review of the state-of-the-art in the field of container loading will be given. We will identify factors which - from a practical point of view - need to be considered when dealing with container loading problems and we will analyze whether and how these factors are represented in methods for the solution of such problems. Modeling approaches, as well as exact and heuristic algorithms will be reviewed. This will allow for assessing the practical relevance of the research which has been carried out in the field. We will also mention several issues which have not been dealt with satisfactorily so far and give an outlook on future research opportunities
Recommended from our members
3D packing of balls in different containers by VNS
This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel UniversityIn real world applications such as the transporting of goods products, packing is
a major issue. Goods products need to be packed such that the smallest space is
wasted to achieve the maximum transportation efficiency. Packing becomes more challenging and complex when the product is circular/spherical. This thesis focuses
on the best way to pack three-dimensional unit spheres into the smallest spherical and cubical space. Unit spheres are considered in lieu of non-identical spheres because the search mechanisms are more difficult in the latter set up and any improvements will be due to the search mechanism not to the ordering of the spheres. The two-unit sphere packing problems are solved by approximately using a variable neighborhood search (VNS) hybrid heuristic. A general search framework belonging to the Artificial Intelligence domain, the VNS offers a diversification of the search space by changing neighborhood structures and intensification by thoroughly investigating each neighborhood. It is exible, easy to implement, adaptable to both continuous and discrete optimization problems and has been use to solve a variety of problems including large-sized real-life problems. Its runtime is usually lower than other meta heuristic techniques. A tutorial on the VNS and its variants along with recent applications and areas of applicability of each variant. Subsequently, this thesis considers several variations of VNS heuristics for the two problems at hand, discusses their individual efficiencies and effectiveness, their convergence rates and studies their robustness. It highlights the importance of the hybridization which yields near global optima with high precision and accuracy, improving many best- known solutions indicate matching some, and improving the precision and accuracy of others. Keywords: variable neighborhood search, sphere packing, three-dimensional packing, meta heuristic, hybrid heuristics, multiple start heuristics
Acoustical properties of double porosity granular materials
Granular materials have been conventionally used for acoustic treatment due to their sound absorptive
and sound insulating properties. An emerging field is the study of the acoustical properties of
multiscale porous materials. An example of these is a granular material in which the particles are
porous. In this paper, analytical and hybrid analytical-numerical models describing the acoustical
properties of these materials are introduced. Image processing techniques have been employed to
estimate characteristic dimensions of the materials. The model predictions are compared with measurements
on expanded perlite and activated carbon showing satisfactory agreement. It is concluded
that a double porosity granular material exhibits greater low-frequency sound absorption at reduced
weight compared to a solid-grain granular material with similar mesoscopic characteristics
An Encoder-Decoder Approach for Packing Circles
The problem of packing smaller objects within a larger object has been of
interest since decades. In these problems, in addition to the requirement that
the smaller objects must lie completely inside the larger objects, they are
expected to not overlap or have minimum overlap with each other. Due to this,
the problem of packing turns out to be a non-convex problem, obtaining whose
optimal solution is challenging. As such, several heuristic approaches have
been used for obtaining sub-optimal solutions in general, and provably optimal
solutions for some special instances. In this paper, we propose a novel
encoder-decoder architecture consisting of an encoder block, a perturbation
block and a decoder block, for packing identical circles within a larger
circle. In our approach, the encoder takes the index of a circle to be packed
as an input and outputs its center through a normalization layer, the
perturbation layer adds controlled perturbations to the center, ensuring that
it does not deviate beyond the radius of the smaller circle to be packed, and
the decoder takes the perturbed center as input and estimates the index of the
intended circle for packing. We parameterize the encoder and decoder by a
neural network and optimize it to reduce an error between the decoder's
estimated index and the actual index of the circle provided as input to the
encoder. The proposed approach can be generalized to pack objects of higher
dimensions and different shapes by carefully choosing normalization and
perturbation layers. The approach gives a sub-optimal solution and is able to
pack smaller objects within a larger object with competitive performance with
respect to classical methods
Recommended from our members
Formulation space search for two-dimensional packing problems
This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.The two-dimension packing problem is concerned with the arrangement of items without overlaps inside a container. In particular we have considered the case when the items are circular objects, some of the general examples that can be found in the industry are related with packing, storing and transportation of circular objects. Although there are several approaches we want to investigate the use of formulation space search. Formulation space search is a fairly recent method that provides an easy way to escape from local optima for non-linear problems allowing to achieve better results. Despite the fact that it has been implemented to solve the packing problem with identical circles, we present an improved implementation of the formulation space search that gives better results for the case of identical and non-identical circles, also considering that they are packed inside different shaped containers, for which we provide the needed modifications for an appropriate implementation. The containers considered are: the unit circle, the unit square, two rectangles with different dimension (length 5, width 1 and length 10 width 1), a right-isosceles triangle, a semicircle and a right-circular quadrant. Results from the tests conducted shown several improvements over the best previously known for the case of identical circles inside three different containers: a right-isosceles triangle, a semicircle and a circular quadrant. In order to extend the scope of the formulation space search approach we used it to solve mixed-integer non-linear problems, in particular those with zero-one variables. Our findings suggest that our implementation provides a competitive way to solve these kind of problems.This study was funded by the Mexican National Council for Science and Technology
(CONACyT)
Numerical simulations of granular dynamics II: Particle dynamics in a shaken granular material
Surfaces of planets and small bodies of our Solar System are often covered by a layer of granular material that can range from a fine regolith to a gravel-like structure of varying depths. Therefore, the dynamics of granular materials are involved in many events occurring during planetary and small-body evolution thus contributing to their geological properties.
We demonstrate that the new adaptation of the parallel N-body hard-sphere code pkdgrav has the capability to model accurately the key features of the collective motion of bidisperse granular materials in a dense regime as a result of shaking. As a stringent test of the numerical code we investigate the complex collective ordering and motion of granular material by direct comparison with laboratory experiments. We demonstrate that, as experimentally observed, the scale of the collective motion increases with increasing small-particle additive concentration.
We then extend our investigations to assess how self-gravity and external gravity affect collective motion. In our reduced-gravity simulations both the gravitational conditions and the frequency of the vibrations roughly match the conditions on asteroids subjected to seismic shaking, though real regolith is likely to be much more heterogeneous and less ordered than in our idealised simulations. We also show that collective motion can occur in a granular material under a wide range of inter-particle gravity conditions and in the absence of an external gravitational field. These investigations demonstrate the great interest of being able to simulate conditions that are to relevant planetary science yet unreachable by Earth-based laboratory experiments
Interstitial-Scale Modeling of Packed-Bed Reactors
Packed-beds are common to adsorption scrubbers, packed bed reactors, and trickle-bed reactors widely used across the petroleum, petrochemical, and chemical industries. The micro structure of these packed beds is generally very complex and has tremendous influence on heat, mass, and momentum transport phenomena on the micro and macro length scales within the bed. On a reactor scale, bed geometry strongly influences overall pressure drop, residence time distribution, and conversion of species through domain-fluid interactions. On the interstitial scale, particle boundary layer formation, fluid to particle mass transfer, and local mixing are controlled by turbulence and dissipation existing around packed particles. In the present research, a CFD model is developed using OpenFOAM: www.openfoam.org) to directly resolve momentum and scalar transport in both laminar and turbulent flow-fields, where the interstitial velocity field is resolved using the Navier-Stokes equations: i.e. no pseudo-continuum based assumptions. A discussion detailing the process of generating the complex domain using a Monte-Carlo packing algorithm is provided, along with relevant details required to generate an arbitrary polyhedral mesh describing the packed-bed. Lastly, an algorithm coupling OpenFOAM with a linear system solver using the graphics processing unit: GPU) computing paradigm was developed and will be discussed in detail
- …