16,313 research outputs found
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)
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
- …