Packing a fixed number of identical circles in a circular container with circular prohibited areas
From MaRDI portal
Publication:2329665
Abstract: In this paper we consider the problem of packing a fixed number of identical circles inside the unit circle container, where the packing is complicated by the presence of fixed size circular prohibited areas. Here the objective is to maximise the radius of the identical circles. We present a heuristic for the problem based upon formulation space search. Computational results are given for six test problems involving the packing of up to 100 circles. One test problem has a single prohibited area made up from the union of circles of different sizes. Four test problems are annular containers, which have a single inner circular prohibited area. One test problem has circular prohibited areas that are disconnected.
Recommendations
- Packing equal circles into a circle with circular prohibited areas
- A formulation space search heuristic for packing unequal circles in a fixed size circular container
- Proportional packing of circles in a circular container
- A heuristic for the circle packing problem with a variety of containers
- A mathematical model and a solution method of the packing problem of maximal number of equal circles into a non-convex region with prohibited areas
Cites work
- A formulation space search heuristic for packing unequal circles in a fixed size circular container
- A heuristic for the circle packing problem with a variety of containers
- A literature review on circle and sphere packing problems: models and methodologies
- A new local search for continuous location problems
- A note on solving MINLP's using formulation space search
- A variable neighbourhood search approach to the cutwidth minimization problem
- An improved algorithm for the packing of unequal circles within a larger containing circle
- Corrigendum to ``Variable space search for graph coloring [Discrete Appl. Math. 156, No.\,13, 2551--2560 (2008; Zbl 1213.05085)]
- Formulation space search approach for the teacher/class timetabling problem
- Formulation Space Search for Circle Packing Problems
- Greedy vacancy search algorithm for packing equal circles in a square
- Minimizing the object dimensions in circle and sphere packing problems
- New and improved results for packing identical unitary radius circles within triangles, rectangles and strips
- New approaches to circle packing in a square. With program codes.
- Packing congruent hyperspheres into a hypersphere
- Packing equal circles into a circle with circular prohibited areas
- Packing unequal circles using formulation space search
- Packing unequal rectangles and squares in a fixed size circular container using formulation space search
- Parallel variable neighbourhood search strategies for the cutwidth minimization problem
- Quasi-phi-functions and optimal packing of ellipses
- Recursive circle packing problems
- Reformulation descent applied to circle packing problems
- Solving circle packing problems by global optimization: numerical results and industrial applications
- Solving the maximum min-sum dispersion by alternating formulations of two different problems
- Variable neighborhood formulation search approach for the multi-item capacitated lot-sizing problem with time windows and setup times
- Variable neighborhood search: basics and variants
- Variable space search for graph coloring
Cited in
(10)- Optimized packing multidimensional hyperspheres: a unified approach
- Wildfire burn scar encapsulation. Subsetting common spatial domains for post-wildfire debris flow predictions over the United States
- Optimal packings for filled rings of circles.
- Constrained circles packing test problems: all the optimal solutions known
- A formulation space search heuristic for packing unequal circles in a fixed size circular container
- A mathematical model and a solution method of the packing problem of maximal number of equal circles into a non-convex region with prohibited areas
- Packing equal circles into a circle with circular prohibited areas
- Proportional packing of circles in a circular container
- A heuristic for the circle packing problem with a variety of containers
- Solution-hashing search based on layout-graph transformation for unequal circle packing
This page was built for publication: Packing a fixed number of identical circles in a circular container with circular prohibited areas
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2329665)
