68 research outputs found
Packing equal circles in a damaged square using simulated annealing and greedy vacancy search.
This thesis defines and investigates a generalized circle packing problem, called Packing Equal Circles into a Damaged Square (PECDS). We introduce a new heuristic algorithm that enhances and combines the Greedy Vacancy Search (GVS) and Stimulated Annealing (SA), and demonstrate, through a series of experiments, its ability to find better solutions than either GVS or SA alone. The synergy between the enhanced GVS and SA, along with explicit convergence detection, makes the algorithm robust in escaping the points of local optimum. --Leaf ii.The original print copy of this thesis may be available here: http://wizard.unbc.ca/record=b200686
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)
Integer Programming Formulations for Approximate Packing Circles in a Rectangular Container
A problem of packing a limited number of unequal circles in a fixed size rectangular container is considered. The aim is to maximize the (weighted) number of circles placed into the container or minimize the waste. This problem has numerous applications in logistics, including production and packing for the textile, apparel, naval, automobile, aerospace, and food industries. Frequently the problem is formulated as a nonconvex continuous optimization problem which is solved by heuristic techniques combined with local search procedures. New formulations are proposed for approximate solution of packing problem. The container is approximated by a regular grid and the nodes of the grid are considered as potential positions for assigning centers of the circles. The packing problem is then stated as a large scale linear 0-1 optimization problem. The binary variables represent the assignment of centers to the nodes of the grid. Nesting circles inside one another is also considered. The resulting binary problem is then solved by commercial software. Numerical results are presented to demonstrate the efficiency of the proposed approach and compared with known results
New and improved results for packing identical unitary radius circles within triangles, rectangles and strips
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.PRONEX-Optimization (PRONEX-CNPq/FAPERJ)[E-26/171.510/2006-APQ1]PRONEX-Optimization (PRONEX - CNPq/FAPERJ)Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)FAPESP[2006/53768-0]FAPESP[2006/57633-1]Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)BZGBZ
Collection of abstracts of the 24th European Workshop on Computational Geometry
International audienceThe 24th European Workshop on Computational Geomety (EuroCG'08) was held at INRIA Nancy - Grand Est & LORIA on March 18-20, 2008. The present collection of abstracts contains the 63 scientific contributions as well as three invited talks presented at the workshop
- …